Surface code implementation of block code state distillation
arXiv:1301.7107 · doi:10.1038/srep01939
Abstract
State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states |A>=(|0>+e^{iπ/4}|1>)/\sqrt{2} produced a single improved |A> state given 15 input copies. New block code state distillation methods can produce k improved |A> states given 3k+8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three.
26 pages, 28 figures
References in corpus (13)
- Surface codes: Towards practical large-scale quantum computation
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Topological fault-tolerance in cluster state quantum computation
- Magic state distillation with low overhead
- Topological Computation without Braiding
- Improved magic states distillation for quantum universality
- Multilevel distillation of magic states for quantum computing
- Two-Dimensional Arrays of RF Ion Traps with Addressable Interactions
- A bridge to lower overhead quantum computation
- Quantum Circuits for Measuring Levin-Wen Operators
- Time-optimal quantum computation
- Topological One-Way Quantum Computation on Verified Logical Cluster States
Cited by in corpus (62)
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Roads towards fault-tolerant universal quantum computation
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Trading classical and quantum computational resources
- Building a fault-tolerant quantum computer using concatenated cat codes
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Magic State Distillation: Not as Costly as You Think
- Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
- Enhanced fault-tolerant quantum computing in -level systems
- Quantum computation with realistic magic state factories
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Resource costs for fault-tolerant linear optical quantum computing
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
- The surface code with a twist
- A magic state's fidelity can be superior to the operations that created it
- Universal fault-tolerant gates on concatenated stabilizer codes
- Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
- Resilience of quantum random access memory to generic noise
- Error Rates and Resource Overheads of Repetition Cat Qubits
- Unifying gate-synthesis and magic state distillation
- T-count optimization and Reed-Muller codes
- The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
- Error mitigation and quantum-assisted simulation in the error corrected regime
- An efficient magic state approach to small angle rotations
- Advances in Bosonic Quantum Error Correction with Gottesman-Kitaev-Preskill Codes: Theory, Engineering and Applications
- Gauge color codes in two dimensions
- A decoder for the triangular color code by matching on a Möbius strip
- Lattice Surgery Translation for Quantum Computation
- Techniques to Reduce -Parity-Phase Circuits, Motivated by the ZX Calculus
- Composite Toffoli gate with two-round error detection
- Universal limitations on implementing resourceful unitary evolutions
- Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures
- LDPC-cat codes for low-overhead quantum computing in 2D
- High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
- Quantum circuit optimization by topological compaction in the surface code
- Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
- Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
- Logic Synthesis for Fault-Tolerant Quantum Computers
- Color code decoder with improved scaling for correcting circuit-level noise
- Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
- Doubled Color Codes
- Compilation of a simple chemistry application to quantum error correction primitives
- Distillation protocols for Fourier states in quantum computing
- Integrated Analysis of Performance and Resource of Large-Scale Quantum Computing
- Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
- Blind Quantum Computation Using a Circuit-Based Quantum Computer
- Code switching revisited: Low-overhead magic state preparation using color codes
- SurfBraid: A concept tool for preparing and resource estimating quantum circuits protected by the surface code
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Spatially parallel decoding for multi-qubit lattice surgery
- LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
- Resource optimization for fault-tolerant quantum computing
- Limitations on Transversal Computation through Quantum Homomorphic Encryption
- Transversal switching between generic stabilizer codes
- Low Overhead Qutrit Magic State Distillation
- Efficient simulation of logical magic state preparation protocols
- Fault-tolerant fidelity based on few-qubit codes: Parity-check circuits for biased error channels
- Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
- Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code