For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
62
views
31
references
 Top references
cited by
927
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      453
      similar
       All similar
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Quantum Computing in the NISQ era and beyond

      Author(s): 1
      Publication date Created:
      Publication date (Electronic):
      Journal: Quantum
      Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.

          Related collections

          Most cited references31

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          Quantum Mechanics helps in searching for a needle in a haystack

          Lov Grover (1997)
          Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50%, any classical algorithm (whether deterministic or probabilistic) will need to access the database a minimum of O(N) times. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) accesses to the database.
          Article 0 comments Cited 411 times – based on 0 reviews
          Preprint
               Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

            Peter W. Shor (1999)
            Article 0 comments Cited 350 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing

              P. O`Malley, P. Roushan, R. Barends … (2014)
              A quantum computer can solve hard problems - such as prime factoring, database searching, and quantum simulation - at the cost of needing to protect fragile quantum states from error. Quantum error correction provides this protection, by distributing a logical state among many physical qubits via quantum entanglement. Superconductivity is an appealing platform, as it allows for constructing large quantum circuits, and is compatible with microfabrication. For superconducting qubits the surface code is a natural choice for error correction, as it uses only nearest-neighbour coupling and rapidly-cycled entangling gates. The gate fidelity requirements are modest: The per-step fidelity threshold is only about 99%. Here, we demonstrate a universal set of logic gates in a superconducting multi-qubit processor, achieving an average single-qubit gate fidelity of 99.92% and a two-qubit gate fidelity up to 99.4%. This places Josephson quantum computing at the fault-tolerant threshold for surface code error correction. Our quantum processor is a first step towards the surface code, using five qubits arranged in a linear array with nearest-neighbour coupling. As a further demonstration, we construct a five-qubit Greenberger-Horne-Zeilinger (GHZ) state using the complete circuit and full set of gates. The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
              Article 0 comments Cited 330 times – based on 0 reviews
              Preprint
                   Review now
                Bookmark
                All references

                Author and article information

                Journal
                Title: Quantum
                Abbreviated Title: Quantum
                Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
                ISSN (Electronic): 2521-327X
                Publication date Created: August 06 2018
                Publication date (Electronic): August 06 2018
                Volume: 2
                Page: 79
                Affiliations
                [1 ]Institute for Quantum Information and Matter and Walter Burke Institute for Theoretical Physics, California Institute of Technology, Pasadena CA 91125, USA
                Article
                DOI: 10.22331/q-2018-08-06-79
                SO-VID: 3c0ae368-4e2c-4e07-82ac-0649fc4d10a3
                Copyright © © 2018
                License:

                https://creativecommons.org/licenses/by/4.0/

                History

                Data availability:

                Comments

                Comment on this article