Corpus ID: 1206549

QMA variants with polynomially many provers

@article{Gharibian2013QMAVW,
  title={QMA variants with polynomially many provers},
  author={Sevag Gharibian and Jamie Sikora and Sarvagya Upadhyay},
  journal={Quantum Inf. Comput.},
  year={2013},
  volume={13},
  pages={135-157}
}
  • Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay
  • Published 2013
  • Mathematics, Computer Science, Physics
  • Quantum Inf. Comput.
  • 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
    18 Citations
    Multi-Prover Quantum Merlin-Arthur Proof Systems with Small Gap
    • 14
    • PDF
    Stronger methods of making quantum interactive proofs perfectly complete
    • 10
    • PDF
    Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
    • 68
    • PDF

    References

    SHOWING 1-10 OF 66 REFERENCES
    Quantum versus Classical Proofs and Advice
    • S. Aaronson, G. Kuperberg
    • Mathematics, Computer Science
    • Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
    • 2007
    • 48
    • PDF
    The Power of Unentanglement
    • 62
    • Highly Influential
    • PDF
    Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements
    • 29
    • Highly Influential
    • PDF
    Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
    • 189
    • PDF
    Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
    • 70
    • PDF
    An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games
    • A. Harrow, A. Montanaro
    • Computer Science, Mathematics
    • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
    • 2010
    • 34
    • Highly Influential
    • PDF
    Limits on the power of quantum statistical zero-knowledge
    • J. Watrous
    • Mathematics, Computer Science
    • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
    • 2002
    • 77
    • PDF
    QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols
    • S. Aaronson
    • Mathematics, Computer Science
    • Electron. Colloquium Comput. Complex.
    • 2005
    • 20
    • PDF
    All Languages in NP Have Very Short Quantum Proofs
    • Hugue Blier, A. Tapp
    • Mathematics, Computer Science
    • 2009 Third International Conference on Quantum, Nano and Micro Technologies
    • 2009
    • 52
    QMA/qpoly /spl sube/ PSPACE/poly: de-Merlinizing quantum protocols
    • S. Aaronson
    • Mathematics, Computer Science
    • 21st Annual IEEE Conference on Computational Complexity (CCC'06)
    • 2006
    • 15