Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes

Abstract

The preparation of high-fidelity non-Clifford (magic) states is an essential subroutine for universal quantum computation, but imposes substantial space-time overhead. Magic state factories based on high rate and distance quantum low-density parity check (LDPC) codes equipped with transversal non-Clifford gates can potentially reduce these overheads significantly, by circumventing the need for multiple rounds of distillation and by producing a large number of magic states in a single code-block. As a step towards realizing efficient, fault-tolerant magic state production, we introduce a class of finite block-length quantum LDPC codes which we name tricycle codes, generalizing the well-known bicycle codes to three homological dimensions. These codes can support constant-depth physical circuits that implement logical $CCZ$ gates between three code blocks. To construct these constant-depth $CCZ$ circuits, we develop new analytical and numerical techniques that apply to a broad class of three-dimensional homological and balanced product codes. We further show that tricycle codes enable single-shot state-preparation and error correction, leading to a highly efficient magic-state generation protocol. Numerical simulations of specific codes confirm robust performance under circuit-level noise, demonstrating a high circuit-noise threshold of $>0.5\%$. With modest post-selection, certain tricycle codes of block-lengths of only $50-100$ qubits are shown to achieve logical error-rates of $6\times 10^{-10}$ or lower. Finally, we construct optimal depth syndrome extraction circuits for tricycle codes and present a protocol for implementing them efficiently on a reconfigurable neutral atom platform.

Main text + Appendix + Supplementary Material. Ancillary files: 1 movie and associated caption

References in corpus (48)

• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Logical quantum processor based on reconfigurable atom arrays
• Programmable quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
• Demonstration of Entanglement of Electrostatically Coupled Singlet-Triplet Qubits
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Restrictions on Transversal Encoded Quantum Gate Sets
• High-threshold and low-overhead fault-tolerant quantum memory
• Experimental Quantum Computations on a Topologically Encoded Qubit
• Stim: a fast stabilizer circuit simulator
• Magic state distillation with low overhead
• A Race Track Trapped-Ion Quantum Processor
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• The XZZX Surface Code
• High-fidelity gates with mid-circuit erasure conversion in a metastable neutral atom qubit
• Fault-tolerant quantum computation against biased noise
• Topological Computation without Braiding
• Decoding Across the Quantum LDPC Code Landscape
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Single-shot fault-tolerant quantum error correction
• Unfolding the color code
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Balanced Product Quantum Codes
• Quantum "hyperbicycle" low-density parity check codes with finite rate
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Fault-tolerant error correction with the gauge color code
• A theory of single-shot error correction for adversarial noise
• Continuous operation of large-scale atom arrays in optical lattices
• Towards low overhead magic state distillation
• Distillation with sublogarithmic overhead
• Experimental Demonstration of Logical Magic State Distillation
• Architectural mechanisms of a universal fault-tolerant quantum computer
• Continuous operation of a coherent 3,000-qubit system
• Higher-dimensional quantum hypergraph-product codes
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
• Localized statistics decoding for quantum low-density parity-check codes
• Magic of quantum hypergraph states
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• Demonstration of low-overhead quantum error correction codes
• Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes
• QDistRnd: A GAP package for computing the distance of quantum error-correcting codes
• Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
• Leveraging Qubit Loss Detection in Fault Tolerant Quantum Algorithms
• Fault-tolerant logical measurements via homological measurement
• A Gap in the Subrank of Tensors
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Code conversion with the quantum Golay code for a universal transversal gate set
• Single-shot preparation of hypergraph product codes via dimension jump