Noisy intermediate-scale quantum era

Last updated

The current state of quantum computing [1] is referred to as the noisy intermediate-scale quantum (NISQ) era, [2] [3] characterized by quantum processors containing up to 1,000 qubits which are not advanced enough yet for fault-tolerance or large enough to achieve quantum advantage. [4] [5] These processors, which are sensitive to their environment (noisy) and prone to quantum decoherence, are not yet capable of continuous quantum error correction. This intermediate-scale is defined by the quantum volume, which is based on the moderate number of qubits and gate fidelity. The term NISQ was coined by John Preskill in 2018. [6] [2] In October 2023, the 1,000 qubit mark was passed for the first time by Atom Computing's 1,180 qubit quantum processor. [7] However, as of 2024, only two quantum processors have over 1,000 qubits, with sub-1,000 quantum processors still remaining the norm. [8]

Contents

Algorithms

NISQ algorithms are quantum algorithms designed for quantum processors in the NISQ era. Common examples are the variational quantum eigensolver (VQE) and quantum approximate optimization algorithm (QAOA), which use NISQ devices but offload some calculations to classical processors. [2] These algorithms have been successful in quantum chemistry and have potential applications in various fields including physics, materials science, data science, cryptography, biology, and finance. [2] However, due to noise during circuit execution, they often require error mitigation techniques. [9] [5] [10] [11] These methods constitute a way of reducing the effect of noise by running a set of circuits and applying post-processing to the measured data. In contrast to quantum error correction, where errors are continuously detected and corrected during the run of the circuit, error mitigation can only use the final outcome of the noisy circuits.

Beyond-NISQ era

The creation of a computer with tens of thousands of qubits and enough error correction would eventually end the NISQ era. [4] These beyond-NISQ devices would be able to, for example, implement Shor's algorithm for very large numbers and break RSA encryption. [12]

See also

Related Research Articles

<span class="mw-page-title-main">Quantum computing</span> Technology that uses quantum mechanics

A quantum computer is a computer that uses quantum mechanical phenomena to operate.

Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical algorithms. On the other hand, factoring numbers of practical significance requires far more qubits than available in the near future. Another concern is that noise in quantum circuits may undermine results, requiring additional qubits for quantum error correction.

This is a timeline of quantum computing.

Quantum information science is a field that combines the principles of quantum mechanics with information theory to study the processing, analysis, and transmission of information. It covers both theoretical and experimental aspects of quantum physics, including the limits of what can be achieved with quantum information. The term quantum information theory is sometimes used, but it does not include experimental research and can be confused with a subfield of quantum information science that deals with the processing of quantum information.

Quantum error correction (QEC) is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is theorised as essential to achieve fault tolerant quantum computing that can reduce the effects of noise on stored quantum information, faulty quantum gates, faulty quantum preparation, and faulty measurements. This would allow algorithms of greater circuit depth.

Superconducting quantum computing is a branch of solid state quantum computing that implements superconducting electronic circuits using superconducting qubits as artificial atoms, or quantum dots. For superconducting qubits, the two logic states are the ground state and the excited state, denoted respectively. Research in superconducting quantum computing is conducted by companies such as Google, IBM, IMEC, BBN Technologies, Rigetti, and Intel. Many recently developed QPUs use superconducting architecture.

A topological quantum computer is a theoretical quantum computer proposed by Russian-American physicist Alexei Kitaev in 1997. It employs quasiparticles in two-dimensional systems, called anyons, whose world lines pass around one another to form braids in a three-dimensional spacetime. These braids form the logic gates that make up the computer. The advantage of a quantum computer based on quantum braids over using trapped quantum particles is that the former is much more stable. Small, cumulative perturbations can cause quantum states to decohere and introduce errors in the computation, but such small perturbations do not change the braids' topological properties. This is like the effort required to cut a string and reattach the ends to form a different braid, as opposed to a ball bumping into a wall.

In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that stabilizer circuits, circuits that only consist of gates from the normalizer of the qubit Pauli group, also called Clifford group, can be perfectly simulated in polynomial time on a probabilistic classical computer. The Clifford group can be generated solely by using CNOT, Hadamard, and phase gate S; and therefore stabilizer circuits can be constructed using only these gates.

<span class="mw-page-title-main">Gil Kalai</span> Israeli mathematician and computer scientist

Gil Kalai is an Israeli mathematician and computer scientist. He is the Henry and Manya Noskwith Professor Emeritus of Mathematics at the Hebrew University of Jerusalem, Israel, Professor of Computer Science at the Interdisciplinary Center, Herzliya, and adjunct Professor of mathematics and of computer science at Yale University, United States.

<span class="mw-page-title-main">Quantum machine learning</span> Interdisciplinary research area at the intersection of quantum physics and machine learning

Quantum machine learning is the integration of quantum algorithms within machine learning programs.

IBM Quantum Platform is an online platform allowing public and premium access to cloud-based quantum computing services provided by IBM. This includes access to a set of IBM's prototype quantum processors, a set of tutorials on quantum computation, and access to an interactive textbook. As of February 2021, there are over 20 devices on the service, six of which are freely available for the public. This service can be used to run algorithms and experiments, and explore tutorials and simulations around what might be possible with quantum computing.

In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem. The term was coined by John Preskill in 2012, but the concept dates to Yuri Manin's 1980 and Richard Feynman's 1981 proposals of quantum computing.

Continuous-variable (CV) quantum information is the area of quantum information science that makes use of physical observables, like the strength of an electromagnetic field, whose numerical values belong to continuous intervals. One primary application is quantum computing. In a sense, continuous-variable quantum computation is "analog", while quantum computation using qubits is "digital." In more technical terms, the former makes use of Hilbert spaces that are infinite-dimensional, while the Hilbert spaces for systems comprising collections of qubits are finite-dimensional. One motivation for studying continuous-variable quantum computation is to understand what resources are necessary to make quantum computers more powerful than classical ones.

In quantum computing, a qubit is a unit of information analogous to a bit in classical computing, but it is affected by quantum mechanical properties such as superposition and entanglement which allow qubits to be in some ways more powerful than classical bits for some tasks. Qubits are used in quantum circuits and quantum algorithms composed of quantum logic gates to solve computational problems, where they are used for input/output and intermediate computations.

Quantum volume is a metric that measures the capabilities and error rates of a quantum computer. It expresses the maximum size of square quantum circuits that can be implemented successfully by the computer. The form of the circuits is independent from the quantum computer architecture, but compiler can transform and optimize it to take advantage of the computer's features. Thus, quantum volumes for different architectures can be compared.

Randomized benchmarking is an experimental method for measuring the average error rates of quantum computing hardware platforms. The protocol estimates the average error rates by implementing long sequences of randomly sampled quantum gate operations. Randomized benchmarking is the industry-standard protocol used by quantum hardware developers such as IBM and Google to test the performance of the quantum operations.

Magic state distillation is a method for creating more accurate quantum states from multiple noisy ones, which is important for building fault tolerant quantum computers. It has also been linked to quantum contextuality, a concept thought to contribute to quantum computers' power.

The Eastin–Knill theorem is a no-go theorem that states: "No quantum error correcting code can have a continuous symmetry which acts transversely on physical qubits". In other words, no quantum error correcting code can transversely implement a universal gate set, where a transversal logical gate is one that can be implemented on a logical qubit by the independent action of separate physical gates on corresponding physical qubits.

This glossary of quantum computing is a list of definitions of terms and concepts used in quantum computing, its sub-disciplines, and related fields.

References

  1. ↑ "Quantum Computing Scientists: Give Them Lemons, They'll Make Lemonade". www.aps.org. Retrieved 2021-06-29.
  2. 1 2 3 4 Brooks, Michael (2019-10-03). "Beyond quantum supremacy: the hunt for useful quantum computers". Nature. 574 (7776): 19–21. Bibcode:2019Natur.574...19B. doi: 10.1038/d41586-019-02936-3 . ISSN   0028-0836. PMID   31578489.
  3. ↑ "Quantum computers in 2023: how they work, what they do, and where they're heading". The Conversation. Retrieved 2024-01-15.
  4. 1 2 "Engineers demonstrate a quantum advantage". ScienceDaily. Retrieved 2021-06-29.
  5. 1 2 "What is Quantum Computing?". TechSpot. 28 June 2021. Retrieved 2021-06-29.
  6. ↑ Preskill, John (2018-08-06). "Quantum Computing in the NISQ era and beyond". Quantum. 2: 79. arXiv: 1801.00862 . Bibcode:2018Quant...2...79P. doi: 10.22331/q-2018-08-06-79 . S2CID   44098998.
  7. ↑ #author.fullName}. "Record-breaking quantum computer has more than 1000 qubits". New Scientist. Retrieved 2024-04-18.{{cite web}}: |last= has generic name (help)
  8. ↑ #author.fullName}. "IBM's 'Condor' quantum computer has more than 1000 qubits". New Scientist. Retrieved 2024-04-18.{{cite web}}: |last= has generic name (help)
  9. ↑ "Quantum computers are already detangling nature's mysteries". Wired UK. ISSN   1357-0978 . Retrieved 2021-06-29.
  10. ↑ Ritter, Mark B. (2019). "Near-term Quantum Algorithms for Quantum Many-body Systems". Journal of Physics: Conference Series. 1290 (1): 012003. Bibcode:2019JPhCS1290a2003R. doi: 10.1088/1742-6596/1290/1/012003 . ISSN   1742-6588.
  11. ↑ Cai, Zhenyu; Babbush, Ryan; Benjamin, Simon C.; Endo, Suguru; Huggins, William J.; Li, Ying; McClean, Jarrod R.; O'Brien, Thomas E. (2023-12-13). "Quantum error mitigation". Rev. Mod. Phys. 95 (3): 032338. arXiv: 2210.00921 . doi:10.1103/RevModPhys.95.045005.
  12. ↑ O'Gorman, Joe; Campbell, Earl T. (2017-03-31). "Quantum computation with realistic magic-state factories". Physical Review A. 95 (3): 032338. arXiv: 1605.07197 . Bibcode:2017PhRvA..95c2338O. doi:10.1103/PhysRevA.95.032338. ISSN   2469-9926. S2CID   55579588.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.