2000 character limit reached
On quantum interactive proofs with short messages
Published 5 Sep 2011 in cs.CC and quant-ph | (1109.0964v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.