Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. Di Vincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John Smolin, Harald Weinfurter  Home/Search
Context Related
| att.com/~shor/papers/QCgates.ps nec.com/homepages/wds/elemgates.ps cpsc.ucalgary.ca/~cleve...elem_gates.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: att.com/~shor/papers/ (more) From: cpsc.ucalgary.ca/~...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 (U(2 n )) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and... (Update)
Cited by: More
Quantum Fourier transforms for extracting hidden - Linear Structures In (Correct)
quant-ph/9607030 31 Jul 1996 - Calt- Quic- Efficient (Correct)
schums1.tex; submitted to Phys. Rev. A 3/7/96.. - As Quantum Computation (Correct)
Similar documents (at the sentence level):
74.5%: Elementary gates for quantum computation - Adriano Barenco Oxford (Correct)
74.1%: quant-ph/9503016 - Mar Elementary Gates (Correct)
Active bibliography (related documents): More All
2.1: Elementary Gates for Quantum Computation - Barenco, Bennett, Cleve, Di.. (1995) (Correct)
0.9: Simulating Physics with Computers - Feynman (1982) (Correct)
0.6: Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985) (Correct)
Similar documents based on text: More All
0.2: Distinguishability and Accessible Information in Quantum Theory - Fuchs (1995) (Correct)
0.2: Counting by Quantum Eigenvalue Estimation - Mosca (Correct)
0.2: The Tycho Catalogue: Stellar Content - Egret, Fabricius (Correct)
Related documents from co-citation: More All
33: Algorithms for quantum computation: Discrete logarithms and factoring - Shor - 1994
33: Quantum complexity theory - Bernstein, Vazirani - 1993
29: Rapid solutions of problems by quantum computation (context) - Deutsch, Jozsa - 1992
BibTeX entry: (Update)
Barenco, Adriano, Charles Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter, Elementary gates for quantum computation, Phys. Rev. A, Vol. 52, No. 5, November, 1995, pp 3457 - 3467. http://citeseer.ist.psu.edu/article/barenco95elementary.html More
@article{ barenco95elementary,
author = "Adriano Barenco and Charles H.~Bennett and Richard Cleve and David P.~DiVincenzo and Norman H.~Margolus and Peter W.~Shor and Tycho Sleator and John A.~Smolin and Harald Weinfurter",
title = "Elementary gates for quantum computation",
journal = "Physical Review A",
volume = "52",
number = "5",
pages = "3457--3467",
year = "1995",
url = "citeseer.ist.psu.edu/article/barenco95elementary.html" }
Citations (may not include all citations):173 Quantum complexity theory - Bernstein, Vazirani - 1993 ACM DBLP
144 the power of quantum computation - Simon - 1994
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992 ACM
86 Conservative Logic (context) - Fredkin, Toffoli - 1982 ACM
85 Quantum Circuit Complexity - Yao - 1993 DBLP
73 Quantum mechanical computers (context) - Feynman - 1985
70 Quantum computational networks (context) - Deutsch - 1989
57 Algorithms for quantum computation: discrete log and factori.. - Shor - 1994
49 Two-bit gates are universal for quantum computation - DiVincenzo - 1995
48 Quantum theory, the Church-Turing principle and the universa.. - Deutsch - 1985
46 Quantum computations with cold trapped ions (context) - Cirac, Zoller - 1994
36 Oracle quantum computing - Berthiaume, Brassard - 1992
34 Quantum mechanical Hamiltonian models of Turing machines (context) - Benioff - 1982
30 Reversible Computing (context) - Toffoli - 1980
25 On Quantum Coding - Schumacher - 1995
24 Universality in quantum computation - Deutsch, Barenco et al. - 1995
24 A New Proof of the Quantum Noiseless Coding Theorem - Jozsa, Schumacher - 1994
23 Maintaining coherence in quantum computers (context) - Unruh - 1995
21 Parallel Quantum Computation - Margolus - 1990
18 A universal two-bit gate for quantum computation (context) - Barenco - 1994
16 Almost any quantum logic gate is universal (context) - Lloyd - 1994
14 Experimental realization of any discrete unitary operator (context) - Reck, Zeilinger et al. - 1994
10 A simple quantum computer (context) - Chuang, Yamamoto - 1994
9 Quantum Computers, Factoring and Decoherence - Chuang, Laflamme et al. - 1995
8 Reversible logic and quantum computers (context) - Peres - 1985
8 Is quantum mechanics useful (context) - Landauer
8 The stabilisation of quantum computations - Berthiaume, Deutsch et al. - 1994
7 Realizable universal quantum logic gates (context) - Sleator, Weinfurter - 1994
4 Logic gates for quantum circuits (context) - Barenco, Deutsch et al. - 1994
2 Realization of the Fredkin gate using a series of one- and t.. (context) - Chau, Wilczek - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.att.com/~shor/papers/): More
Algorithms for Quantum Computation: Discrete Logarithms and.. - Shor (1994) (Correct)
Fault-Tolerant Quantum Computation - Shor (1996) (Correct)
Cube Tilings of Rn and Nonlinear Codes - Lagarias, Shor (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC