The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
BQP and the Polynomial Hierarchy
[article]
2009
arXiv
pre-print
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
arXiv:0910.4698v1
fatcat:vunu2qquqje2jmor6o4f4uoeju