Quantum State Tomography
In classical physics, if you know an object’s position and velocity, you can describe its state completely. But in quantum mechanics, things are more subtle. A quantum state holds all….
Tag: quantum verification
Complexity of Quantum Sampling Problems
At a high level, quantum sampling problems ask: Can a quantum computer efficiently sample from a probability distribution that is hard (or impossible) for a classical computer to sample from?….
Quantum PCP Theorem
Before we can understand the Quantum PCP Theorem, we need to review the classical PCP (Probabilistically Checkable Proofs) Theorem. The PCP Theorem (a cornerstone of theoretical computer science) says: Any….
QCMA (Quantum Classical Merlin-Arthur)
QCMA stands for Quantum Classical Merlin-Arthur. It’s a quantum complexity class that captures problems where: Think of it as the quantum cousin of NP (nondeterministic polynomial time), except that verification….
QMA (Quantum Merlin-Arthur)
QMA stands for Quantum Merlin-Arthur. It is a quantum complexity class, and it’s the quantum counterpart to the classical complexity class NP (specifically, to MA, which stands for Merlin-Arthur in….