A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
arXiv:1606.01904 · doi:10.1103/PhysRevA.95.022316
Abstract
The standard approach to fault-tolerant quantum computation is to store information in a quantum error correction code, such as the surface code, and process information using a strategy that can be summarized as distill-then-synthesize. In the distill step, one performs several rounds of distillation to create high-fidelity logical qubits in a magic state. Each such magic state provides one good T gate. In the synthesize step, one seeks the optimal decomposition of an algorithm into a sequence of many T gates interleaved with Clifford gates. This gate-synthesis problem is well understood for multiqubit gates that do not use any Hadamards. We present an in-depth analysis of a unified framework that realises one round of distillation and multiqubit gate synthesis in a single step. We call these synthillation protocols, and show they lead to a large reduction in resource overheads. This is because synthillation can implement a general class of circuits using the same number of T-states as gate synthesis, yet with the benefit of quadratic error suppression. This general class includes all circuits primarily dominated by control-control-Z gates, such as adders and modular exponentiation routines used in Shor's algorithm. Therefore, synthillation removes the need for a costly round of magic state distillation. We also present several additional results on the multiqubit gate-synthesis problem. We provide an efficient algorithm for synthesizing unitaries with the same worst-case resource scaling as optimal solutions. For the special case of synthesizing controlled-unitaries, our techniques are not just efficient but exactly optimal. We observe that the gate-synthesis cost, measured by T-count, is often strictly subadditive. Numerous explicit applications of our techniques are also presented.
Authors' final copy (Accepted to Phys Rev A). 23 pages. This is one of a pair of companion papers. The more concise 5 page paper is entitled "Unifying gate-synthesis and magic state distillation". Fixed typo in discussion of Lemma 3. Thanks to Anqi Gong for spotting some (postpublication) errors in case 6 of Table I and Example IV.3, both of which are fixed in this version
References in corpus (38)
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Computing with Very Noisy Devices
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Topological fault-tolerance in cluster state quantum computation
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Restrictions on Transversal Encoded Quantum Gate Sets
- Magic state distillation with low overhead
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Quantum circuits of T-depth one
- Layered architecture for quantum computing
- Novel constructions for the fault-tolerant Toffoli gate
- Enhanced fault-tolerant quantum computing in -level systems
- The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Quantum computation with realistic magic state factories
- Efficient synthesis of universal Repeat-Until-Success circuits
- 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
- Qudit versions of the qubit "pi-over-eight" gate
- Quantum Measurements and Gates by Code Deformation
- Fault-tolerant error correction with the gauge color code
- Qutrit Magic State Distillation
- Surface code implementation of block code state distillation
- Using concatenated quantum codes for universal fault-tolerant quantum gates
- Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
- Unifying gate-synthesis and magic state distillation
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- Distilling one-qubit magic states into Toffoli states
- Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
- Reducing the quantum computing overhead with complex gate distillation
- Qutrit Magic State Distillation Tight in Some Directions
- An efficient magic state approach to small angle rotations
- Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
Cited by in corpus (69)
- A Quantum Engineer's Guide to Superconducting Qubits
- Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes
- Roads towards fault-tolerant universal quantum computation
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Building a fault-tolerant quantum computer using concatenated cat codes
- Magic State Distillation: Not as Costly as You Think
- Quantum computation with realistic magic state factories
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Lower bounds on the non-Clifford resources for quantum computations
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- Measuring magic on a quantum processor
- Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- Towards quantum enhanced adversarial robustness in machine learning
- Applying quantum algorithms to constraint satisfaction problems
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Robust quantum compilation and circuit optimisation via energy minimisation
- Unifying gate-synthesis and magic state distillation
- On Optimality of CSS Codes for Transversal
- Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
- Stabilizer entropy dynamics after a quantum quench
- Pseudomagic Quantum States
- Characterization of an operational quantum resource in a critical many-body system
- SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
- Morphing quantum codes
- Bell sampling from quantum circuits
- Phase transition in Stabilizer Entropy and efficient purity estimation
- Qutrit and Ququint Magic States
- High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
- Universal limitations on implementing resourceful unitary evolutions
- Constraints on magic state protocols from the statistical mechanics of Wigner negativity
- Verifying the Smallest Interesting Colour Code with Quantomatic
- Quantifying dynamical magic with completely stabilizer preserving operations as free
- A Finite Presentation of CNOT-Dihedral Operators
- Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
- Quantum Simulations of Chemistry in First Quantization with any Basis Set
- Error rates and resource overheads of encoded three-qubit gates
- Classification of Small Triorthogonal Codes
- Efficient Formal Verification of Quantum Error Correcting Programs
- Designing the Quantum Channels Induced by Diagonal Gates
- Classical Coding Problem from Transversal Gates
- Quantum Pin Codes
- Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
- On Groups in the Qubit Clifford Hierarchy
- Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
- Sufficient condition for universal quantum computation using bosonic circuits
- Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
- Code switching revisited: Low-overhead magic state preparation using color codes
- Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set
- Climbing the Diagonal Clifford Hierarchy
- Magic state distillation with punctured polar codes
- Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States
- Geometric structure and transversal logic of quantum Reed-Muller codes
- A Universal Circuit Set Using the Quantum Double
- Measurement sequences for magic state distillation
- Lower T-count with faster algorithms
- Transversal Clifford and T-gate codes of short length and high distance
- Non-stabilizerness and entanglement from cat-state injection
- Classical Coding Approaches to Quantum Applications
- Efficient simulation of logical magic state preparation protocols
- Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
- Machine learning logical gates for quantum error correction
- Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
- Logical Noise Bias in Magic State Injection
- Noise-Canceling Quantum Feedback: non-Hermitian Dynamics with Applications to State Preparation and Magic State Distillation
- Transversal AND in Quantum Codes
- Universal quantum computation via scalable measurement-free error correction
- RESCQ: Realtime Scheduling for Continuous Angle Quantum Error Correction Architectures