The Steane Code: A Seven-Qubit Error-Correcting Code
The Steane code encodes one logical qubit in seven physical qubits and corrects any single-qubit error. Its encoding, syndromes and uses.
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 Key Agreement: Sharing a Key Without Trust
Quantum key agreement lets every party contribute to a shared key. How it differs from QKD, its protocols and its resistance to eavesdropping.
Quantum Homomorphic Encryption: Computing on Secrets
Quantum homomorphic encryption allows computation on encrypted quantum data. How it works, its limits, and its possible role in cloud quantum computing.
Quantum Communication Complexity, Explained
Quantum communication complexity asks how many qubits parties must exchange to compute a function. Protocols, complexity classes and applications.
Quantum Random Number Generation: True Randomness
How quantum random number generators produce true randomness from photon measurements, and their uses in cryptography, gaming and research.
Quantum Algorithms for Optimization Problems
Quantum approaches to optimization compared: quantum annealing, quantum walks and Grover’s algorithm, and industries where they are being tested.
Quantum Games and Strategies: Game Theory, Quantised
Quantum game theory adds superposition and entanglement to strategic games. How quantum strategies change outcomes in games such as the prisoner’s dilemma.
Quantum Channel Capacity: How Much Can Get Through
Quantum channel capacity measures how much information a noisy quantum channel can carry. Classical, quantum, private and entanglement-assisted capacities.
Quantum State Discrimination: Telling States Apart
How to tell quantum states apart: minimum-error and unambiguous discrimination, the Helstrom bound, tomography and experimental implementations.
Quantum Bit Commitment and Why It Cannot Be Perfect
Quantum bit commitment lets one party commit to a bit without revealing it. Why the Mayers-Lo-Chau result shows it cannot be perfectly secure.
Quantum Algorithms for Matrix Operations
Quantum algorithms for matrix operations: inversion, singular value decomposition and linear systems, with their uses and important caveats.
Quantum Algorithms for Topological Data Analysis
How quantum algorithms compute persistent homology for topological data analysis, what speedups are claimed and what current hardware allows.