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

Roads towards fault-tolerant universal quantum computation

Author

Listed:
  • Earl T. Campbell

    (University of Sheffield)

  • Barbara M. Terhal

    (JARA Institute for Quantum Information, RWTH Aachen University
    Forschungszentrum Juelich)

  • Christophe Vuillot

    (JARA Institute for Quantum Information, RWTH Aachen University)

Abstract

A practical quantum computer must not merely store information, but also process it. To prevent errors introduced by noise from multiplying and spreading, a fault-tolerant computational architecture is required. Current experiments are taking the first steps toward noise-resilient logical qubits. But to convert these quantum devices from memories to processors, it is necessary to specify how a universal set of gates is performed on them. The leading proposals for doing so, such as magic-state distillation and colour-code techniques, have high resource demands. Alternative schemes, such as those that use high-dimensional quantum codes in a modular architecture, have potential benefits, but need to be explored further.

Suggested Citation

  • Earl T. Campbell & Barbara M. Terhal & Christophe Vuillot, 2017. "Roads towards fault-tolerant universal quantum computation," Nature, Nature, vol. 549(7671), pages 172-179, September.
    • Handle: RePEc:nat:nature:v:549:y:2017:i:7671:d:10.1038_nature23460
    DOI: 10.1038/nature23460
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/nature23460
    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/nature23460?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. J. Helsen & M. Ioannou & J. Kitzinger & E. Onorati & A. H. Werner & J. Eisert & I. Roth, 2023. "Shadow estimation of gate-set properties from random sequences," Nature Communications, Nature, vol. 14(1), pages 1-11, 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:549:y:2017:i:7671:d:10.1038_nature23460. 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.