(Enter summary)
Abstract: A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the universality of three-bit gates, by analogy to the universality of the Toffoli three-bit gate of classical reversible computing. Two-bit quantum gates may be implemented by magnetic resonance operations applied to a pair of electronic or nuclear spins. A "gearbox... (Update)
Cited by: More
schums1.tex; submitted to Phys. Rev. A 3/7/96.. - As Quantum Computation
(Correct)
quant-ph/9603009 - Mar Schums Tex
(Correct)
Physics Limits Information Processing, and Hence the.. - Intelligent Beings And
(Correct)
Active bibliography (related documents): More All
0.4: Overview of Nanoelectric Devices - Goldhaber-Gordon, Montemerlo, Love.. (1997)
(Correct)
0.4: Overview of Nanoelectronic Devices - Goldhaber-Gordon, Montemerlo, Love, ..
(Correct)
0.3: Quantum Computer Emulator - De Raedt, Hams, Michielsen (2000)
(Correct)
Similar documents based on text: More All
0.2: Aspects of Digital Evolution: Geometry and Learning. - Miller, Thomson (1998)
(Correct)
0.1: Proper Tail Recursion and Space Efficiency - Clinger (1998)
(Correct)
0.1: Quantum State Engineering with Josephson-Junction Devices - Makhlin, Schön, Shnirman
(Correct)
Related documents from co-citation: More All
33: Elementary gates for quantum computation
- Adriano, Bennett et al. - 1995
24: Quantum computational network (context) - Deutsch - 1989
23: Quantum complexity theory
- Bernstein, Vazirani - 1993
BibTeX entry: (Update)
D. P. DiVincenzo. Two-bit gates are universal for quantum computation. Physical Review Letters A, 50(1015), (1995). http://citeseer.ist.psu.edu/divincenzo95twobit.html More
@article{ divincenzo95twobit,
author = "David P. Di Vincenzo",
title = "Two-bit gates are universal for quantum computation",
journal = "Physical Review A",
volume = "51",
number = "2",
pages = "1015--1022",
year = "1995",
url = "citeseer.ist.psu.edu/divincenzo95twobit.html" }
Citations (may not include all citations):
173
Quantum complexity theory
- Bernstein, Vazirani - 1993
144
the power of quantum computation
- Simon - 1994
126
Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992 ACM
57
Algorithms for quantum computation: discrete log and factori..
- Shor - 1994
27
Quantum Many-Particle Systems (context) - Negele, Orland - 1988
16
Principles of Magnetic Resonance (context) - Slichter - 1992
13
Quantum cellular automata (context) - Lent, Tougaw et al. - 1993 ACM
8
Structural basis of multistationary quantum systems. I. Effe.. (context) - Obermayer, Teich et al. - 1988
4
Quantum computer on a class of one-dimensional Ising systems (context) - Berman, Doolen et al. - 1994
3
An atomic switch realized with the scanning tunneling micros.. (context) - Eigler, Lutz et al. - 1991
1
Aharonov-Bohm effect in normal metal quantum coherence and t.. (context) - See, Washburn et al. - 1986
1
Ultraslow optical dephasing in Eu 3+ : Y 2 SiO 5 (context) - Equall, Sun et al. - 1994
1
Polarization of 21 Ne by spin exchange with optically pumped.. (context) - Chupp, Coulter - 1985
1
The Principles of Nuclear Magnetism (context) - Abragham - 1961
1
Programming pulse driven quantum computers (context) - discussion, Lloyd - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://vesta.physics.ucla.edu/~smolin/index.html): More
Results on Two-Bit Gate Design for Quantum Computers - DiVincenzo, Smolin (1998)
(Correct)
Elementary Gates for Quantum Computation - Barenco, Bennett, Cleve, Di.. (1995)
(Correct)
Quantum Coding - Schumacher (1995)
(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