QAM: Quantum Arthur-Merlin Protocols
Quantum Arthur-Merlin protocols let a verifier check a prover with public random coins. The QAM class, its relations and applications.
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
DQC1: Quantum Power From a Single Clean Qubit
DQC1 is the one clean qubit model: one pure qubit plus mixed qubits. What it can compute, such as trace estimation, and experiments on it.
QSZK: Quantum Statistical Zero Knowledge
QSZK is the class of quantum statistical zero-knowledge proofs. Its definition, relation to classical SZK and uses in cryptography.
QCMA: Classical Proofs, Quantum Verification
QCMA is like QMA but with a classical proof and a quantum verifier. Its origin, how it compares with QMA and what is known about the gap.
QIP: Quantum Interactive Proofs and QIP = PSPACE
QIP is the class of problems with quantum interactive proofs. Its definition, protocols and the 2010 result that QIP equals PSPACE.
QMA: Quantum Merlin-Arthur and Quantum NP
QMA is the quantum analogue of NP: a quantum verifier checks a quantum proof. Its definition, relation to NP and BQP, and complete problems.
BQP: The Complexity Class of Quantum Computers
BQP is the class of problems quantum computers solve in polynomial time with bounded error. How it relates to BPP, NP and quantum algorithms.
Quantum Robustness Codes: Surviving Correlated Noise
How error correction codes are adapted to correlated and non-standard noise, from error models and channels to implementation strategies.
Quantum Cryptographic Codes and Their Security
How quantum codes and key distribution secure communications, their advantages over classical cryptography, challenges and standards.
Quantum Stabilizer Code Families, Compared
The main families of stabilizer codes compared: history, properties, encoding, recovery, fault tolerance, applications and limitations.
Quantum Interleaved Codes Against Burst Errors
Interleaving spreads a burst of errors across many code blocks so each can correct it. How quantum interleaved codes work and when they help.
Quantum Cyclic Codes: Algebraic Structure for Qubits
Quantum cyclic codes inherit the algebraic structure of classical cyclic codes. How they are encoded and decoded and where they are used.