A Comparison of Quantum Oracles
arXiv:quant-ph/0109104 · doi:10.1103/PhysRevA.65.050304
Abstract
A standard quantum oracle for a general function is defined to act on two input states and return two outputs, with inputs and () returning outputs and . However, if is known to be a one-to-one function, a simpler oracle, , which returns given , can also be defined. We consider the relative strengths of these oracles. We define a simple promise problem which minimal quantum oracles can solve exponentially faster than classical oracles, via an algorithm which cannot be naively adapted to standard quantum oracles. We show that can be constructed by invoking and once each, while invocations of and/or are required to construct .
4 pages, 1 figure; Final version, with an extended discussion of oracle inverses. To appear in Phys Rev A
References in corpus (1)
Cited by in corpus (16)
- Quantum walks: a comprehensive review
- Exploiting entanglement in communication channels with correlated noise
- Quantum boolean functions
- Nonlinear Quantum Neuron: A Fundamental Building Block for Quantum Neural Networks
- Semantic Security and Indistinguishability in the Quantum World
- Unambiguous discrimination among oracle operators
- Strategy for quantum algorithm design assisted by machine learning
- Limits on Efficient Computation in the Physical World
- A genetic-algorithm-based method to find the unitary transformations for any de- sired quantum computation and application to a one-bit oracle decision problem
- Framework for learning agents in quantum environments
- Comparison of mixed quantum states
- Optimal and asymptotically optimal NCT reversible circuits by the gate types
- Distributed implementation of standard oracle operators
- Comparative Computational Strength of Quantum Oracles
- Modular quantum computing and quantum-like devices
- Quantum Indistinguishability for Public Key Encryption