Complexity limitations on quantum computation

Details Complexity limitations on quantum computation Complexity limitations on quantum computation

1998-11-12

arxiv.org/abs/cs/9811023v1

Computer Science

Computational Complexity

13 pages, no figures; presented at the 13th annual Conference on Computational Complexity (1998); submitted to the Journal of

Scientific paper

We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e., PP^BQP=PP. 2. There exists a relativized world where P=BQP and the polynomial-time hierarchy is infinite. 3. There exists a relativized world where BQP does not have complete sets. 4. There exists a relativized world where P=BQP but P is not equal to UP intersect coUP and one-way functions exist. This gives a relativized answer to an open question of Simon.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-691633