Concatenated Quantum Codes

Abstract

One of the main problems for the future of practical quantum computing is to stabilize the computation against unwanted interactions with the environment and imperfections in the applied operations. Existing proposals for quantum memories and quantum channels require gates with asymptotically zero error to store or transmit an input quantum state for arbitrarily long times or distances with fixed error. In this report a method is given which has the property that to store or transmit a qubit with maximum error $\epsilon$ requires gates with error at most $c\epsilon$ and storage or channel elements with error at most $\epsilon$, independent of how long we wish to store the state or how far we wish to transmit it. The method relies on using concatenated quantum codes with hierarchically implemented recovery operations. The overhead of the method is polynomial in the time of storage or the distance of the transmission. Rigorous and heuristic lower bounds for the constant $c$ are given.

16 pages in PostScirpt, the paper is also avalaible at http://qso.lanl.gov/qc/

Cited by in corpus (33)

• Fault-tolerant quantum computation by anyons
• A Theory of Fault-Tolerant Quantum Computation
• Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions
• Multilevel distillation of magic states for quantum computing
• Quantum accuracy threshold for concatenated distance-3 codes
• Space, time, parallelism and noise requirements for reliable quantum computing
• Toward fault-tolerant quantum computation without concatenation
• Exact Performance of Concatenated Quantum Codes
• Attacking the Quantum Internet
• Pauli Exchange Errors in Quantum Computation
• Level Reduction and the Quantum Threshold Theorem
• Universal programmable photonic architecture for quantum information processing
• Fault-Tolerant Quantum Computation with Constant Overhead
• Quantum Computing and Error Correction
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
• Fault-tolerant Coding for Quantum Communication
• Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances
• Purifying Quantum States: Quantum and Classical Algorithms
• Accuracy threshold for postselected quantum computation
• Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
• Quantum computing, phase estimation and applications
• 5-qubit quantum error correction in a charge qubit quantum computer
• An Introduction to Error-Correcting Codes: From Classical to Quantum
• Rethinking Renormalization for Quantum Phase Transitions
• An Upper Bound to the Number of Gates on Single Qubit within One Error-Correction Period of Quantum Computation
• Finding the disjointness of stabilizer codes is NP-complete
• Demonstration of High-Fidelity Entangled Logical Qubits using Transmons
• A note on threshold theorem of fault-tolerant quantum computation
• Approaches to Quantum Error Correction
• Quantum communication and the creation of maximally entangled pairs of atoms over a noisy channel
• Oscillator-to-oscillator codes do not have a threshold
• Channel Polarization of Two-dimensional-input Quantum Symmetric Channels
• Concatenation of Error Avoiding with Error Correcting Quantum Codes for Correlated Noise Models