QMA variants with polynomially many provers

S. Gharibian, J. Sikora, S. Upadhyay, Quantum Information & Computation 13 (2013) 135–157.

Journal Article | Published | English
Gharibian, SevagLibreCat ; Sikora, Jamie; Upadhyay, Sarvagya
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 polynomially many proofs, followed by an arbitrary but efficient quantum verification circuit on the resulting measurement outcomes. We show that if the number of outcomes per nonadaptive measurement is a polynomially-bounded function, then the expressive power of the proof system is exactly QMA. Finally, we study a class equivalent to QMA(m), denoted SepQMA(m), where the verifier's measurement operator corresponding to outcome "accept" is a fully separable operator across the m quantum proofs. Using cone programming duality, we give an alternate proof of a result of Harrow and Montanaro [FOCS, pp. 633--642 (2010)] that shows a perfect parallel repetition theorem for SepQMA(m) for any m.
Publishing Year
Journal Title
Quantum Information & Computation

Cite this

Gharibian S, Sikora J, Upadhyay S. QMA variants with polynomially many provers. Quantum Information & Computation. 2013;13(1-2):135-157.
Gharibian, S., Sikora, J., & Upadhyay, S. (2013). QMA variants with polynomially many provers. Quantum Information & Computation, 13(1–2), 135–157.
@article{Gharibian_Sikora_Upadhyay_2013, title={QMA variants with polynomially many provers}, volume={13}, number={1–2}, journal={Quantum Information & Computation}, author={Gharibian, Sevag and Sikora, Jamie and Upadhyay, Sarvagya}, year={2013}, pages={135–157} }
Gharibian, Sevag, Jamie Sikora, and Sarvagya Upadhyay. “QMA Variants with Polynomially Many Provers.” Quantum Information & Computation 13, no. 1–2 (2013): 135–57.
S. Gharibian, J. Sikora, and S. Upadhyay, “QMA variants with polynomially many provers,” Quantum Information & Computation, vol. 13, no. 1–2, pp. 135–157, 2013.
Gharibian, Sevag, et al. “QMA Variants with Polynomially Many Provers.” Quantum Information & Computation, vol. 13, no. 1–2, 2013, pp. 135–57.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]

Link(s) to Main File(s)
Access Level
Restricted Closed Access


Marked Publications

Open Data LibreCat


arXiv 1108.0617

Search this title in

Google Scholar