On QMA protocols with two short quantum proofs

Authors:
François Le Gall;Shota Nakagawa;Harumichi Nishimura
Affiliations:
Graduate School of Information Science and Technology, The University of Tokyo, Japan;Graduate School of Science, Osaka Prefecture University, Japan;Graduate School of Science, Osaka Prefecture University, Japan
Venue:
Quantum Information & Computation
Year:
2012

Citing 8
Cited 2

Quantum computation and quantum information

Quantum computation and quantum information
Succinct quantum proofs for properties of finite groups

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Classical and Quantum Computation

Classical and Quantum Computation
The PCP theorem by gap amplification

Journal of the ACM (JACM)
Quantum Arthur---Merlin games

Computational Complexity
All Languages in NP Have Very Short Quantum Proofs

ICQNM '09 Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies
An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
NP VS QMAlog(2)

Quantum Information & Computation

Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization

Journal of the ACM (JACM)
QMA variants with polynomially many provers

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives a QMA (Quantum Merlin-Arthur) protocol for 3-SAT with two logarithmic-size quantum proofs (that are not entangled with each other) such that the gap between the completeness and the soundness is Ω(1/npolylog(n)). This improves the best completeness/soundness gaps known for NP-complete problems in this setting.