The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation.
Quantum error correction via codes over GF(4)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2roles
background 1polarities
background 1representative citing papers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
citing papers explorer
-
Stabilizer Codes and Quantum Error Correction
The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.