Quantum Non-Local Games and What They Prove
Non-local games such as CHSH and the magic square game show that entangled players can beat classical ones. What they prove and how they are used.
Entropy, channel capacity, teleportation, complexity classes and the theorems that define what quantum information can and cannot do.
155 articlesNon-local games such as CHSH and the magic square game show that entangled players can beat classical ones. What they prove and how they are used.
Quantum channels describe how noise acts on quantum states. Types of channels, error correction, capacity, teleportation and simulation.
Quantum inapproximability studies problems that quantum computers cannot even approximate efficiently, and its links to the quantum PCP conjecture.
The complexity classes that matter for quantum computing, including BQP and QMA, the oracle model, and what is known about their power.
Measurement-based quantum computing performs computation through measurements on an entangled cluster state. How it compares with gate models.
Gleason’s theorem shows that the Born rule is the only consistent way to assign probabilities to quantum measurements. Its statement and impact.
The Kochen-Specker theorem shows that quantum outcomes cannot all be fixed in advance independent of context. Proofs, experiments and meaning.
Bell’s theorem shows that no local hidden-variable theory can match quantum predictions. The inequality, the experiments and what they settled.
Methods and bounds for distinguishing quantum states, why non-orthogonal states cannot be told apart perfectly, and uses in quantum technology.
How quantum states are estimated from limited measurements: tomography, maximum likelihood, Bayesian inference and adaptive methods.
Quantum tomography reconstructs states, processes and detectors from measurements. Density matrices, methods and uses in device characterization.
Quantum process calculi describe concurrent quantum programs and protocols formally. Key concepts, behavioral analysis and applications.