REVIEW 13 cited by
Good Quantum Error-Correcting Codes Exist
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
Signed reviews
read the original abstract
A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used to faithfully reconstruct the original quantum state of the k encoded qubits. Quantum error-correcting codes are shown to exist with asymptotic rate k/n = 1 - 2H(2t/n) where H(p) is the binary entropy function -p log p - (1-p) log (1-p). Upper bounds on this asymptotic rate are given.
Forward citations
Cited by 13 Pith papers
-
Local Equivalences of Graph States
Graph states are LU-equivalent if and only if they are linked by r-local complementations for some integer r; LU-equivalence is decidable in quasi-polynomial time, and LU=LC holds on at most 19 qubits.
-
From Koszul-Complex Stabilizer Models to Superselection Profiles: Topological Rigidity and Nonsplit Extensions
For single-layer translation-invariant CSS codes, the nonzero superselection layer and its degree determine the stable translation-invariant Clifford class; multi-layer nonsplit extensions show individual layers do no...
-
Logical Spectroscopy: Lifted-Product Codes with Addressable Bases
Logical spectroscopy decomposes Abelian lifted-product codes into Frobenius packets, builds a complete addressable conjugate logical basis by finite-field algebra plus idempotent lifts, and supplies design diagnostics...
-
Improved belief propagation is sufficient for real-time decoding of quantum memory
Relay-BP, a message-passing decoder using disordered memory strengths and relay ensembling, matches or beats benchmark decoders for bivariate-bicycle and surface codes within a real-time iteration budget.
-
Lifting Lifted Product Codes
Group-extension lifts systematically enlarge any LP code, transfer logical gadgets via chain maps (often with less surgery overhead), improve some code parameters, and give candidate thermodynamic families with cohere...
-
A diagrammatic field theory of quantum error correction
Exact correctability of fusion-space codes is equivalent to fibrewise Knill–Laflamme conditions on syndrome-admissible footprint algebras, with a conditional Peierls threshold for growing families and explicit Ising e...
-
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.
-
Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes
A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.
-
Quantum Error Correction Codes for Truncated SU(2) Lattice Gauge Theories
Gauss's law constraints in jmax=1/2 SU(2) lattice gauge theory are converted into stabilizer codes that correct single-qubit errors using about 9N or 12N physical qubits per N plaquettes.
-
Improved Logical Error Rate via List Decoding of Quantum Polar Codes
List decoding of entanglement-free quantum polar codes yields logical error rates competitive with surface codes and LDPC codes of similar size, with class-probability approximation providing further improvement.
-
The limits of erasure-based postselection for quantum error mitigation
Postselection on erasure qubits fully mitigates erasure noise in QFT for erasure-check error rates below 3% and enables dual-rail systems to exceed noise floors unreachable by single-rail at kiloquop scale.
-
A small and interesting architecture for early fault-tolerant quantum computers
An early fault-tolerant quantum computer architecture that uses teleportation between the [[4,2,2]] and [[8,3,2]] color codes for a universal transversal gate set, plus a mirror-circuit benchmarking protocol.
-
The Quantum Internet (Technical Version)
The paper presents a broad vision of a future global quantum internet, with original conceptual proposals like QTCP and quantum sneakernet, while explicitly acknowledging that much of its content is review.
Discussion (0). Continue with ORCID to comment.