NP has log-space verifiers with fixed-size public quantum registers

Details NP has log-space verifiers with fixed-size public quantum registers NP has log-space verifiers with fixed-size public quantum registers

2011-01-27

arxiv.org/abs/1101.5227v3

Computer Science

Computational Complexity

9 pages. A revised version

Scientific paper

In classical Arthur-Merlin games, the class of languages whose membership proofs can be verified by Arthur using logarithmic space (AM(log-space)) coincides with the class P \cite{Co89}. In this note, we show that if Arthur has a fixed-size quantum register (the size of the register does not depend on the length of the input) instead of another source of random bits, membership in any language in NP can be verified with any desired error bound.

Affiliated with

Also associated with

No associations

Rating

NP has log-space verifiers with fixed-size public quantum registers 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 NP has log-space verifiers with fixed-size public quantum registers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and NP has log-space verifiers with fixed-size public quantum registers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-544899