An efficient magic state approach to small angle rotations
arXiv:1603.04230 · doi:10.1088/2058-9565/1/1/015007
Abstract
Standard error correction techniques only provide a quantum memory and need extra gadgets to perform computation. Central to quantum algorithms are small angle rotations, which can be fault-tolerantly implemented given a supply of an unconventional species of magic state. We present a low-cost distillation routine for preparing these small angle magic states. Our protocol builds on the work of Duclos-Cianci and Poulin [Phys. Rev. A, 91, 042315 (2015)] by compressing their circuit. Additionally, we present a method of diluting magic states that reduces costs associated with very small angle rotations. We quantify performance by the expected number of noisy magic states consumed per rotation, and compare with other protocols. For modest size angles, our protocols offer a factor 24 improvement over the best known gate synthesis protocols and a factor 2 over the Duclos-Cianci and Poulin protocol. For very small angle rotations, the dilution protocol dramatically reduces costs, giving several orders magnitude improvement over competitors. There also exists an intermediary regime of small, but not very small, angles where our approach gives a marginal improvement over gate synthesis. We discuss how different performance metrics may alter these conclusions.
Author's final version. Extended analysis to higher levels of Clifford hierarchy. Addition of magic state dilution for small angle magic states
References in corpus (16)
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological fault-tolerance in cluster state quantum computation
- Restrictions on Transversal Encoded Quantum Gate Sets
- Magic state distillation with low overhead
- Solving strongly correlated electron models on a quantum computer
- Topological Computation without Braiding
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Efficient synthesis of universal Repeat-Until-Success circuits
- Multilevel distillation of magic states for quantum computing
- Fault-tolerant error correction with the gauge color code
- Efficient synthesis of probabilistic quantum circuits with fallback
- Distilling one-qubit magic states into Toffoli states
- Reducing the quantum computing overhead with complex gate distillation
- Qutrit Magic State Distillation Tight in Some Directions
- Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
Cited by in corpus (24)
- Roads towards fault-tolerant universal quantum computation
- Application of a resource theory for magic states to fault-tolerant quantum computing
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- A random compiler for fast Hamiltonian simulation
- Building a fault-tolerant quantum computer using concatenated cat codes
- Quantum computation with realistic magic state factories
- A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
- The ZX calculus is a language for surface code lattice surgery
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Towards quantum enhanced adversarial robustness in machine learning
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Shorter gate sequences for quantum computing by mixing unitaries
- Unifying gate-synthesis and magic state distillation
- Lattice Surgery Translation for Quantum Computation
- Amplitude Estimation from Quantum Signal Processing
- Quantifying non-stabilizerness via information scrambling
- Fault-tolerant quantum metrology
- Accelerating Quantum Algorithms with Precomputation
- Unlocking early fault-tolerant quantum computing with mitigated magic dilution
- Cost-optimal single-qubit gate synthesis in the Clifford hierarchy
- High-precision and low-depth quantum algorithm design for eigenstate problems
- Low Depth Phase Oracle Using a Parallel Piecewise Circuit
- Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code
- Analysis of quantum information processors using quantum metrology