BQP and the Polynomial Hierarchy

Details BQP and the Polynomial Hierarchy BQP and the Polynomial Hierarchy

2009-10-25

arxiv.org/abs/0910.4698v1

Physics

Quantum Physics

Scientific paper

The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside the entire polynomial hierarchy, by relating this question to topics in circuit complexity, pseudorandomness, and Fourier analysis. First, we show that there exists an oracle relation problem (i.e., a problem with many valid outputs) that is solvable in BQP, but not in PH. This also yields a non-oracle relation problem that is solvable in quantum logarithmic time, but not in AC0. Second, we show that an oracle decision problem separating BQP from PH would follow from the Generalized Linial-Nisan Conjecture, which we formulate here and which is likely of independent interest. The original Linial-Nisan Conjecture (about pseudorandomness against constant-depth circuits) was recently proved by Braverman, after being open for twenty years.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450076