We give the first quantum circuit, derived with the aid of genetic programming, for computing $f(0)$ OR $f(1)$ more reliably than is classically possible with a single evaluation of the function. OR therefore joins XOR (i.e. parity, $f(0) \oplus f(1)$) to give the full set of logical connectives (up to relabeling of inputs and outputs) for which there is quantum speedup.
|Translated title of the contribution||Quantum circuits for OR and AND of OR's|
|Publisher||Department of Computer Science, University of Bristol|
|Publication status||Published - 2000|
Bibliographical noteOther page information: -14
Other identifier: 1000497