REVIEW 25 cited by
An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
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
An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
read the original abstract
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements. To build a quantum computer which behaves correctly in the presence of errors, we also need a theory of fault-tolerant quantum computation, instructing us how to perform quantum gates on qubits which are encoded in a quantum error-correcting code. The threshold theorem states that it is possible to create a quantum computer to perform an arbitrary quantum computation provided the error rate per physical gate or time step is below some constant threshold value.
Forward citations
Cited by 25 Pith papers
-
Gauss law codes and vacuum codes from lattice gauge theories
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.
-
Characterizing and Benchmarking Dynamic Quantum Circuits
Dynamarq is a new scalable benchmarking framework that defines structural features for dynamic quantum circuits and uses statistical models to predict hardware fidelity with transferable parameters.
-
Scalable Spin Qubit Architecture with Donor-Cluster Arrays in Silicon
A donor-cluster array architecture in silicon uses shared electrons and natural hyperfine distributions for individual spin addressability, tunable inter-cluster exchange, and high-fidelity gates to enable scalable qu...
-
Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\mathbb Z_2$ Lattice Gauge Theory
Gauss's law constraints in Z2 lattice gauge theory can be made into quantum error-correcting codes of arbitrary distance, with provably optimal encoding rate within the constructed family.
-
OmniQEC: discovering practical quantum error-correcting codes by an AI scientist
OmniQEC discovers qLDPC codes whose simulated circuit-level logical error rates beat the BB [[72,12,6]] and [[144,12,12]] baselines at 98- and 240-qubit budgets.
-
Bit flips are erasures in dissipative cat qubits
Bit flips in dissipative cat qubits are accompanied by time-localized photon bursts that enable their detection as erasures via photon counting or homodyne monitoring.
-
Homomorphic Quantum Error Correction
Establishes necessary and sufficient criterion for [[n,1,d]] stabilizer codes to preserve code space under restricted transversal block-Pauli masking U_enc(a,b)=(X^a Z^b)^⊗n for homomorphic quantum error correction.
-
Rethink the Role of Neural Decoders in Quantum Error Correction
Neural decoders for surface-code QEC achieve practical microsecond FPGA latency when trained on large datasets with appropriate inductive biases and INT4 quantization, rather than relying on architectural complexity.
-
A graph-aware bounded distance decoder for all stabilizer codes
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.
-
Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction
SS-τ and AST scheduling policies for seam checks in distributed triangular color codes reduce remote-operation overhead and achieve lower logical error rates with fault-tolerant scaling in specific EGR regimes under c...
-
Optimized Compilation of Logical Clifford Circuits
For C-QSK circuits on [[n,n-2,2]] codes, a piecewise selection of three closed-form compilation strategies beats solve-and-stitch for sparse and dense Hadamard placements.
-
Syndrome aware mitigation of logical errors
Conditioning logical error mitigation on the measured error-correcting syndromes cuts sampling overhead exponentially and can make error correction useful above its standard pseudo-threshold.
-
A Quantum Algorithm with Polylogarithmic Depth per Trotter Step for the Extended Hubbard Model
Q2FMM approximates the 1/r interaction of the Hubbard model with hierarchical box-box interactions and evaluates the phases with quantum arithmetic, achieving polylogarithmic Trotter-step depth on hardware with shuttling.
-
Mixed-State Phase Transitions in Measurement-Dressed Imaginary-Time Evolution
Alternating imaginary-time evolution with projective measurements drives stationary mixed states of 1D Ising and 2D Heisenberg models through phase transitions with apparently new critical exponents.
-
Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes
A local O(n) post-processor called degeneracy cutting prunes one low-probability qubit per stabilizer and reruns belief propagation, matching or beating BP+OSD accuracy in several qLDPC settings.
-
Scalable accuracy gains from postselection in quantum error correcting codes
Postselection on typical syndromes in the toric code suppresses logical error rates from p_f to p_f^b with b approximately 3.1 via large-deviation arguments.
-
Cross-Resonant Gates in Hybrid Fluxonium-Transmon Systems
A simulation study shows that cross-resonance CNOT gates between fluxoniums and a central transmon support high-fidelity parity checks and logical gates in a scalable dual-species architecture.
-
Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
Benchmarks gradient-ascent algorithms for constrained free energy minimization on quantum Heisenberg models and stabilizer codes, with applications to thermal state design and fixed-temperature quantum encoding.
-
Systematic Approach to Hyperbolic Quantum Error Correction Codes
A Hyperbolic Cycle Basis algorithm is introduced within a unified framework for constructing and benchmarking CSS quantum error correction codes on hyperbolic lattices, with performance metrics evaluated on two example codes.
-
Geometrical constructions of purity testing protocols and their applications to quantum communication
Geometrical constructions map classical linear error correcting codes to purity testing protocols whose properties are fully determined by the codes, enabling applications in quantum communication.
-
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.
-
Fraxonium: Fractional fluxon states for qudit encoding
Superconducting circuit hosts fractional fluxon states (fraxons) in a tailored Josephson potential to realize protected qudits with a STIRAP gate protocol.
-
Graph-State Circuit Blocks control Entanglement and Scrambling Velocities
LC-inequivalent graph-state blocks in random Clifford circuits yield distinct entanglement velocities v_E and butterfly velocities v_B, correlated with internal entanglement distribution and graph connectivity.
-
Information-Theoretic Analysis of Weak Measurements and Their Reversal
Null-result weak measurements are dynamically characterized for qubits and qutrits using Shannon entropy, mutual information, fidelity, and relative entropy to quantify information extraction amounts, rates, and rever...
-
A Resource Comparison of Logical T-State Preparation
Compares resource costs of logical T-state preparation via distillation, cultivation, and code switching using native metrics from existing literature plus a Shor factoring case study.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.