IDEAS home Printed from https://ideas.repec.org/a/nat/natcom/v10y2019i1d10.1038_s41467-019-13534-2.html
   My bibliography  Save this article

Benchmarking an 11-qubit quantum computer

Author

Listed:
  • K. Wright

    (IonQ, Inc.)

  • K. M. Beck

    (IonQ, Inc.)

  • S. Debnath

    (IonQ, Inc.)

  • J. M. Amini

    (IonQ, Inc.)

  • Y. Nam

    (IonQ, Inc.)

  • N. Grzesiak

    (IonQ, Inc.)

  • J.-S. Chen

    (IonQ, Inc.)

  • N. C. Pisenti

    (IonQ, Inc.)

  • M. Chmielewski

    (IonQ, Inc.
    University of Maryland)

  • C. Collins

    (IonQ, Inc.)

  • K. M. Hudek

    (IonQ, Inc.)

  • J. Mizrahi

    (IonQ, Inc.)

  • J. D. Wong-Campos

    (IonQ, Inc.)

  • S. Allen

    (IonQ, Inc.)

  • J. Apisdorf

    (IonQ, Inc.)

  • P. Solomon

    (IonQ, Inc.)

  • M. Williams

    (IonQ, Inc.)

  • A. M. Ducore

    (IonQ, Inc.)

  • A. Blinov

    (IonQ, Inc.)

  • S. M. Kreikemeier

    (IonQ, Inc.)

  • V. Chaplin

    (IonQ, Inc.)

  • M. Keesan

    (IonQ, Inc.)

  • C. Monroe

    (IonQ, Inc.
    University of Maryland)

  • J. Kim

    (IonQ, Inc.
    Duke University)

Abstract

The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions. We demonstrate average single-qubit gate fidelities of 99.5$$\%$$%, average two-qubit-gate fidelities of 97.5$$\%$$%, and SPAM errors of 0.7$$\%$$%. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani and Hidden Shift algorithms into our native gates and execute them on the hardware with average success rates of 78$$\%$$% and 35$$\%$$%, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.

Suggested Citation

  • K. Wright & K. M. Beck & S. Debnath & J. M. Amini & Y. Nam & N. Grzesiak & J.-S. Chen & N. C. Pisenti & M. Chmielewski & C. Collins & K. M. Hudek & J. Mizrahi & J. D. Wong-Campos & S. Allen & J. Apisd, 2019. "Benchmarking an 11-qubit quantum computer," Nature Communications, Nature, vol. 10(1), pages 1-6, December.
  • Handle: RePEc:nat:natcom:v:10:y:2019:i:1:d:10.1038_s41467-019-13534-2
    DOI: 10.1038/s41467-019-13534-2
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41467-019-13534-2
    File Function: Abstract
    Download Restriction: no

    File URL: https://libkey.io/10.1038/s41467-019-13534-2?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
    ---><---

    Citations

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


    Cited by:

    1. M. Akhtar & F. Bonus & F. R. Lebrun-Gallagher & N. I. Johnson & M. Siegele-Brown & S. Hong & S. J. Hile & S. A. Kulmiya & S. Weidt & W. K. Hensinger, 2023. "A high-fidelity quantum matter-link between ion-trap microchip modules," Nature Communications, Nature, vol. 14(1), pages 1-8, December.
    2. Sitan Chen & Jordan Cotler & Hsin-Yuan Huang & Jerry Li, 2023. "The complexity of NISQ," Nature Communications, Nature, vol. 14(1), pages 1-6, December.
    3. D. Zhu & Z. P. Cian & C. Noel & A. Risinger & D. Biswas & L. Egan & Y. Zhu & A. M. Green & C. Huerta Alderete & N. H. Nguyen & Q. Wang & A. Maksymov & Y. Nam & M. Cetina & N. M. Linke & M. Hafezi & C., 2022. "Cross-platform comparison of arbitrary quantum states," Nature Communications, Nature, vol. 13(1), pages 1-6, 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:natcom:v:10:y:2019:i:1:d:10.1038_s41467-019-13534-2. 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.