Fault-Tolerant Quantum Computing: The Threshold
Fault-tolerant quantum computing and the threshold theorem: how codes, syndrome measurement and careful circuits keep errors from spreading.
Fault-tolerant quantum computing and the threshold theorem: how codes, syndrome measurement and careful circuits keep errors from spreading.
Subsystem surface codes replace some stabilizer measurements with simpler gauge measurements on a lattice. Benefits and implementation challenges.
The rotated surface code achieves the same distance as the standard surface code with about half the qubits. Layout, features and experiments.
Hypergraph product codes combine two classical codes into a quantum LDPC code. How the product works and why it matters for error correction.
Quantum MDS codes meet the quantum Singleton bound. How Reed-Solomon constructions yield them, their properties and their encoding.
Quantum Reed-Solomon codes adapt classical Reed-Solomon codes to qudits. Their structure, correction capability and implementation challenges.
Non-abelian anyons change a state when braided, which could give fault-tolerant gates. Codes built on them and experimental progress.
Quantum double codes generalize the toric code to any finite group and host richer anyon models. Their construction and error correction.
Quantum product codes combine smaller codes into larger ones. Their structure, encoding, decoding, performance and place among other codes.
The Gottesman-Knill theorem shows that Clifford circuits can be simulated efficiently on classical computers, and why stabilizer codes rely on it.
Subsystem stabilizer codes add gauge qubits that do not store data, which simplifies measurements. Their structure and uses in fault tolerance.
Bosonic codes store a qubit in an oscillator, as in cat, binomial and GKP codes. How they correct photon loss and why they save hardware.