Quantum interactive proofs with short messages

Details Quantum interactive proofs with short messages Quantum interactive proofs with short messages

2010-04-03

arxiv.org/abs/1004.0411v2

Theory of Computing 7, 101-117 (2011)

Physics

Quantum Physics

15 pages, published version

Scientific paper

This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The first variant is one in which the verifier sends a short message to the prover, and the prover responds with an ordinary, or polynomial-length, message; the second variant is one in which any number of messages can be exchanged, but where the combined length of all the messages is logarithmic; and the third variant is one in which the verifier sends polynomially many random bits to the prover, who responds with a short quantum message. We prove that in all of these cases the short messages can be eliminated without changing the power of the model, so the first variant has the expressive power of QMA and the second and third variants have the expressive power of BQP. These facts are proved through the use of quantum state tomography, along with the finite quantum de Finetti theorem for the first variant.

Affiliated with

Also associated with

No associations

Rating

Quantum interactive proofs with short messages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum interactive proofs with short messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum interactive proofs with short messages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-198511