Uselessness for an Oracle model with internal randomness

  title={Uselessness for an Oracle model with internal randomness},
  author={A. Harrow and David J. Rosenbaum},
  journal={Quantum Inf. Comput.},
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… Expand
9 Citations

Topics from this paper

Paper Mentions

Blind Oracular Quantum Computation
  • PDF
Quantum vs Classical Proofs and Subset Verification
  • 7
  • PDF
Quantum Computation and Isomorphism Testing
  • 2
On Quantum Obfuscation
  • 24
  • PDF
Super-polynomial separations for quantum-enhanced reinforcement learning


On the uselessness of quantum queries
  • 11
  • Highly Influential
  • PDF
Single query learning from abelian and non-abelian Hamming distance oracles
  • 7
  • Highly Influential
  • PDF
Unbounded-Error Quantum Query Complexity
  • 12
  • PDF
Quantum lower bounds by polynomials
  • 319
  • PDF
Sharp Quantum vs. Classical Query Complexity Separations
  • 16
  • Highly Influential
  • PDF
On the power of quantum computation
  • Daniel R. Simon
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
  • 992
  • PDF
BQP and the polynomial hierarchy
  • 174
  • PDF
Quantum Cryptanalysis of Hash and Claw-Free Functions
  • 90
Limit on the Speed of Quantum Computation in Determining Parity
  • 152
  • PDF
Quantum Algorithm for the Collision Problem
  • 35
  • PDF