A quantum circuit for OR
| dc.creator | Barnum, Howard | |
| dc.creator | Bernstein, Herbert J. | |
| dc.creator | Spector, Lee | |
| dc.date | 1999-07-16 | |
| dc.date | 1999-10-08 | |
| dc.date.accessioned | 2026-07-07T06:16:48Z | |
| dc.date.available | 2026-07-07T06:16:48Z | |
| dc.description | We give the first quantum circuit 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. 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''. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9907056 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9907056 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/94185 | |
| dc.subject | Quantum Physics | |
| dc.title | A quantum circuit for OR | |
| dc.type | text |