Quantum Fountain Codes for Lossy Quantum Channels
Quantum fountain codes adapt rateless erasure codes to channels that lose qubits. Their features, applications and development prospects.
Every explainer on QuantumExplainer.com, newest first. Use the pillars above to jump straight to a topic.
739 articlesQuantum fountain codes adapt rateless erasure codes to channels that lose qubits. Their features, applications and development prospects.
Quantum checksum codes detect errors without correcting them, the way classical checksums do. How they work and how they compare with classical ones.
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.
Homological product codes use algebraic topology to build quantum codes. Their principles, encoding and decoding, and role in error correction.
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 codes built from finite geometries such as projective spaces. Incidence structures, encoding, error correction and applications.
Quantum polar codes use channel polarization to achieve the capacity of some quantum channels. How they are built and what limits them.
Quantum turbo product codes combine product constructions with iterative decoding. Their structure, advantages, applications and open questions.
Quantum Reed-Solomon codes adapt classical Reed-Solomon codes to qudits. Their structure, correction capability and implementation challenges.