REVIEW 14 cited by
Quantum accuracy threshold for concatenated distance-3 codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum accuracy threshold for concatenated distance-3 codes
read the original abstract
We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \times 10^{-5} for an adversarial independent stochastic noise model, is derived from a computer-assisted combinatorial analysis; it is the best lower bound that has been rigorously proven so far.
Forward citations
Cited by 14 Pith papers
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
-
Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes
A closed-form resource estimation tool for concatenated quantum error correction reveals that magic-state operations rarely dominate qubit costs, with general optimizations providing orders-of-magnitude larger reducti...
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
Complementary 3D color codes for transversal quantum logic
Complementary tetrahedral and H-tetrahedral 3D color codes supply transversal magic and most entanglement; a pieceable round-robin CZ with 2D Steane extraction completes a universal FT gate set.
-
Realizing Error Suppression in Partially Fault-Tolerant Quantum Simulations with IBM Quantum Computers
Partially fault-tolerant [[4,2,2]] Iceberg-code simulations on ibm_boston improve local Ising observables over unencoded baselines by a few percent in 1D and over 200% in 2D at late times via Observable-Ranked Postselection.
-
Gauging the Spacetime Code
Gauging the spacetime code produces a lattice gauge theory inheriting circuit fault tolerance, with applications to foliated MBQC, classical memory in mixed topological states, and learnable Pauli noise degrees of freedom.
-
Lottery BP: Unlocking Quantum Error Decoding at Scale
Lottery BP adds randomness to belief propagation decoding and uses syndrome voting to achieve far higher accuracy on topological quantum codes while reducing reliance on expensive global decoders.
-
Lottery BP: Unlocking Quantum Error Decoding at Scale
A randomized, locally-guided belief-propagation decoder breaks degeneracy deadlocks in quantum error correction, reducing logical error rate and expensive global-decoder invocations by orders of magnitude.
-
Rigorous estimation of error thresholds of transversal Clifford logical circuits
Generalizes stat-mech mapping from toric code memories to transversal Clifford circuits, mapping tCNOT to random Ashkin-Teller and 4-body Ising models and estimating reduced thresholds of p=0.080 and p>=0.028.
-
Enhancing Fault-Tolerant Surface Code Decoding with Iterative Lattice Reweighting
An iterative reweighting decoder for surface codes uses X-Z error correlations from circuit-level noise, improving logical error rates and raising the threshold from about 1% to 1.16%.
-
Maximally Sensitive Sets of States
GHZ states in X, Y, and Z bases form a maximally sensitive set allowing straightforward tests to identify coherent errors in quantum gates, measurements, and state preparation.
-
A Cross-Platform Analysis of High-Performance Quantum Error Correction Codes
A binomial fault-count model estimates QEC logical error rates from N_loc and p_loc, reproduces simulation trends, and identifies distributed-QPU sweet spots under interconnect noise.
-
Simulation of Non-Markovian Quantum Accelerated Dynamics via Time-Fractional Schr\"odinger Equation
Wei's TFSE simulates non-Markovian accelerated dynamics in the RDJC model more accurately across all fractional orders and with higher computational efficiency than Naber's TFSE.
-
Native Non-Clifford Gates in Quantum LDPC Codes: Conditions, Synthesis, and Scaling Limits
The main theorem claiming constant-depth logical CCZ gates exist from many 'magic-friendly triples' has mutually inconsistent hypotheses, and its key local-implementation step is unproved.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.