A quantum circuit for OR
arXiv:quant-ph/9907056
Abstract
We give the first quantum circuit for computing OR more reliably than is classically possible with a single evaluation of the function. OR therefore joins XOR (i.e. parity, ) to give the full set of logical connectives (up to relabeling of inputs and outputs) for which there is quantum speedup. The XOR algorithm is of fundamental importance in quantum computation; our OR algorithm (found with the aid of genetic programming), may represent a new quantum computational effect, also useful as a ``subroutine''.
4 pages + 2 postscript figures. Version 3 restores the figures to Version 2, which changed the title, abstract, introduction and concluding paragraph, order of material, and emphasis from Version 1. No change in technical content