Access
To read this story in full you will need to login or make a payment (see right).
Letters to Nature
Nature 408, 339-342 (16 November 2000) | doi:10.1038/35042541; Received 30 May 2000; Accepted 2 October 2000
nature jobs
Regional Sales Manager- Genrric Division (Copporate Office)
- Rhydburg Pharmaceuticals
- Selaqui-Dehradun India
BE / BC Gastroenterologist
- Meadville Medical Center
- Meadville, PA
Universal quantum computation with the exchange interaction
D. P. DiVincenzo1, D. Bacon2,3, J. Kempe2,4,5, G. Burkard6 & K. B. Whaley2
- IBM Research Division, T. J. Watson Research Center, Yorktown Heights, New York 10598, USA
- Department of Chemistry,
- Department of Physics,
- Department of Mathematics, University of California, Berkeley, California 94720, USA
- École Nationale Superieure des Télécommunications, 46 rue Barrault, 75634 Paris Cedex 13, France
- Department of Physics and Astronomy, University of Basel, Klingelbergstrasse 82, CH-4056 Basel, Switzerland
Correspondence to: D. P. DiVincenzo1 Correspondence and requests for materials should be addressed to D.P.D. (e-mail: Email: divince@watson.ibm.com).
Abstract
Various physical implementations of quantum computers are being investigated, although the requirements1 that must be met to make such devices a reality in the laboratory at present involve capabilities well beyond the state of the art. Recent solid-state approaches have used quantum dots2, donor-atom nuclear spins3 or electron spins4; in these architectures, the basic two-qubit quantum gate is generated by a tunable exchange interaction between spins (a Heisenberg interaction), whereas the one-qubit gates require control over a local magnetic field. Compared to the Heisenberg operation, the one-qubit operations are significantly slower, requiring substantially greater materials and device complexity—potentially contributing to a detrimental increase in the decoherence rate. Here we introduced an explicit scheme in which the Heisenberg interaction alone suffices to implement exactly any quantum computer circuit. This capability comes at a price of a factor of three in additional qubits, and about a factor of ten in additional two-qubit operations. Even at this cost, the ability to eliminate the complexity of one-qubit operations should accelerate progress towards solid-state implementations of quantum computation1.
To read this story in full you will need to login or make a payment (see right).

