MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  k

Download:
Download as a PDF | Download as a PS
by Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. Divincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John Smolin, Harald Weinfurter
ftp://eve.physics.ox.ac.uk/Archive/Numbered/BBCDMSSW95/paper.ps
Add To MetaCart

Abstract:

We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x; y) to (x; x \Phi y)) is universal in the sense that all unitary operations on arbitrarily many bits n

Citations

449 Algorithms for quantum computation: discrete logarithms and factoring – Shor - 1994
363 Quantum theory, the Church-Turing principle and the universal quantum computer – Deutsch - 1985
289 Quantum complexity theory – Bernstein, Vazirani - 1997
242 On the power of quantum computation – Simon - 1997
204 Rapid solution of problems by quantum computation – Deutsch, Jozsa - 1992
191 Quantum circuit complexity – Yao - 1993
164 Irreversibility and heat generation in the computing process – Landauer - 1961
148 Conservative Logic – Fredkin, Toffoli - 1982
137 Quantum computational networks – Deutsch - 1989
124 The Principles of Quantum Mechanics – Dirac - 1958
108 Quantum computation – Berthiaume - 1994
88 Two-bit gates are universal for quantum computation – DiVincenzo - 1995
72 Reversible computing – Toffoli - 1980
57 An approximate Fourier transform useful in quantum factoring – Coppersmith - 1994
51 A Potentially Realizable Quantum Computer – Lloyd - 1993
50 Quantum mechanical Hamiltonian models of Turing machines – Benioff - 1982
40 A New Proof of the Quantum Noiseless Coding Theorem – Jozsa, Schumacher - 1994
40 Is quantum mechanics useful – Landauer - 1995
36 Universality in quantum computation – Deutsch, Barenco, et al. - 1995
35 Parallel quantum computation – Margolus - 1990
30 Computing algebraic formulas using a constant number of registers – Ben-Or, Cleve - 1992
28 A universal two-bit gate for quantum computation – Barenco - 1995
27 Experimental realization of any discrete unitary operator – Reck, Zeilinger, et al. - 1994
24 Generators for certain alternating groups with applications to cryptography – Coppersmith, Grossman - 1975
13 Quantum Mechanical Computers", Optics News – Feynman - 1985
13 Results on Two-bit gate design for quantum computers – DiVincenzo, Smolin - 1994
11 Maintaining coherence in quantum computers", Phys – Unruh - 1995
8 Reversible logic and quantum computers", Phys – Peres - 1985
8 Quantum Computers, Factoring and Decoherence", Report LA-UR-95-241 – Chuang, Laflamme, et al. - 1995
7 Quantum computations with cold trapped ions", preprint – Cirac, Zoller - 1994
6 For a review see A. Ekert and – Jozsa - 1995
6 Reversible Programs and Simple Product Ciphers" in Methodologies for Designing Block Ciphers and Cryptographic Protocols – Cleve - 1989
6 Almost any quantum logic gate is universal", preprint – Lloyd - 1994
5 Realizable universal quantum logic gates", preprint – Sleator, Weinfurter - 1994
5 Logic gates for quantum circuits", preprint – Barenco, Deutsch, et al. - 1994
5 A simple quantum computer", submitted to Phys. Rev. A – Chuang, Yamamoto - 1994
5 On Quantum Coding," Phys. Rev. A – Schumacher - 1995
1 Chau amd F. Wilczek, "Realization of the Fredkin gate using a series of oneand two-body operators", Report IASSNS-HEP-95/15 – F - 1995