IDEAS home Printed from https://ideas.repec.org/a/nat/nature/v460y2009i7252d10.1038_nature08121.html
   My bibliography  Save this article

Demonstration of two-qubit algorithms with a superconducting quantum processor

Author

Listed:
  • 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)

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.

Suggested Citation

  • 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 & R. J. Schoelkopf, 2009. "Demonstration of two-qubit algorithms with a superconducting quantum processor," Nature, Nature, vol. 460(7252), pages 240-244, July.
    • Handle: RePEc:nat:nature:v:460:y:2009:i:7252:d:10.1038_nature08121
    DOI: 10.1038/nature08121
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/nature08121
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1038/nature08121?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Johannes Herrmann & Sergi Masot Llima & Ants Remm & Petr Zapletal & Nathan A. McMahon & Colin Scarato & François Swiadek & Christian Kraglund Andersen & Christoph Hellings & Sebastian Krinner & Nathan, 2022. "Realizing quantum convolutional neural networks on a superconducting quantum processor to recognize quantum phases," Nature Communications, Nature, vol. 13(1), pages 1-7, December.
    2. Paul V. Klimov & Andreas Bengtsson & Chris Quintana & Alexandre Bourassa & Sabrina Hong & Andrew Dunsworth & Kevin J. Satzinger & William P. Livingston & Volodymyr Sivak & Murphy Yuezhen Niu & Trond I, 2024. "Optimizing quantum gates towards the scale of logical qubits," Nature Communications, Nature, vol. 15(1), pages 1-8, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:nature:v:460:y:2009:i:7252:d:10.1038_nature08121. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.