Quantum Computational Complexity

Details Quantum Computational Complexity Quantum Computational Complexity

2008-04-21

arxiv.org/abs/0804.3401v1

Physics

Quantum Physics

44 pages, 14 figures. To appear in the Springer Encyclopedia of Complexity and Systems Science

Scientific paper

This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of quantum complexity classes based on these notions, such as BQP, QMA, and QIP, are presented. Other topics in quantum complexity, including quantum advice, space-bounded quantum computation, and bounded-depth quantum circuits, are also discussed.

Affiliated with

Also associated with

No associations

Rating

Quantum Computational Complexity 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 Computational Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Computational Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674389