English

A quantum circuit for OR

Quantum Physics 2007-05-23 v3

Abstract

We give the first quantum circuit for computing f(0)f(0) OR f(1)f(1) more reliably than is classically possible with a single evaluation of the function. OR therefore joins XOR (i.e. parity, f(0)f(1)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. 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''.

Keywords

Cite

@article{arxiv.quant-ph/9907056,
  title  = {A quantum circuit for OR},
  author = {Howard Barnum and Herbert J. Bernstein and Lee Spector},
  journal= {arXiv preprint arXiv:quant-ph/9907056},
  year   = {2007}
}

Comments

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