paper

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)