On quantum interactive proofs with short messages

Details On quantum interactive proofs with short messages On quantum interactive proofs with short messages

2011-09-05

arxiv.org/abs/1109.0964v1

Computer Science

Computational Complexity

9 pages, 3 figures

Scientific paper

This paper proves one of the open problem posed by Beigi et al. in arXiv:1004.0411v2. We consider quantum interactive proof systems where in the beginning the verifier and prover send messages to each other with the combined length of all messages being at most logarithmic (in the input length); and at the end the prover sends a polynomial-length message to the verifier. We show that this class has the same expressive power as QMA.

Affiliated with

Also associated with

No associations

Rating

On 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 On quantum interactive proofs with short messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On quantum interactive proofs with short messages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-451022