Overhead analysis of universal concatenated quantum codes

Abstract

We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes. Namely, we examine the concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code, which allows for the construction of the 49 and 105-qubit codes that do not require the need for magic state distillation for universality. We compute a lower bound for the adversarial noise threshold of the 105-qubit code and find it to be $8.33\times 10^{-6}.$ We obtain a depolarizing noise threshold for the 49-qubit code of $9.69\times 10^{-4}$ which is competitive with the 105-qubit threshold result of $1.28\times 10^{-3}$. We then provide lower bounds on the resource requirements of the 49 and 105-qubit codes and compare them with the surface code implementation of a logical $T$ gate using magic state distillation. For the sampled input error rates and noise model, we find that the surface code achieves a smaller overhead compared to our concatenated schemes.

arXiv comment25 pages, 17 figures; in v2, some content has been moved to an appendix, a few tables have been restructured and the the title has been updated to conform to journal specifications. v3 fixes minor typos in Figs. 1 & 6

References in corpus (30)

• Surface codes: Towards practical large-scale quantum computation
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Scalable multi-particle entanglement of trapped ions
• Reliable Quantum Computers
• State preservation by repetitive error detection in a superconducting quantum circuit
• Restrictions on Transversal Encoded Quantum Gate Sets
• Active stabilisation, quantum computation and quantum state synthesis
• Implementing a strand of a scalable fault-tolerant quantum computing fabric
• Scalable Architecture for a Room Temperature Solid-State Quantum Information Processor
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Layered architecture for quantum computing
• Demonstration of weight-four parity measurements in the surface code architecture
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
• Fault-tolerant logical gates in quantum error-correcting codes
• Quantum accuracy threshold for concatenated distance-3 codes
• Using concatenated quantum codes for universal fault-tolerant quantum gates
• Architectural design for a topological cluster state quantum computer
• Requirements for fault-tolerant factoring on an atom-optics quantum computer
• Universal fault-tolerant gates on concatenated stabilizer codes
• A scalable, high-speed measurement-based quantum computer using trapped ions
• Quantum Dot Cluster State Computing with Encoded Qubits
• Thresholds for universal concatenated quantum codes
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Level Reduction and the Quantum Threshold Theorem
• Gauge color codes in two dimensions
• Fast fault-tolerant filtering of quantum codewords
• Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing

Cited by in corpus (33)

• Roads towards fault-tolerant universal quantum computation
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Flag fault-tolerant error correction with arbitrary distance codes
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Deep neural decoders for near term fault-tolerant experiments
• Fault-tolerant magic state preparation with flag qubits
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Fault-tolerant preparation of approximate GKP states
• Optimizing resource efficiencies for scalable full-stack quantum computers
• Flag fault-tolerant error correction, measurement, and quantum computation for cyclic CSS codes
• Hard decoding algorithm for optimizing thresholds under general Markovian noise
• A circuit-level protocol and analysis for twist-based lattice surgery
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• Universal bound on the cardinality of local hidden variables in networks
• Improving the efficiency of joint remote state preparation in noisy environment with weak measurement
• Is error detection helpful on IBM 5Q chips ?
• Adaptive syndrome measurements for Shor-style error correction
• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
• Error rates and resource overheads of encoded three-qubit gates
• Achieving fault tolerance on capped color codes with few ancillas
• Fault-tolerant gates via homological product codes
• Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing
• Fault-tolerant quantum error correction using error weight parities
• Error suppression via complementary gauge choices in Reed-Muller codes
• Scatter-Gather DMA Performance Analysis within an SoC-based Control System for Trapped-Ion Quantum Computing
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Robustness of the concatenated quantum error-correction protocol against noise for channels affected by fluctuation
• Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
• Demonstration of two-dimensional connectivity for a scalable error-corrected ion-trap quantum processor architecture
• Optimization tools for distance-preserving flag fault-tolerant error correction
• The resource cost of large scale quantum computing
• Universal quantum computation via scalable measurement-free error correction