QMA variants with polynomially many provers

@article{Gharibian2011QMAVW,
  title={QMA variants with polynomially many provers},
  author={Sevag Gharibian and Jamie Sikora and Sarvagya Upadhyay},
  journal={Quantum Information & Computation},
  year={2011},
  volume={13},
  pages={135-157}
}
We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size, is exactly MQA (also known as QCMA), the class of problems which can be efficiently verified via a classical proof and a quantum verifier. We then study the class BellQMA(poly), characterized by a verifier who first applies unentangled, nonadaptive measurements to each of the… CONTINUE READING
1
Twitter Mention