A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Oracle Separation of BQP and PH
2022
Journal of the ACM
We present a distribution \({\mathcal {D}} \) over inputs in { ± 1} 2 N , such that: (1) There exists a quantum algorithm that makes one (quantum) query to the input, and runs in time O (log N ), that distinguishes between \({\mathcal {D}} \) and the uniform distribution with advantage \(\Omega(1/\log N)\) . (2) No Boolean circuit of quasi-polynomial size and constant depth distinguishes between \({\mathcal {D}} \) and the uniform distribution with advantage better than
doi:10.1145/3530258
fatcat:s5e7xuaplrh5zj4p3fxwsholgu