Demonstration of two-qubit algorithms with a superconducting quantum processor
L. DiCarlo,
J. M. Chow,
J. M. Gambetta,
Lev S. Bishop,
B. R. Johnson,
D. I. Schuster,
J. Majer,
A. Blais,
L. Frunzio,
S. M. Girvin and
R. J. Schoelkopf ()
Additional contact information
L. DiCarlo: Yale University, New Haven, Connecticut 06511, USA
J. M. Chow: Yale University, New Haven, Connecticut 06511, USA
J. M. Gambetta: University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Lev S. Bishop: Yale University, New Haven, Connecticut 06511, USA
B. R. Johnson: Yale University, New Haven, Connecticut 06511, USA
D. I. Schuster: Yale University, New Haven, Connecticut 06511, USA
J. Majer: Atominstitut der Österreichischen Universitäten, TU-Wien, A-1020 Vienna, Austria
A. Blais: Université de Sherbrooke, Sherbrooke, Québec J1K 2R1, Canada
L. Frunzio: Yale University, New Haven, Connecticut 06511, USA
S. M. Girvin: Yale University, New Haven, Connecticut 06511, USA
R. J. Schoelkopf: Yale University, New Haven, Connecticut 06511, USA
Nature, 2009, vol. 460, issue 7252, 240-244
Abstract:
Solid progress By exploiting two key aspects of quantum mechanics — the superposition and entanglement of physical states — quantum computers may eventually outperform their classical equivalents. A team based at Yale has achieved an important step towards that goal — the demonstration of the first solid-state quantum processor, which was used to execute two quantum algorithms. Quantum processors based on a few quantum bits have been demonstrated before using nuclear magnetic resonance, cold ion traps and optical systems, all of which bear little resemblance to conventional computers. This new processor is based on superconducting quantum circuits fabricated using conventional nanofabrication technology. There is still a long way to go before quantum computers can challenge the classical type. The processor is very basic, containing just two quantum bits, and operates at a fraction of a degree above absolute zero. But the chip contains all the essential features of a miniature working quantum computer and may prove scalable to more quantum bits and more complex algorithms.
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
https://www.nature.com/articles/nature08121 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:460:y:2009:i:7252:d:10.1038_nature08121
Ordering information: This journal article can be ordered from
https://www.nature.com/
DOI: 10.1038/nature08121
Access Statistics for this article
Nature is currently edited by Magdalena Skipper
More articles in Nature from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().