Noisy intermediate-scale quantum era
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]
Algorithms[edit]
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[edit]
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[edit]
- Quantum complexity theory
- Quantum noise
- List of companies involved in quantum computing or communication
- List of quantum processors
- Timeline of quantum computing and communication
- Quantum information
References[edit]
- ^ "Quantum Computing Scientists: Give Them Lemons, They'll Make Lemonade". www.aps.org. Retrieved 2021-06-29.
- ^ Jump up to: a b c d 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.
- ^ "Quantum computers in 2023: how they work, what they do, and where they're heading". The Conversation. Retrieved 2024-01-15.
- ^ Jump up to: a b "Engineers demonstrate a quantum advantage". ScienceDaily. Retrieved 2021-06-29.
- ^ Jump up to: a b "What is Quantum Computing?". TechSpot. 28 June 2021. Retrieved 2021-06-29.
- ^ 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.
- ^ Alex Wilkins. "Record-breaking quantum computer has more than 1000 qubits". New Scientist. Retrieved 2024-04-18.
- ^ Karmela Padavic-Callaghan. "IBM's 'Condor' quantum computer has more than 1000 qubits". New Scientist. Retrieved 2024-04-18.
- ^ "Quantum computers are already detangling nature's mysteries". Wired UK. ISSN 1357-0978. Retrieved 2021-06-29.
- ^ 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.
- ^ 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.
- ^ 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.
