Resource optimization for fault-tolerant quantum computing
arXiv:1410.5124
Abstract
In this thesis we examine a variety of techniques for reducing the resources required for fault-tolerant quantum computation. First, we show how to simplify universal encoded computation by using only transversal gates and standard error correction procedures, circumventing existing no-go theorems. We then show how to simplify ancilla preparation, reducing the cost of error correction by more than a factor of four. Using this optimized ancilla preparation, we develop improved techniques for proving rigorous lower bounds on the noise threshold. Additional overhead can be incurred because quantum algorithms must be translated into sequences of gates that are actually available in the quantum computer. In particular, arbitrary single-qubit rotations must be decomposed into a discrete set of fault-tolerant gates. We find that by using a special class of non-deterministic circuits, the cost of decomposition can be reduced by as much as a factor of four over state-of-the-art techniques, which typically use deterministic circuits. Finally, we examine global optimization of fault-tolerant quantum circuits under physical connectivity constraints. We adapt techniques from VLSI in order to minimize time and space usage for computations in the surface code, and we develop a software prototype to demonstrate the potential savings.
231 pages, Ph.D. thesis, University of Waterloo
References in corpus (89)
- Non-Abelian Anyons and Topological Quantum Computation
- Quantum Computing
- Quantum algorithm for solving linear systems of equations
- Surface codes: Towards practical large-scale quantum computation
- 14-qubit entanglement: creation and coherence
- Local stabilizer codes in three dimensions without string logical operators
- Realization of Three-Qubit Quantum Error Correction with Superconducting Circuits
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- High threshold universal quantum computation on the surface code
- Restrictions on Transversal Encoded Quantum Gate Sets
- Implementation of a Toffoli Gate with Superconducting Circuits
- Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
- Long term performance of the SwissQuantum quantum key distribution network in a field environment
- Simulating chemistry using quantum computers
- Magic state distillation with low overhead
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Realization of the quantum Toffoli gate with trapped ions
- Quantum algorithms for algebraic problems
- Implementing the Quantum von Neumann Architecture with Superconducting Circuits
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Quantum circuits of T-depth one
- Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
- Novel constructions for the fault-tolerant Toffoli gate
- Towards practical classical processing for the surface code
- Fault-tolerant quantum computation against biased noise
- Interacting Fibonacci anyons in a Rydberg gas
- Exact synthesis of multiqubit Clifford+T circuits
- Implementation of Energy Efficient Single Flux Quantum (eSFQ) Digital Circuits with sub-aJ/bit Operation
- Classification of topologically protected gates for local stabilizer codes
- Simulating chemistry efficiently on fault-tolerant quantum computers
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Multilevel distillation of magic states for quantum computing
- Codeword Stabilized Quantum Codes
- Parallelizing Quantum Circuits
- Quantum Error Correcting Codes Using Qudit Graph States
- Combining dynamical decoupling with fault-tolerant quantum computation
- Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
- Surface code implementation of block code state distillation
- Coping with qubit leakage in topological codes
- Using concatenated quantum codes for universal fault-tolerant quantum gates
- Surface code with decoherence: An analysis of three superconducting architectures
- High-fidelity CZ gate for resonator-based superconducting quantum computers
- Fault-tolerant quantum computing with color codes
- Ancilla-Driven Universal Quantum Computation
- Understanding the effects of leakage in superconducting quantum error detection circuits
- A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
- Efficient Decomposition of Single-Qubit Gates into Basis Circuits
- Fault-tolerant quantum computation versus Gaussian noise
- Experimental implementation of encoded logical qubit operations in a perfect quantum error correcting code
- A bridge to lower overhead quantum computation
- Experimental magic state distillation for fault-tolerant quantum computing
- Modeling quantum noise for efficient testing of fault-tolerant circuits
- Proof of finite surface code threshold for matching
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
- Demonstration of sufficient control for two rounds of quantum error correction in a solid state ensemble quantum information processor
- The Fibonacci scheme for fault-tolerant quantum computation
- Distilling one-qubit magic states into Toffoli states
- Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
- Quantum Logic between Remote Quantum Registers
- How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation
- Optimally combining dynamical decoupling and quantum error correction
- Time-optimal quantum computation
- On triply even binary codes
- High-threshold topological quantum error correction against biased noise
- Optimal complexity correction of correlated errors in the surface code
- Classical Processing Requirements for a Topological Quantum Computing System
- NMR Analog of Bell's Inequalities Violation Test
- Complex instruction set computing architecture for performing accurate quantum rotations with less magic
- Composite Toffoli gate with two-round error detection
- Accuracy threshold for concatenated error detection in one dimension
- Tight Noise Thresholds for Quantum Computation with Perfect Stabilizer Operations
- Topological One-Way Quantum Computation on Verified Logical Cluster States
- Quantum circuit optimization by topological compaction in the surface code
- Global Quantum Circuit Optimization
- Synthesis of unitaries with Clifford+T circuits
- Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation
- Logic Synthesis for Fault-Tolerant Quantum Computers
- Implementation of a three-qubit quantum error correction code in a cavity-QED setup
- 3D local qupit quantum code without string logical operator
- 3-d quantum stabilizer codes with a power law energy barrier
- Distillation protocols for Fourier states in quantum computing
- Ancilla Driven Quantum Computation with arbitrary entangling strength
- Experimental Implementation of a Codeword Stabilized Quantum Code
- Twisted graph states for ancilla-driven quantum computation
- Globally controlled fault tolerant quantum computation
- The Role of Correlated Noise in Quantum Computing
- Checking the error correction strength of arbitrary surface code logical gates
- Fault tolerant Quantum Information Processing with Holographic control