IDEAS home Printed from https://ideas.repec.org/a/nat/nature/v604y2022i7906d10.1038_s41586-022-04603-6.html
   My bibliography  Save this article

Multi-qubit entanglement and algorithms on a neutral-atom quantum computer

Author

Listed:
  • T. M. Graham

    (University of Wisconsin-Madison)

  • Y. Song

    (University of Wisconsin-Madison)

  • J. Scott

    (University of Wisconsin-Madison)

  • C. Poole

    (University of Wisconsin-Madison)

  • L. Phuttitarn

    (University of Wisconsin-Madison)

  • K. Jooya

    (University of Wisconsin-Madison)

  • P. Eichler

    (University of Wisconsin-Madison)

  • X. Jiang

    (University of Wisconsin-Madison)

  • A. Marra

    (University of Wisconsin-Madison
    University of Central Florida)

  • B. Grinkemeyer

    (University of Wisconsin-Madison
    Harvard University)

  • M. Kwon

    (University of Wisconsin-Madison
    Columbia University)

  • M. Ebert

    (ColdQuanta, Inc.)

  • J. Cherek

    (ColdQuanta, Inc.)

  • M. T. Lichtman

    (ColdQuanta, Inc.)

  • M. Gillette

    (ColdQuanta, Inc.)

  • J. Gilbert

    (ColdQuanta, Inc.)

  • D. Bowman

    (Oxford Centre for Innovation)

  • T. Ballance

    (Oxford Centre for Innovation)

  • C. Campbell

    (ColdQuanta, Inc.)

  • E. D. Dahl

    (ColdQuanta, Inc.)

  • O. Crawford

    (Riverlane)

  • N. S. Blunt

    (Riverlane)

  • B. Rogers

    (Riverlane)

  • T. Noel

    (ColdQuanta, Inc.)

  • M. Saffman

    (University of Wisconsin-Madison
    ColdQuanta, Inc.)

Abstract

Gate-model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high-fidelity logic. Neutral-atom hyperfine qubits provide inherent scalability owing to their identical characteristics, long coherence times and ability to be trapped in dense, multidimensional arrays1. Combined with the strong entangling interactions provided by Rydberg states2–4, all the necessary characteristics for quantum computation are available. Here we demonstrate several quantum algorithms on a programmable gate-model neutral-atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits. Preparation of entangled Greenberger–Horne–Zeilinger (GHZ) states5 with up to six qubits, quantum phase estimation for a chemistry problem6 and the quantum approximate optimization algorithm (QAOA)7 for the maximum cut (MaxCut) graph problem are demonstrated. These results highlight the emergent capability of neutral-atom qubit arrays for universal, programmable quantum computation, as well as preparation of non-classical states of use for quantum-enhanced sensing.

Suggested Citation

  • T. M. Graham & Y. Song & J. Scott & C. Poole & L. Phuttitarn & K. Jooya & P. Eichler & X. Jiang & A. Marra & B. Grinkemeyer & M. Kwon & M. Ebert & J. Cherek & M. T. Lichtman & M. Gillette & J. Gilbert, 2022. "Multi-qubit entanglement and algorithms on a neutral-atom quantum computer," Nature, Nature, vol. 604(7906), pages 457-462, April.
  • Handle: RePEc:nat:nature:v:604:y:2022:i:7906:d:10.1038_s41586-022-04603-6
    DOI: 10.1038/s41586-022-04603-6
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41586-022-04603-6
    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/s41586-022-04603-6?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. Benedikt Fauseweh, 2024. "Quantum many-body simulations on digital quantum computers: State-of-the-art and future challenges," Nature Communications, Nature, vol. 15(1), pages 1-13, 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:604:y:2022:i:7906:d:10.1038_s41586-022-04603-6. 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.