Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements

BellQMA protocols are a subclass of multi-prover quantum Merlin-Arthur protocols in which the verifier is restricted to perform nonadaptive,unentangled measurements on the quantum states received from each Merlin. In this paper, we prove that m-clause 3-SAT instances have BellQMA proofs of satisfiability with constant soundness gap, in which O(sqrt(m)polylog(m)) Merlins each send O(log m) qubits to Arthur. Our result answers a question of Aaronson et al., who gave a protocol with similar parameters that used entangled measurements; the analysis of our protocol is significantly simpler than that of Aaronson et al. Our result also complements recent work of Brandao, Christandl, and Yard, who showed upper bounds on the power of multiprover quantum proofs with unentangled but adaptive (LOCC) measurements.

[1]  Keiji Matsumoto,et al.  Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? , 2009, Chic. J. Theor. Comput. Sci..

[2]  Bill Fefferman,et al.  The Power of Unentanglement , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[3]  A. Harrow,et al.  Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization , 2010, JACM.

[4]  W. Marsden.  I and J , 2012 .

[5]  Charles H. Bennett,et al.  Concentrating partial entanglement by local operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[6]  Fernando G.S.L. Brandao,et al.  Entanglement Theory and the Quantum Simulation of Many-Body Physics , 2008, 0810.0026.

[7]  Ashley Montanaro,et al.  An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[8]  M. Nielsen.  Conditions for a Class of Entanglement Transformations , 1998, quant-ph/9811053.

[9]  Alain Tapp,et al.  All Languages in NP Have Very Short Quantum Proofs , 2007, 2009 Third International Conference on Quantum, Nano and Micro Technologies.

[10]  R. Cleve,et al.  Quantum fingerprinting. , 2001, Physical review letters.

[11]  Bill Fefferman,et al.  The Power of Unentanglement , 2008, Computational Complexity Conference.

[12]  Salman Beigi,et al.  NP vs QMA_log(2) , 2008, Quantum Inf. Comput..

[13]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[14]  F. Brandão,et al.  Faithful Squashed Entanglement , 2010, 1010.1750.

[15]  Alain Tapp,et al.  A Quantum Characterization Of NP , 2007, computational complexity.

[16]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[17]  Aram W. Harrow,et al.  An efficient test for product states , 2010 .