Quantum BCH Codes: Classical Codes, Quantised
Quantum BCH codes are built from classical BCH codes. Their history, how they encode quantum information and how decoding works.
Every explainer on QuantumExplainer.com, newest first. Use the pillars above to jump straight to a topic.
739 articlesQuantum BCH codes are built from classical BCH codes. Their history, how they encode quantum information and how decoding works.
The quantum Hamming bound limits how efficiently codes can correct errors. The five-qubit perfect code, quantum Hamming codes and their costs.
Majorana zero modes could store qubits non-locally and process them by braiding. The theory, error correction role and experimental status.
Kitaev’s contributions to topological error correction: the toric code, anyons and the idea of protecting qubits through topological order.
The toric code stores qubits in the topology of a lattice on a torus. Stabilizers, anyons, logical operators and why local errors do little harm.
CSS codes build a quantum code from two classical codes, one for bit flips and one for phase flips. The construction, examples and uses.
Stabilizer codes define protected qubit states as the joint +1 eigenstates of commuting Pauli operators. How they detect and correct errors.
Quantum Reed-Muller codes are built from classical polynomial codes and support useful transversal gates. Their construction, uses and limits.
Concatenated codes nest one error-correcting code inside another so error rates fall with each level. Design, fault tolerance and trade-offs.
Topological quantum codes store information in global properties of a lattice, following Kitaev’s work. Key concepts, implementations and challenges.
Quantum LDPC codes use sparse parity checks to protect qubits with less overhead than surface codes. Their principles, decoding and prospects.
The surface code stores logical qubits in a 2D lattice of physical qubits. Stabilizer measurements, error thresholds, scaling and recent experiments.