Non-Abelian Anyon Codes: Braiding as Computation
Non-abelian anyons change a state when braided, which could give fault-tolerant gates. Codes built on them and experimental progress.
BasicsAlgorithmsHardwareError CorrectionCryptographyMachine LearningInformation TheoryPhysics & SimulationApplicationsIndustry & Careers
All Articles
Every explainer on QuantumExplainer.com, newest first. Use the pillars above to jump straight to a topic.
739 articles
Quantum Double Codes and Their Anyon Models
Quantum double codes generalize the toric code to any finite group and host richer anyon models. Their construction and error correction.
Quantum LDPC Codes in Practice: Decoders and Layouts
How quantum LDPC codes are decoded and laid out in hardware, their performance compared with classical LDPC codes, and current research.
Quantum Product Codes: Building Big Codes From Small
Quantum product codes combine smaller codes into larger ones. Their structure, encoding, decoding, performance and place among other codes.
The Gottesman-Knill Theorem and Simulable Circuits
The Gottesman-Knill theorem shows that Clifford circuits can be simulated efficiently on classical computers, and why stabilizer codes rely on it.
Quantum Convolutional Codes for Streaming Qubits
Quantum convolutional codes protect a continuous stream of qubits. Their history, encoding and decoding, performance and comparison with block codes.
Subsystem Stabilizer Codes: Gauge Qubits Explained
Subsystem stabilizer codes add gauge qubits that do not store data, which simplifies measurements. Their structure and uses in fault tolerance.
Bosonic Codes: Error Correction in an Oscillator
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.
Quantum Repetition Codes: The Simplest Protection
Repetition codes copy a bit-flip or phase-flip state across several qubits. The simplest quantum code, its syndromes and its use in experiments.
Entanglement-Assisted Quantum Error-Correcting Codes
Entanglement-assisted codes use shared entangled pairs to build quantum codes from any classical linear code. How encoding and decoding work.
Quantum Turbo Codes: Iterative Decoding for Qubits
Quantum turbo codes adapt iterative turbo decoding to qubits. How they are built, how they compare with classical turbo codes, and their uses.
Quantum Polynomial Codes and Their Construction
Quantum polynomial codes encode qubits using polynomials over finite fields. Their math, error correction and role in fault-tolerant computing.