Non UBC
DSpace
Tal, Avishay
2019-03-28T10:36:09Z
2018-08-16T15:05
We present an oracle, A, relative to which BQP^A is not contained in PH^A.
Following the approach of Aaronson [STOC, 2010], our oracle separation is obtained by finding a distribution D over Boolean strings of length N such that:
(1) There exists a quantum algorithm that runs in time polylog(N) and distinguishes between D and the uniform distribution over Boolean strings of length N.
(2) No AC0 circuit of quasi-polynomial size can distinguish between D and the uniform distribution with advantage better than
polylog(N)/sqrt(N).
Based on joint work with Ran Raz.
https://circle.library.ubc.ca/rest/handle/2429/69321?expand=metadata
54.0
video/mp4
Author affiliation: Stanford University
Oaxaca (Mexico : State)
10.14288/1.0377637
eng
Unreviewed
Vancouver : University of British Columbia Library
Banff International Research Station for Mathematical Innovation and Discovery
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
Postdoctoral
BIRS Workshop Lecture Videos (Oaxaca (Mexico : State))
Mathematics
Computer science
Fourier analysis
Theoretical computer science
Oracle Separation of BQP and the Polynomial Hierarchy
Moving Image
http://hdl.handle.net/2429/69321