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?….
Tag: Quantum Complexity
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….