Fault-Tolerant Quantum Computation with Constant Overhead
read the original abstract
What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol.
This paper has not been read by Pith yet.
Forward citations
Cited by 19 Pith papers
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
LightStim automates DEM construction for QEC protocols via an augmented Pauli tableau during compilation, matching public tools on detector counts and error rates while enabling new cross-code designs.
-
In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes
A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showin...
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
QMCtwin: Master-Equation Simulation of Syndrome Statistics Beyond Pauli Noise
QMCtwin simulates master-equation syndrome statistics for a distance-7 surface code and reveals biases and correlations absent in Pauli-twirled models.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
LightStim automates DEM construction for QEC protocols via a record-augmented Pauli tableau tracker, validated across memory, logical operations, distillation, and a novel cross-code lattice surgery design.
-
Simplified circuit-level decoding using Knill error correction
Knill error correction reduces circuit-level decoding for quantum LDPC codes to the simpler code-capacity decoder while remaining fault-tolerant under locally decaying noise.
-
Parallel Logical Measurements via Quantum Code Surgery
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
-
Scaling-optimal purification of noisy qubit unitary channels
A U(2)-covariant parallel protocol based on a novel entanglement-assisted QECC purifies noisy qubit unitaries with O(1/n) noise scaling shown to be asymptotically optimal in the low-noise regime.
-
Algebra of Bivariate-Bicycle Surface Codes
BBS code dimension equals the algebraic multiplicity of finite nonzero common roots of the defining bivariate polynomials, enabling a root-based prescription for arbitrary boundary shapes that avoids corner correction...
-
Asymptotic Limits of Entanglement Distribution
Entanglement preservation over arbitrary distances in quantum repeater networks is possible if and only if the channel has a correctable subspace, with parallel channel uses needing logarithmic scaling otherwise.
-
LEAD: A Local Ensemble-Assisted Parallel Decoding Framework for Quantum Tanner Codes
LEAD projects quantum Tanner codes onto local vertex-neighborhood subcodes for parallel error estimation, then uses topological symmetry and soft-information regularization to enforce global consistency, yielding lowe...
-
Spatial overhead reduction for 2D hypergraph product codes
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and...
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
A tree-encoded fusion scheme and MemTree compiler suppress fusion erasure errors in photonic MBQC, achieving large execution-time reductions over prior compilers with real-hardware validation.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
Novelty search generates diverse continuous multimodal landscapes with direct basin definitions, enabling low-cost local optima networks whose features predict evolutionary algorithm performance.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 site...
-
Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the...
-
Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
-
Decoding Quantum LDPC Codes using Collaborative Check Node Removal
A collaborative BP decoder for QLDPC codes uses check node removal and information measurements to mitigate trapping sets via increased qubit separation.
-
Logical Resource Estimation for Quantum State Preparation with Compilation
Sampling-based methods for quantum state preparation achieve asymptotically lower T-count than rotation-based methods and maintain an advantage in total gate count after accounting for compilation overhead.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.