Quantum circuits for OR and AND of OR's

H Barnum, Bernstein H. J., Spector L.

Research output: Working paperWorking paper and Preprints

Abstract

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 contributionQuantum circuits for OR and AND of OR's
Original languageEnglish
PublisherDepartment of Computer Science, University of Bristol
Publication statusPublished - 2000

Bibliographical note

Other page information: -14
Other identifier: 1000497

Fingerprint Dive into the research topics of 'Quantum circuits for OR and AND of OR's'. Together they form a unique fingerprint.

Cite this