Quantum circuits for OR and AND of OR's

H Barnum; Bernstein H. J.; Spector L.

Quantum circuits for OR and AND of OR's

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

Research output: Working paper

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 contribution	Quantum circuits for OR and AND of OR's
Original language	English
Publisher	Department of Computer Science, University of Bristol
Publication status	Published - 2000

Bibliographical note

Other page information: -14
Other identifier: 1000497

Access to Document

http://www.cs.bris.ac.uk/Publications/pub_master.jsp?id=1000497

Handle.net

Persistent link

Cite this

@techreport{7ad34a1d454f41ba873f1489385879ad,

title = "Quantum circuits for OR and AND of OR's",

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) \textbackslash{}oplus f(1)\$) to give the full set of logical connectives (up to relabeling of inputs and outputs) for which there is quantum speedup. ",

author = "H Barnum and \{H. J.\}, Bernstein and Spector L.",

note = "Other page information: -14 Other identifier: 1000497",

year = "2000",

language = "English",

publisher = "Department of Computer Science, University of Bristol",

type = "WorkingPaper",

institution = "Department of Computer Science, University of Bristol",

}

TY - UNPB

T1 - Quantum circuits for OR and AND of OR's

AU - Barnum, H

AU - H. J., Bernstein

AU - L., Spector

N1 - Other page information: -14 Other identifier: 1000497

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

M3 - Working paper

BT - Quantum circuits for OR and AND of OR's

PB - Department of Computer Science, University of Bristol

ER -

Quantum circuits for OR and AND of OR's

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this