IDEAS home Printed from https://ideas.repec.org/a/nat/natcom/v8y2017i1d10.1038_s41467-017-01904-7.html
   My bibliography  Save this article

Complete 3-Qubit Grover search on a programmable quantum computer

Author

Listed:
  • C. Figgatt

    (University of Maryland)

  • D. Maslov

    (University of Maryland
    National Science Foundation)

  • K. A. Landsman

    (University of Maryland)

  • N. M. Linke

    (University of Maryland)

  • S. Debnath

    (University of Maryland)

  • C. Monroe

    (University of Maryland
    IonQ Inc.)

Abstract

The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.

Suggested Citation

  • C. Figgatt & D. Maslov & K. A. Landsman & N. M. Linke & S. Debnath & C. Monroe, 2017. "Complete 3-Qubit Grover search on a programmable quantum computer," Nature Communications, Nature, vol. 8(1), pages 1-9, December.
    • Handle: RePEc:nat:natcom:v:8:y:2017:i:1:d:10.1038_s41467-017-01904-7
    DOI: 10.1038/s41467-017-01904-7
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41467-017-01904-7
    File Function: Abstract
    Download Restriction: no
    File URL: https://libkey.io/10.1038/s41467-017-01904-7?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. Xu, Yongzhen & Zhang, Shihao & Li, Lvzhou, 2023. "Quantum algorithm for learning secret strings and its experimental demonstration," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    2. Hu, Jie-Ru & Zhang, Zuo-Yuan & Liu, Jin-Ming, 2024. "Implementation of three-qubit Deutsch-Jozsa algorithm with pendular states of polar molecules by optimal control," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 635(C).

    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:8:y:2017:i:1:d:10.1038_s41467-017-01904-7. 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.