pith. sign in

arxiv: quant-ph/9705052 · v1 · submitted 1997-05-28 · 🪐 quant-ph

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman This is my paper

Pith reviewed 2026-05-12 22:00 UTC · model grok-4.3

classification 🪐 quant-ph
keywords stabilizer codesquantum error correctionPauli operatorsfault-tolerant computationquantum channel capacityerror boundsdecoherence
0
0 comments X

The pith

Stabilizer codes provide a group-theoretic framework that simplifies construction and analysis of quantum error-correcting codes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents an overview of quantum error correction and argues that stabilizer codes, a subclass defined by group theory, have been particularly useful for generating concrete codes and revealing patterns in their design. It covers how these codes work, lists several known examples, derives limits such as channel capacity and code bounds, and shows routes to fault-tolerant operations. A sympathetic reader would care because controlling decoherence and operational errors is a central obstacle to building working quantum computers and entangled states. The approach reduces many quantum questions to classical-like group properties.

Core claim

A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. The stabilizer formalism defines the code subspace as the common +1 eigenspace of an abelian subgroup of the Pauli group, which allows systematic error detection by measuring the stabilizers and supports analysis of channel capacities, bounds, and fault-tolerant gates.

What carries the argument

The stabilizer group: an abelian subgroup of the Pauli group whose common eigenspace forms the code subspace.

Load-bearing premise

That the group-theoretical structure of stabilizer codes applies broadly to quantum error correction without limitations from specific error models or hardware constraints.

What would settle it

A concrete set of quantum errors that a non-stabilizer code corrects but no abelian Pauli subgroup can detect and correct.

read the original abstract

Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper provides an overview of quantum error correction, emphasizing the stabilizer formalism derived from group theory applied to Pauli operators. It constructs the stabilizer code framework, applies it to explicit examples including CSS codes and the 7-qubit Steane code, derives bounds on code parameters, discusses quantum channel capacity, and sketches fault-tolerant gate constructions using the formalism.

Significance. The stabilizer formalism introduced here has become foundational for constructing and classifying quantum codes, enabling systematic analysis of error correction in the abstract quantum channel model. The paper's derivations are parameter-free and internally consistent, with explicit group-theoretic constructions that support reproducible code generation and bound calculations; this has directly facilitated later developments in fault tolerance without reliance on ad-hoc assumptions.

minor comments (3)
  1. §2: The definition of the stabilizer group could include an explicit statement that it is an abelian subgroup of the Pauli group to avoid ambiguity for readers new to the formalism.
  2. §4.2, discussion of the 7-qubit code: The error-correction condition is stated but the explicit syndrome table is omitted; adding it would improve clarity without lengthening the manuscript substantially.
  3. References: Several early works on quantum codes (e.g., Shor 1995) are cited but the citation list would benefit from consistent formatting and inclusion of the full arXiv identifiers where applicable.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and the recommendation to accept. The review accurately captures the paper's focus on the stabilizer formalism as a group-theoretic tool for quantum error correction, including code construction, examples such as CSS and Steane codes, bounds, channel capacity, and fault tolerance.

Circularity Check

0 steps flagged

No significant circularity in the stabilizer formalism derivation

full rationale

The paper introduces the stabilizer code formalism by directly applying group theory to the Pauli operator group acting on quantum states, deriving commutation relations, code subspaces, and error correction conditions from first principles without any fitted parameters, self-referential definitions, or load-bearing self-citations. Explicit constructions (such as CSS codes and the 7-qubit code) and bounds are obtained as consequences of these group-theoretic properties within the abstract quantum channel model. The derivation chain is self-contained and does not reduce any claimed result to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on standard quantum mechanics and group theory applied to Pauli operators, with the stabilizer concept introduced as a new organizing principle without free parameters or fitted values.

axioms (2)
  • domain assumption Principles of quantum mechanics, including superposition, entanglement, and unitary evolution for describing states and errors.
    Standard background assumed for all quantum information work.
  • domain assumption Commuting sets of Pauli operators can define subspaces that are invariant under certain errors.
    Core mathematical structure for the new stabilizer formalism.
invented entities (1)
  • Stabilizer code no independent evidence
    purpose: A subclass of quantum codes defined by a group of commuting Pauli operators that stabilize the code space.
    Newly defined in the paper to organize and generate quantum error-correcting codes.

pith-pipeline@v0.9.0 · 5391 in / 1362 out tokens · 64676 ms · 2026-05-12T22:00:12.436034+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith.Foundation.DimensionForcing alexander_duality_circle_linking unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 60 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Topological subsystem bivariate bicycle codes with four-qubit check operators

    quant-ph 2026-05 unverdicted novelty 8.0

    Subsystem bivariate bicycle codes achieve high-rate BB logical qubits with local four-qubit gauge checks, yielding examples such as [[108,12,6]] that outperform surface-code alternatives.

  2. An Exponential Advantage for Adaptive Tomography of Structured States under Pauli Basis Measurements

    quant-ph 2026-04 unverdicted novelty 8.0

    For an explicit prefix/tree family of quantum states, adaptive local Pauli tomography achieves polynomial copy complexity while non-adaptive strategies require exponentially many copies.

  3. Gauss law codes and vacuum codes from lattice gauge theories

    quant-ph 2026-04 unverdicted novelty 8.0

    Gauss law codes identify the full gauge-invariant sector as the code space while vacuum codes restrict to the matter vacuum, with the two shown to be unitarily equivalent for finite gauge groups.

  4. In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes

    quant-ph 2026-04 unverdicted novelty 8.0

    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...

  5. Efficient Graph State Purification with Factorized Graph-Preserving Operations across Local Clifford Orbits

    quant-ph 2026-06 unverdicted novelty 7.0

    Introduces factorized graph-preserving Clifford operations organized over local-complementation orbits to optimize finite-size multipartite graph-state purification circuits that outperform recurrence protocols under ...

  6. Representation theory of projective Clifford groups via isocategoricality

    math.RT 2026-06 unverdicted novelty 7.0

    Constructs an explicit tensor isomorphism establishing that the projective Clifford group C(A) and affine symplectic group ASp(A) are isocategorical, yielding uniform irreps, conjugacy parameters, and identical charac...

  7. Random Local Stabilizer Codes in Three Dimensions without String or Self-Similar Fractal Logical Operators

    quant-ph 2026-06 unverdicted novelty 7.0

    Random cubic qutrit codes in 3D retain no-string logical operators but lack self-similar fractal ones, showing degeneracy exponents k=2 (odd L) and k=4 (even L) with plane-logical operators spanning the space.

  8. Projected logical ensembles in surface codes via the random-matrix theory of quantum dots

    quant-ph 2026-06 unverdicted novelty 7.0

    For single-logical-qubit surface codes with uniform X rotations, the projected logical ensemble after syndrome extraction and maximum-likelihood decoding is isomorphic to scattering-matrix ensembles of chaotic quantum...

  9. Invariant Measures and Weak-Magic-Injection Asymptotics in Random Monitored Quantum Circuits

    quant-ph 2026-06 unverdicted novelty 7.0

    Proves unique stationary law for Clifford random monitored quantum circuits and computes leading asymptotics of steady magic, linear for odd-prime dimension mana and quadratic for qubit 2-stabilizer Rényi entropy.

  10. Minimality of the Stabilizer ZX Calculus

    quant-ph 2026-06 unverdicted novelty 7.0

    The stabilizer ZX calculus rule set is minimal because the red/green compact-structure coincidence rule and the bialgebra law are each individually necessary relative to the connectivity meta-rule.

  11. Probabilistically Checking Quantum Proofs, with Interaction

    cs.CC 2026-06 unverdicted novelty 7.0

    A qIOP protocol for QMA with polylog qubit queries, polynomial communication, exponential completeness, and constant soundness gap using quantum LTCs and classical PCPPs.

  12. A five-qubit 1-resistant graph state and stabilizer marginal certificates

    quant-ph 2026-06 unverdicted novelty 7.0

    The five-cycle graph state |C5> is the unique (up to local Clifford) 1-resistant five-qubit stabilizer state; no seven-qubit stabilizer state is m-resistant for nonzero admissible m.

  13. Quantum error correction with the toric code

    quant-ph 2026-06 unverdicted novelty 7.0

    Neutral atom platform achieves repeated toric code syndrome extraction with qubit reloading, preserving logical information over 90 cycles and showing distance-dependent logical error suppression.

  14. Attention-based optimizer for symmetry finding

    quant-ph 2026-05 unverdicted novelty 7.0

    A Set-Transformer architecture with self-attention encodes Pauli-string correlations, optimizes via commutation objective, and finds symmetries with near-deterministic success on physical models like Ising and Toric code.

  15. Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds

    cs.IT 2026-05 unverdicted novelty 7.0

    Univariate bicycle codes give an explicit basis for logical operators and distance upper bounds in a restricted class of quantum LDPC codes while matching the performance of less constrained generalized and bivariate ...

  16. Zeno-Enhanced Probabilistic Error Cancellation with Quantum Error Detection Codes

    quant-ph 2026-05 unverdicted novelty 7.0

    Using post-selection to map physical noise to a weaker accepted logical channel and then applying order-K perturbative PEC reduces sampling overhead by 3-4 orders of magnitude for logical GHZ preparation on up to 200 ...

  17. Distributed estimation of many-body Hamiltonians via punctured surface code

    quant-ph 2026-05 unverdicted novelty 7.0

    Punctured surface codes map disjoint or overlapping Z-couplings to a single logical Z for protected distributed estimation of many-body Hamiltonian parameters.

  18. Multi-Qubit Stabilizer Readout on a Dual-Species Rydberg Array

    quant-ph 2026-05 unverdicted novelty 7.0

    Dual-species Na-Cs Rydberg array enables simultaneous non-destructive readout of multiple Pauli-Z stabilizers on four-qubit plaquettes using a single global pulse sequence after compensating geometric phase errors.

  19. A measure for genuine tripartite entanglement

    quant-ph 2026-05 unverdicted novelty 7.0

    I(n1, n2) is a correlation functional with |I| ≤ 2 for any three-qubit state, saturated only for GHZ-equivalent states under mutually unbiased measurements.

  20. Noise Reduction for Universal Hybrid Oscillator-Qubit Quantum Computation

    quant-ph 2026-04 unverdicted novelty 7.0

    Adding an ancilla qubit to GKP-stabilizer codes reduces Gaussian displacement noise standard deviation from σ to O(σ²) for universal hybrid CV-DV gates.

  21. Harmoniq: Efficient Data Augmentation on a Quantum Computer Inspired by Harmonic Analysis

    quant-ph 2026-04 unverdicted novelty 7.0

    Harmoniq approximates a quantum-harmonic-analysis data augmentation operator as a mixture of at most quadratic-depth n-qubit circuits, enabling modular combination with other quantum subroutines for signal denoising.

  22. Structural Obstruction to Replica Symmetry Breaking for Multi-Entropy in Random Tensor Networks

    hep-th 2026-04 unverdicted novelty 7.0

    Multi-entropy exhibits a structural obstruction to replica symmetry breaking in random tensor networks due to incompatible boundary permutations in the replica hypercube, unlike entanglement negativity.

  23. Sector length distributions of recursively definable graph states through analytic combinatorics

    quant-ph 2026-04 unverdicted novelty 7.0

    Closed-form sector length distributions for recursively definable graph states (paths, cycles, stars, grids) via generating functions, yielding analytical concentratable entanglement, depolarizing fidelity bounds, and...

  24. Dismagicker: Unitary Gate for Non-Stabilizerness Reduction

    quant-ph 2026-04 unverdicted novelty 7.0

    Dismagicker is a non-Clifford unitary that suppresses non-stabilizerness in quantum states, improving simulation accuracy when combined with Clifford disentanglers.

  25. Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code

    quant-ph 2026-03 unverdicted novelty 7.0

    A code-switching protocol in the [[8,3,2]] code yields a universal scheme for postselected fault-tolerant quantum computation with quadratic logical error suppression.

  26. Gauge-invariant QMETTS with mutually unbiased physical bases for $Z_2$ lattice gauge theories at finite temperature and density

    quant-ph 2026-03 conditional novelty 7.0

    Introduces gauge-invariant QMETTS using mutually unbiased physical bases derived from stabilizer formalism for Z2 LGT at finite T and density, with single-shot sampling shown near-optimal and numerical validation in 1+1D.

  27. Simplified circuit-level decoding using Knill error correction

    quant-ph 2026-03 accept novelty 7.0

    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.

  28. Hyper-optimized Quantum Lego Contraction Schedules

    quant-ph 2025-10 conditional novelty 7.0

    A new Sparse Stabilizer Tensor cost function enables hyper-optimized contraction schedules for Quantum LEGO WEP calculations, delivering orders-of-magnitude improvements over dense tensor baselines for stabilizer codes.

  29. Certifying localizable quantum properties with constant sample complexity

    quant-ph 2025-09 unverdicted novelty 7.0

    A new framework certifies global quantum properties including multipartite entanglement, circuit complexity, and quantum magic on small subsystems with constant sample complexity via local Pauli measurements.

  30. Disentangling strategies and entanglement transitions in unitary circuit games with matchgates

    quant-ph 2025-07 unverdicted novelty 7.0

    Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and gene...

  31. Wire Codes

    quant-ph 2024-10 unverdicted novelty 7.0

    Wire codes are a construction that converts any stabilizer code into a local weight-3 subsystem code on an arbitrary graph via low-density Tanner-graph embedding, with overhead governed by the embedding quality.

  32. Magic state cultivation: growing T states as cheap as CNOT gates

    quant-ph 2024-09 unverdicted novelty 7.0

    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.

  33. Resource-theoretic hierarchy of contextuality for general probabilistic theories

    quant-ph 2024-06 unverdicted novelty 7.0

    Defines a resource theory of GPT-contextuality whose free operations are classical systems and univalent simulations, yielding monotones including classical excess (minimal embedding error into infinite classical syst...

  34. Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation

    quant-ph 2026-06 unverdicted novelty 6.0

    A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.

  35. Infinite-Level Hierarchy of Solvable Quantum Circuits

    quant-ph 2026-06 unverdicted novelty 6.0

    An infinite hierarchy of solvability conditions is presented that combines with generalized dual-unitary conditions to enable exact analysis of correlation functions and entanglement dynamics in quantum circuits, with...

  36. Scaling-optimal purification of noisy qubit unitary channels

    quant-ph 2026-06 unverdicted novelty 6.0

    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.

  37. An iterative Ising decoder for quantum error correction codes

    quant-ph 2026-06 unverdicted novelty 6.0

    ILOD approximates X-Z error correlations in Ising-based quantum decoding via iterative Bayesian reweighting, halving maximum interaction order and restoring convergence at larger code distances.

  38. Coset Ensemble Decoder for Quantum Error Correction with Algorithm-Hardware Co-Design

    cs.AR 2026-06 unverdicted novelty 6.0

    Presents a coset ensemble decoder with algorithm-hardware co-design that claims better accuracy-latency trade-off and lower FPGA resource use than MWPM and UF baselines under depolarizing noise.

  39. Quantum resources in non-stoquastic quantum annealing

    quant-ph 2026-06 unverdicted novelty 6.0

    Numerical evidence that non-stoquastic terms in quantum annealing maintain or increase entanglement and non-stabilizerness, aligning quantum performance gains with classical intractability for tensor networks and stab...

  40. Constructions of Quantum $(r,\delta)$-LRCs from cyclic codes

    cs.IT 2026-06 unverdicted novelty 6.0

    Three explicit families of quantum (r,δ)-LRCs are built from cyclic codes, two optimal under the quantum Singleton-like bound when pure, with no length bound relative to field size for constructions 2 and 3.

  41. Adaptive Stabilizer State Fidelity Certification

    quant-ph 2026-05 unverdicted novelty 6.0

    Adaptive gauge selection protocol for stabilizer state fidelity certification that reports full intervals with monotonic tightening and exact recovery on full coverage.

  42. Translation-invariant quantum low-density parity-check codes from compactified fracton models

    quant-ph 2026-05 unverdicted novelty 6.0

    Compactification of a single higher-dimensional hypergraph-product fracton model yields a broad family of translation-invariant quantum LDPC codes that includes fracton models and all A2BGA codes such as BB codes.

  43. Spatial overhead reduction for 2D hypergraph product codes

    quant-ph 2026-05 unverdicted novelty 6.0

    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...

  44. Protocol for Efficient Generation of Fusion-Based Quantum Computing Resource States from Quantum Emitters

    quant-ph 2026-05 unverdicted novelty 6.0

    Logically encoded 24-photon FBQC resource states can be deterministically produced from 3 quantum emitters and 11 CNOT gates by using symmetries to reduce the search over photon emission orderings.

  45. Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations

    quant-ph 2026-05 conditional novelty 6.0

    Mid-circuit stabilizer verification in six-qubit GSE-encoded Clifford Trotter steps reduces logical error rates by up to 54% on Barium ion hardware, with the gain vanishing if checks are deferred to circuit end.

  46. Quantum Magic in early FTQC: From Diagonal Clifford Hierarchy No-Go Theorems to Architecture Design Blueprints

    quant-ph 2026-05 unverdicted novelty 6.0

    No-go theorems prove hierarchy level and state-independent sequences cannot maximize operational magic in early FTQC, requiring state-aware differentiable optimization and nonlinear phases for scalable magic generation.

  47. Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices

    cs.IT 2026-05 unverdicted novelty 6.0

    Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices yield high-rate codes with good cycle properties, automorphism groups, minimum distance, and superior finite-length performanc...

  48. Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices

    cs.IT 2026-05 unverdicted novelty 6.0

    Two new constructions of quantum dual-containing CSS LDPC codes from quasi-dyadic matrices achieve improved finite-length error performance over existing DC codes.

  49. Interplay of Nonstabilizerness and Ergotropy in Quantum Batteries

    quant-ph 2026-05 unverdicted novelty 6.0

    Ergotropy in the battery corresponds one-to-one with total nonstabilizerness under U(1)-symmetric charger-battery interactions, while maximum average charging power in Clifford evolution is achievable even with zero i...

  50. Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches

    quant-ph 2026-04 unverdicted novelty 6.0

    A defect-adaptive lattice surgery technique reconstructs joint logical parities on irregular surface-code patches via GF(2) binary synthesis from seam measurements and pre-merge constraints, yielding executable rules ...

  51. A graph-aware bounded distance decoder for all stabilizer codes

    quant-ph 2026-04 unverdicted novelty 6.0

    A graph-based bounded distance decoder corrects all errors up to a chosen weight in arbitrary stabilizer codes by representing stabilizers and syndromes as graphs and pruning the search space with a feed-forward structure.

  52. Coherence dynamics in quantum many-body systems with conservation laws

    quant-ph 2026-04 unverdicted novelty 6.0

    Conservation laws in quantum circuits and Hamiltonians replace logarithmic coherence saturation with slow hydrodynamic relaxation globally and produce algebraic peak-time growth locally, unlike ergodic cases.

  53. Deterministic generation of grid states with programmable nonlinear bosonic circuits

    quant-ph 2026-04 unverdicted novelty 6.0

    Programmable nonlinear bosonic circuits can deterministically produce phased-comb states that serve as a scalable bosonic quantum error-correcting code with near-optimal performance against boson loss.

  54. GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs

    quant-ph 2026-04 unverdicted novelty 6.0

    GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.

  55. The Rotation Gap Is Not An Error: Ternary Structure in IBM Quantum Hardware

    quant-ph 2026-04 unverdicted novelty 6.0

    IBM quantum hardware has ternary error structure causing sub-Poissonian syndromes; a classifier decoder that skips correcting them cuts logical errors by 7-19%.

  56. Error Correction in Lattice Quantum Electrodynamics with Quantum Reference Frames

    quant-ph 2026-04 unverdicted novelty 6.0

    Lattice QED is established as a quantum error-correcting code beyond stabilizers, with explicit recovery operations constructed via quantum reference frames for gauge and fermionic sectors.

  57. Catalytic Quantum Error Correction: Theory, Efficient Catalyst Preparation, and Numerical Benchmarks

    quant-ph 2026-03 conditional novelty 6.0

    Catalytic Quantum Error Correction recovers known target states from noisy copies with F > 0.96 using only eight copies by preserving coherent modes and applying a CPMG-Clifford-swap-test pipeline, bypassing magnitude...

  58. Transversal gates of the ((3,3,2)) qutrit code and local symmetries of the absolutely maximally entangled state of four qutrits

    quant-ph 2026-01 unverdicted novelty 6.0

    A bijection maps LU orbits of AME states (n even) to orbits of ((n-1,D,n/2))_D codes, with the 4-qutrit AME state and ((3,3,2))_3 code both unique up to LU and their symmetry/transversal groups explicitly generated vi...

  59. Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation

    quant-ph 2026-01 unverdicted novelty 6.0

    Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.

  60. A Concatenated Dual Displacement Code for Continuous-Variable Quantum Error Correction

    quant-ph 2025-11 unverdicted novelty 6.0

    The concatenated dual displacement code suppresses Gaussian displacement error variance by up to 50% under infinite squeezing while correcting lattice-crossing events in CV quantum error correction.

Reference graph

Works this paper leans on

65 extracted references · 65 canonical work pages · cited by 84 Pith papers

  1. [1]

    An unsolvable problem of elementary number t heory,

    A. Church, “An unsolvable problem of elementary number t heory,” Amer. J. Math 58, 345 (1936); A. M. Turing, “On computable numbers, with an application to the Entscheidungsproblem,” Proc. Lond. Mat h. Soc. (2) 42, 230 (1936) and Proc. Lond. Math. Soc. (2) 43, 544 (1937)

    work page 1936

  2. [2]

    Simulating physics with computers,

    R. P. Feynman, “Simulating physics with computers,” Int . J. Theor. Phys. 21, 467 (1982)

    work page 1982

  3. [3]

    Algorithms for quantum computation: discrete logarithms and factoring,

    P. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” Proceedings, 35th Annual Symposium on Fundame ntals of Computer Science, (1994)

    work page 1994

  4. [4]

    A fast quantum mechanical algorithm for da tabase search,

    L. K. Grover, “A fast quantum mechanical algorithm for da tabase search,” Proceedings, 28th ACM Symposium on Theory of Computation, 2 12 (1996)

    work page 1996

  5. [5]

    Strengths and weaknesses of quantum computing,

    C. B. Bennett, E. Bernstein, G. Brassard, and U. Vazirani , “Strengths and weaknesses of quantum computing,” quant-ph/9701001 (1997 )

    work page arXiv 1997

  6. [6]

    Quantum computations with col d trapped ions,

    J. I. Cirac and P. Zoller, “Quantum computations with col d trapped ions,” Phys. Rev. Lett. 74, 4091 (1995)

    work page 1995

  7. [7]

    Demonstration of a fundamental quantum logic gate,

    C. Monroe, D. M. Meekhof, B. E. King, W. M. Itano, and D. J. W ineland, “Demonstration of a fundamental quantum logic gate,” Phys. Rev. Lett. 75, 4714 (1995)

    work page 1995

  8. [8]

    Measurement of conditional phase shifts for quantum logic ,

    Q. A. Turchette, C. J. Hood, W. Lange, H. Mabuchi, and H. J. Kimble, “Measurement of conditional phase shifts for quantum logic ,” Phys. Rev. Lett. 75, 4710 (1995)

    work page 1995

  9. [9]

    Bulk spin resonance quant um computa- tion,

    N. Gershenfeld and I. Chuang, “Bulk spin resonance quant um computa- tion,” Science 275, 350 (1997)

    work page 1997

  10. [10]

    Scheme for reducing decoherence in quantum me mory,

    P. Shor, “Scheme for reducing decoherence in quantum me mory,” Phys. Rev. A 52, 2493 (1995)

    work page 1995

  11. [11]

    Error correcting codes in quantum theory ,

    A. M. Steane, “Error correcting codes in quantum theory ,” Phys. Rev. Lett. 77, 793 (1996). BIBLIOGRAPHY 111

    work page 1996

  12. [12]

    Cohen-Tannoudji, Quantum Mechanics, Wiley, New York (1977)

    C. Cohen-Tannoudji, Quantum Mechanics, Wiley, New York (1977)

    work page 1977

  13. [13]

    F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company, New York (1977)

    work page 1977

  14. [14]

    A single quantum cannot b e cloned,

    W. K. Wootters and W. H. Zurek, “A single quantum cannot b e cloned,” Nature 299, 802 (1982)

    work page 1982

  15. [15]

    A mathematical theory of communication ,

    C. E. Shannon, “A mathematical theory of communication ,” Bell Sys. Tech. J. 27, 379, 623 (1948)

    work page 1948

  16. [16]

    A theory of quantum error-corr ecting codes,

    E. Knill and R. Laflamme, “A theory of quantum error-corr ecting codes,” Phys. Rev. A 55, 900 (1997)

    work page 1997

  17. [17]

    Mixed state en- tanglement and quantum error correction,

    C. Bennett, D. DiVincenzo, J. Smolin, and W. Wootters, “ Mixed state en- tanglement and quantum error correction,” Phys. Rev. A 54, 3824 (1996)

    work page 1996

  18. [18]

    Error preve ntion scheme with four particles,

    L. Vaidman, L. Goldenberg, and S. Wiesner, “Error preve ntion scheme with four particles,” Phys. Rev. A 54, 1745R (1996)

    work page 1996

  19. [19]

    Codes for the Quantum Erasure Channel

    M. Grassl, Th. Beth, and T. Pellizzari, “Codes for the qu antum erasure channel,” quant-ph/9610042 (1996)

    work page Pith review arXiv 1996

  20. [20]

    Ap proximate quantum error correction can lead to better codes,

    D. W. Leung, M. A. Nielsen, I. L. Chuang, Y. Yamamoto, “Ap proximate quantum error correction can lead to better codes,” quant-p h/9704002 (1997)

    work page arXiv 1997

  21. [21]

    Class of quantum error-correcting code s saturating the quantum Hamming bound,

    D. Gottesman, “Class of quantum error-correcting code s saturating the quantum Hamming bound,” Phys. Rev. A 54, 1862 (1996)

    work page 1996

  22. [22]

    Quantum error correction and orthogonal geometry,

    A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloa ne, “Quantum error correction and orthogonal geometry,” Phys. Rev. Lett . 78, 405 (1997)

    work page 1997

  23. [23]

    Quantum shadow enumerators,

    E. Rains, “Quantum shadow enumerators,” quant-ph/961 1001 (1996)

    work page 1996

  24. [24]

    Pefect qu antum error correction code,

    R. Laflamme, C. Miquel, J. P. Paz, and W. Zurek, “Pefect qu antum error correction code,” Phys. Rev. Lett. 77, 198 (1996)

    work page 1996

  25. [25]

    Pasting quantum codes,

    D. Gottesman, “Pasting quantum codes,” quant-ph/9607 027 (1996)

    work page 1996

  26. [26]

    Quantum Error Correction via Codes over GF(4)

    A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloa ne, “Quantum error correction via codes over GF(4),” quant-ph/9608006 ( 1996)

    work page Pith review arXiv 1996

  27. [27]

    Simple quantum error correcting codes,

    A. Steane, “Simple quantum error correcting codes,” Ph ys. Rev. A 54, 4741 (1996)

    work page 1996

  28. [28]

    Quantum Reed-Muller codes,

    A. Steane, “Quantum Reed-Muller codes, ” quant-ph/960 8026 (1996)

    work page 1996

  29. [29]

    Good quantum error-cor recting codes exist,

    A. R. Calderbank and P. W. Shor, “Good quantum error-cor recting codes exist,” Phys. Rev. A 54, 1098 (1996). BIBLIOGRAPHY 112

    work page 1996

  30. [30]

    Multiple particle interference and quantu m error correction,

    A. Steane, “Multiple particle interference and quantu m error correction,” Proc. Roy. Soc. Lond. A 452, 2551 (1996)

    work page 1996

  31. [31]

    Non-binary error bases and quantum codes,

    E. Knill, “Non-binary error bases and quantum codes,” q uant-ph/9608048 (1996); E. Knill, “Group representations, error bases and q uantum codes,” quant-ph/9608049 (1996)

    work page arXiv 1996

  32. [32]

    Correcting quantum errors in higher spin sy stems,

    H. F. Chau, “Correcting quantum errors in higher spin sy stems,” quant- ph/9610023 (1996)

    work page arXiv 1996

  33. [33]

    Five quantum register error correction cod e for higher spin systems,

    H. F. Chau, “Five quantum register error correction cod e for higher spin systems,” quant-ph/9702033 (1997)

    work page arXiv 1997

  34. [34]

    Fault-tolerant quantum com putation with constant error,

    D. Aharonov and M. Ben-Or, “Fault-tolerant quantum com putation with constant error,” quant-ph/9611025 (1996)

    work page arXiv 1996

  35. [35]

    Nonbinary quantum codes,

    E. Rains, “Nonbinary quantum codes,” quant-ph/970304 8 (1997)

    work page 1997

  36. [36]

    Efficient computations of enc odings for quan- tum error correction,

    R. Cleve and D. Gottesman, “Efficient computations of enc odings for quan- tum error correction,” quant-ph/9607030 (1996)

    work page arXiv 1996

  37. [37]

    Quantum gates and circuits,

    D. P. DiVincenzo, “Quantum gates and circuits,” quant- ph/9705009 (1997)

    work page arXiv 1997

  38. [38]

    Fault-tolerant quantum computation,

    P. Shor, “Fault-tolerant quantum computation,” quant -ph/9605011 (1996)

    work page arXiv 1996

  39. [39]

    Fault-tolerant error corre ction with efficient quantum codes,

    D. DiVincenzo and P. Shor, “Fault-tolerant error corre ction with efficient quantum codes,” Phys. Rev. Lett. 77, 3260 (1996)

    work page 1996

  40. [40]

    A theory of fault-tolerant quantum comp utation,

    D. Gottesman, “A theory of fault-tolerant quantum comp utation,” quant- ph/9702029 (1997)

    work page arXiv 1997

  41. [41]

    Teleporting an unknown quantum state via du al classical and Einstein-Podalsky-Rosen channels,

    C. H. Bennett, G. Brassard, C. Crepeau, R. Josza, A. Pere s, and W. K. Wootters, “Teleporting an unknown quantum state via du al classical and Einstein-Podalsky-Rosen channels,” Phys. Rev. Lett. 70, 1895 (1993)

    work page 1993

  42. [42]

    Purification of noisy entanglement and fait hful telepor- tation via noisy channels,

    C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J . A. Smolin, and W. K. Wootters, “Purification of noisy entanglement and fait hful telepor- tation via noisy channels,” Phys. Rev. Lett. 76, 722 (1996)

    work page 1996

  43. [43]

    Knill, R

    E. Knill, R. Laflamme, and D. Gottesman, in preparation

    work page

  44. [44]

    Knill, personal communication

    E. Knill, personal communication

    work page

  45. [45]

    Threshold Accuracy for Quantum Computation

    E. Knill, R. Laflamme, and W. Zurek, “Accuracy threshold for quan- tum computation,” quant-ph/9610011 (1996); E. Knill, R. La flamme, and W. Zurek, “Resilient quantum computation: error models and thresholds,” quant-ph/9702058 (1997)

    work page Pith review arXiv 1996

  46. [46]

    Evslin, S

    J. Evslin, S. Kakade, and J. P. Preskill, unpublished. BIBLIOGRAPHY 113

    work page

  47. [47]

    Active stabilization, quantum computat ion and quantum state synthesis,

    A. M. Steane, “Active stabilization, quantum computat ion and quantum state synthesis,” Phys. Rev. Lett. 78, 2252 (1997)

    work page 1997

  48. [48]

    Concatenated quantum codes,

    E. Knill and R. Laflamme, “Concatenated quantum codes,” quant-ph/ 9608012 (1996)

    work page 1996

  49. [49]

    Threshold Estimate for Fault Tolerant Quantum Computation

    C. Zalka, “Threshold estimate for fault tolerant quant um computing,” quant-ph/9612028 (1996)

    work page Pith review arXiv 1996

  50. [50]

    The capacity of a noisy quantum channel,

    S. Lloyd, “The capacity of a noisy quantum channel,” Phy s. Rev. A 55, 1613 (1997)

    work page 1997

  51. [51]

    Quantum data processi ng and error correction,

    B. Schumacher and M. A. Nielsen, “Quantum data processi ng and error correction,” Phys. Rev. A 54, 2629 (1996)

    work page 1996

  52. [52]

    Informati on transmission through a noisy quantum channel,

    H. Barnum, M. A. Nielsen, and B. Schumacher, “Informati on transmission through a noisy quantum channel,” quant-ph/9702049 (1997)

    work page arXiv 1997

  53. [53]

    Error correction in quan tum communica- tion,

    A. Ekert and C. Macchiavello, “Error correction in quan tum communica- tion,” Phys. Rev. Lett. 77, 2585 (1996)

    work page 1996

  54. [54]

    Information-theoretic interp retation of quantum error-correcting codes,

    N. J. Cerf and R. Cleve, “Information-theoretic interp retation of quantum error-correcting codes,” quant-ph/9702031 (1997)

    work page arXiv 1997

  55. [55]

    Quantum analog of the MacWillia ms identities for classical coding theory,

    P. Shor and R. Laflamme, “Quantum analog of the MacWillia ms identities for classical coding theory,” Phys. Rev. Lett. 78, 1600 (1997)

    work page 1997

  56. [56]

    Quantum weight enumerators,

    E. M. Rains, “Quantum weight enumerators,” quant-ph/9 612015 (1996)

    work page 1996

  57. [57]

    Polynomial invariants of quantum codes,

    E. M. Rains, “Polynomial invariants of quantum codes,” quant-ph/9704042 (1997)

    work page arXiv 1997

  58. [58]

    Quantum stabilizer codes and classical line ar vodes,

    R. Cleve, “Quantum stabilizer codes and classical line ar vodes,” quant- ph/9612048 (1996)

    work page arXiv 1996

  59. [59]

    Capac ities of quantum erasure channels,

    C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, “Capac ities of quantum erasure channels,” quant-ph/9701015 (1997)

    work page arXiv 1997

  60. [60]

    Fuchs and J

    C. Fuchs and J. Smolin, unpublished

    work page

  61. [61]

    Quantum error-correcting codes need not com- pletely reveal the error syndrome,

    P. Shor and J. Smolin, “Quantum error-correcting codes need not com- pletely reveal the error syndrome,” quant-ph/9604006 (199 6)

    work page arXiv

  62. [62]

    Quantum codes of minimum distance two,

    E. M. Rains, “Quantum codes of minimum distance two,” qu ant-ph/ 9704043 (1997)

    work page 1997

  63. [63]

    A nonadditive quantum code,

    E. M. Rains, R. H. Hardin, P. W. Shor, and N. J. A. Sloane, “ A nonadditive quantum code,” quant-ph/9703002 (1997)

    work page arXiv 1997

  64. [64]

    Almost any quantum logic gate is universal,

    S. Lloyd, “Almost any quantum logic gate is universal,” Phys. Rev. Lett. 75, 346 (1995). BIBLIOGRAPHY 114

    work page 1995

  65. [65]

    Elementa ry gates for quantum computation,

    A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, “Elementa ry gates for quantum computation,” Phys. Rev. A 52, 3457 (1995)

    work page 1995