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….
Tag: Local Hamiltonian Problem
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….