Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Classical vs Quantum Random Oracles

Takashi Yamakawa, Mark Zhandry

Published Jan 1, 2021• 50 citations
Publisher
DOI
10.1007/978-3-030-77886-6_20

Related papers

A Note on Separating Classical and Quantum Random Oracles.

Takashi Yamakawa, Mark Zhandry

•Jan 1, 2020•3 citations

Security notions for the random oracle model in classical and quantum settings

Jeeun Lee, Seunghyun Lee, Kwangjo Kim

•Jan 25, 2018•1 citation

Random Oracles in a Quantum World

Dan Boneh, Özgür Dagdelen, Marc Fischlin +3 more

arXiv:1008.0931•Lecture notes in computer science•Jan 1, 2011•510 citations

Formations for the Quantum Random Oracle.

Aaram Yun

•Jan 1, 2021•0 citations

Uselessness for an Oracle model with internal randomness

Aram W. Harrow, David J. Rosenbaum

We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we show that such infinity-vs-one separations between classical and quantum query complexities can be constructed from much weaker separations. We also give conditions to determine when oracle problems -- either in the standard model, or in any of the generalizations we consider -- cannot be solved with success probability better than random guessing would achieve. In the oracle model with internal randomness where the goal is to gain any nonzero advantage over guessing, we prove (roughly speaking) that k quantum queries are equivalent in power to 2k classical queries, thus extending results of Meyer and Pommersheim.

arXiv:1111.1462•Quantum Information and Computation•May 1, 2014•9 citations

Quantum Speedups Require Structure or Depth

Guy Blanc, Jordan Docter, Carmen Strassle +1 more

One of the most basic conjectures in quantum complexity theory states that every $t$-query quantum algorithm can be simulated on most inputs by a $\mathrm{poly}(t)$-query classical algorithm. If true, this would provide broad justification for the need for structure in quantum speedups. We settle this conjecture for parallel quantum algorithms, showing that every $t$-query $d$-round quantum algorithm can be simulated on most inputs with $t^{O(d^2)}$ classical queries. This suggests that for unstructured problems, superpolynomial speedups would require quantum circuits of superconstant depth, and exponential speedups would further require polynomial depth. In contrast, most known speedups for structured problems are achieved by highly parallel, low-depth algorithms. Our techniques also carry new implications for the status of $\mathsf{BPP}$ vs. $\mathsf{BQP}$ relative to a random oracle, a similarly longstanding problem.

quant-pharXiv:2608.19158•Aug 20, 2026•2 citations
We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we show that such infinity-vs-one separations between classical and quantum query complexities can be constructed from much weaker separations. We also give conditions to determine when oracle problems -- either in the standard model, or in any of the generalizations we consider -- cannot be solved with success probability better than random guessing would achieve. In the oracle model with internal randomness where the goal is to gain any nonzero advantage over guessing, we prove (roughly speaking) that k quantum queries are equivalent in power to 2k classical queries, thus extending results of Meyer and Pommersheim.
One of the most basic conjectures in quantum complexity theory states that every ttt-query quantum algorithm can be simulated on most inputs by a poly(t)\mathrm{poly}(t)poly(t)-query classical algorithm. If true, this would provide broad justification for the need for structure in quantum speedups. We settle this conjecture for parallel quantum algorithms, showing that every ttt-query ddd-round quantum algorithm can be simulated on most inputs with tO(d2)t^{O(d^2)}tO(d2) classical queries. This suggests that for unstructured problems, superpolynomial speedups would require quantum circuits of superconstant depth, and exponential speedups would further require polynomial depth. In contrast, most known speedups for structured problems are achieved by highly parallel, low-depth algorithms. Our techniques also carry new implications for the status of BPP\mathsf{BPP}BPP vs. BQP\mathsf{BQP}BQP relative to a random oracle, a similarly longstanding problem.