Recognition: unknown
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 7 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.
-
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...
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.