Noisy intermediate-scale quantum computing

Short description: Experimental technology level

Noisy intermediate-scale quantum (NISQ) computing is 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.[1][2] 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 a moderate number of qubits and gate fidelity. The NISQ era is the current state of quantum computer technology,[3][4][5] and the term was coined by John Preskill in 2018.[6][4]

According to Microsoft Azure Quantum's scheme, NISQ computation is considered level 1, the lowest of the quantum computing implementation levels.[7][8]

In October 2023, the 1,000 qubit mark was passed for the first time by Atom Computing's 1,180 qubit quantum processor.[9] However, as of 2024, only two quantum processors have over 1,000 qubits, with sub-1,000 quantum processors still remaining the norm.[10]

## Contents

* 1 Algorithms
* 1.1 The quantum hardware landscape
* 1.2 Variational quantum eigensolver
* 1.2.1 Mathematical foundation and implementation
* 1.2.2 Real-world applications and achievements
* 1.2.3 Scaling challenges and solutions
* 1.3 Quantum approximate optimization algorithm
* 1.3.1 Algorithm structure and methodology
* 1.3.2 Performance benchmarks and quantum advantage
* 2 Error mitigation: Making noisy quantum computing practical
* 2.1 Zero-noise extrapolation
* 2.2 Symmetry verification and probabilistic error cancellation
* 2.3 Performance overhead and trade-offs
* 3 Quantum advantage: Current status and future prospects
* 4 Theoretical separations and limitations
* 5 Beyond-NISQ era
* 6 Industry roadmaps and timeline projections
* 7 See also
* 8 References
* 9 External links

## 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.[4] 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.[4] However, due to noise during circuit execution, they often require error mitigation techniques.[11][2][12][13] 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 outcome of the noisy circuits.

### The quantum hardware landscape

Current NISQ devices typically contain between 50 and 1,000 physical qubits, with leading systems from IBM, Google, and other companies pushing these boundaries. However, these qubits are inherently "noisy" – they suffer from decoherence, gate errors, and measurement errors that accumulate during computation.[14] Gate fidelities hover around 99-99.5% for single-qubit operations and 95–99% for two-qubit gates, which while impressive, still introduce significant errors in circuits with thousands of operations.

The fundamental challenge lies in the exponential scaling of quantum noise. With error rates above 0.1% per gate, quantum circuits can execute approximately 1,000 gates before noise overwhelms the signal. This constraint severely limits the depth and complexity of algorithms that can be successfully implemented on current hardware, necessitating the development of specialized NISQ algorithms that work within these constraints.[6][15]

### Variational quantum eigensolver

The variational quantum eigensolver represents one of the most successful NISQ algorithms, specifically designed for quantum chemistry applications. VQE tackles the fundamental problem of finding the ground state energy of molecular systems – a computation that scales exponentially with system size on classical computers but can potentially be solved in polynomial time on quantum devices.[16]

#### Mathematical foundation and implementation

VQE operates on the variational principle of quantum mechanics, which states that the expectation value of any trial wavefunction provides an upper bound on the true ground state energy. The algorithm constructs a parameterized quantum circuit called an ansatz∣ψ(θ)⟩, to approximate the ground state of a molecular Hamiltonian H^:E(θ)=⟨ψ(θ)∣H^∣ψ(θ)⟩[17]

The quantum processor prepares the ansatz state and measures the Hamiltonian expectation value, while a classical optimizer iteratively adjusts the parameters θ to minimize the energy. This hybrid approach leverages quantum superposition to explore exponentially large molecular configuration spaces while relying on well-established classical optimization techniques.[17]

#### Real-world applications and achievements

VQE has been successfully demonstrated on various molecular systems, from simple diatomic molecules like H₂ and LiH to more complex systems including water molecules and small organic compounds. Google's collaboration with Columbia University demonstrated VQE calculations on 16 qubits to study carbon atoms in diamond crystal structures, representing the largest quantum chemistry computation at that time.[18][19][20]

The algorithm has proven particularly valuable for studying chemical reactions, transition states, and excited state properties. Recent implementations have achieved chemical accuracy (within 1 kcal/mol) for small molecules, demonstrating the potential for quantum advantage in materials discovery and drug development applications.[21]

#### Scaling challenges and solutions

Despite its successes, VQE faces significant scaling challenges. The number of measurements required grows polynomial with the number of qubits, while the optimization landscape becomes increasingly complex for larger systems. The fragment molecular orbital (FMO) approach combined with VQE has shown promise for addressing scalability, allowing efficient simulation of larger molecular systems by breaking them into manageable fragments.[18]

### Quantum approximate optimization algorithm

QAOA represents a paradigmatic NISQ algorithm for solving combinatorial optimization problems that plague industries from finance to logistics. Developed by Farhi and colleagues, QAOA encodes optimization problems as Ising Hamiltonians and uses alternating quantum evolution operators to explore solution spaces.

#### Algorithm structure and methodology

QAOA constructs a quantum circuit consisting of p layers, each containing a cost Hamiltonian evolution e−iγjH^C followed by a mixer Hamiltonian evolution e−iβjH^M:

|ψ(γ,β)⟩=∏j=1pe−iβjH^Me−iγjH^C|+⟩⊗n

Classical optimization adjusts the angles {γj,βj} to maximize the probability of measuring good solutions.[22][23]

#### Performance benchmarks and quantum advantage

Recent theoretical and experimental work has demonstrated QAOA's potential for quantum advantage on specific problem classes. For the Max Cut problem on random graphs, QAOA at depth p=11 has been shown to outperform standard semidefinite programming algorithms. Even more remarkably, QAOA can exploit non-adiabatic quantum effects that classical algorithms cannot access, potentially circumventing fundamental limitations that constrain classical optimization methods.[24][25][26]

Experimental implementations on quantum hardware have shown promising results for problems with up to 20–30 variables, though current hardware limitations restrict practical applications to relatively small problem sizes. The algorithm's performance improves with circuit depth p, but NISQ constraints limit the achievable depth, creating a fundamental trade-off between solution quality and hardware requirement.[27][28]

## Error mitigation: Making noisy quantum computing practical

Since NISQ devices lack full quantum error correction, error mitigation techniques become essential for extracting meaningful results from noisy quantum computations. These techniques operate through post-processing measured data rather than actively correcting errors during computation, making them suitable for near-term hardware implementations.[29][30]

### Zero-noise extrapolation

Zero-noise extrapolation (ZNE) represents one of the most widely used error mitigation techniques, artificially amplifying circuit noise and extrapolating results to the zero-noise limit.[31] The method assumes that errors scale predictably with noise levels, allowing researchers to fit polynomial or exponential functions to noisy data and infer noise-free results.[32]

Recent implementations of purity-assisted ZNE have shown improved performance by incorporating additional information about quantum state degradation. This approach can extend ZNE's effectiveness to higher error regimes where conventional extrapolation methods fail, though it requires additional measurement overhead.

### Symmetry verification and probabilistic error cancellation

Symmetry verification exploits conservation laws inherent in quantum systems to detect and correct errors. For quantum chemistry calculations, symmetries such as particle number conservation or spin conservation provide powerful error detection mechanisms. When measurement results violate these symmetries, they can be discarded or corrected through post-selection.[33]

Probabilistic error cancellation reconstructs ideal quantum operations as linear combinations of noisy operations that can be implemented on hardware. While this approach can achieve zero bias in principle, the sampling overhead typically scales exponentially with error rates, limiting practical applications to relatively low-noise scenarios.

### Performance overhead and trade-offs

Error mitigation techniques inevitably increase measurement requirements, with overheads ranging from 2x to 10x or more depending on error rates and the specific method employed. This creates a fundamental trade-off between accuracy and experimental resources, requiring careful optimization for each application.[13]

Recent benchmarking studies comparing different mitigation strategies have shown that symmetry verification often provides the best performance for chemistry applications, while ZNE excels for optimization problems with fewer inherent symmetries. The choice of mitigation strategy significantly impacts the overall algorithm performance and should be tailored to specific problem types and hardware characteristics.[34]

## Quantum advantage: Current status and future prospects

The question of quantum advantage in the NISQ era remains hotly debated, with different complexity-theoretic frameworks providing varying conclusions about the computational power of noisy quantum devices. While theoretical work suggests that NISQ algorithms occupy a computational complexity class strictly between classical computing (BPP) and ideal quantum computing (BQP), experimental demonstrations of practical quantum advantage remain elusive.[35]

## Theoretical separations and limitations

Recent complexity theory results show that NISQ devices cannot achieve Grover-like quadratic speedups for unstructured search problems, fundamentally limiting their advantage for certain algorithm classes. However, NISQ algorithms can still achieve exponential advantages over classical methods for specific structured problems, such as the Bernstein-Vazirani problem, where quantum advantage requires only logarithmic query complexity.

For quantum state learning problems, NISQ devices face exponential limitations compared to fault-tolerant quantum computers, highlighting the importance of error correction for certain applications. These theoretical insights help define the boundaries of NISQ computational power and guide algorithm development efforts.[36]

## Beyond-NISQ era

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

In April 2024, researchers at Microsoft announced a significant reduction in error rates that required only 4 logical qubits, suggesting that quantum computing at scale could be years away instead of decades.[38]

## Industry roadmaps and timeline projections

Leading quantum computing companies have published ambitious roadmaps for achieving fault-tolerant quantum computing within the current decade. IBM has committed to delivering a large-scale fault-tolerant quantum computer, IBM Quantum Starling, by 2029. This system aims to execute quantum circuits comprising 100 million quantum gates on 200 logical qubits, representing a computational capability requiring the memory of more than 1048 classical supercomputers to simulate. IBM's approach relies on quantum low-density parity check (qLDPC) codes and bivariate bicycle codes to minimize the physical qubit overhead required for fault tolerance.[15]

Quantinuum has announced an accelerated roadmap to achieve universal fault-tolerant quantum computing by 2029–2030, building on their recent breakthroughs in implementing both Clifford and non-Clifford gates fault-tolerantly. Their trapped-ion architecture has demonstrated the industry's highest quantum volumes and longest coherence times, positioning them as a leading contender for early fault-tolerant systems. Other companies, including Google, are pursuing alternative approaches such as surface code implementations and novel qubit architectures to achieve similar timelines.[39][40]

Independent analysis suggests that practical quantum applications may emerge around 2035–2040, assuming continued exponential growth in quantum hardware capabilities.[41] However, these projections depend critically on simultaneous advances across multiple technical domains, including qubit hardware, control systems, error correction algorithms, and quantum software stacks. The transition from NISQ to fault-tolerant quantum computing represents one of the most significant technological challenges in modern physics and engineering, requiring sustained international collaboration and investment to realize its transformative potential.[42][43]

## See also

* 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

1. ↑ 1.0 1.1 "Engineers demonstrate a quantum advantage" (in en). https://www.sciencedaily.com/releases/2021/06/210601155610.htm.
2. ↑ 2.0 2.1 "What is Quantum Computing?" (in en-US). 28 June 2021. https://www.techspot.com/article/2280-what-is-quantum-computing/.
3. ↑ "Quantum Computing Scientists: Give Them Lemons, They'll Make Lemonade" (in en). http://www.aps.org/publications/apsnews/201905/quantum.cfm.
4. ↑ 4.0 4.1 4.2 4.3 Brooks, Michael (2019-10-03). "Beyond quantum supremacy: the hunt for useful quantum computers" (in en). Nature 574 (7776): 19–21. doi:10.1038/d41586-019-02936-3. ISSN 0028-0836. PMID 31578489. Bibcode: 2019Natur.574...19B.
5. ↑ "Quantum computers in 2023: how they work, what they do, and where they're heading" (in en). 19 October 2023. https://theconversation.com/quantum-computers-in-2023-how-they-work-what-they-do-and-where-theyre-heading-215804.
6. ↑ 6.0 6.1 Preskill, John (2018-08-06). "Quantum Computing in the NISQ era and beyond" (in en-GB). Quantum 2. doi:10.22331/q-2018-08-06-79. Bibcode: 2018Quant...2...79P. https://quantum-journal.org/papers/q-2018-08-06-79/. Retrieved 2021-06-29.
7. ↑ Matt Swayne (November 2023). "Microsoft Quantum's Krysta Svore Offers Glimpse Into The Quantum Future" (in en-US). https://thequantuminsider.com/2023/11/01/microsoft-quantums-krysta-svore-offers-glimpse-into-the-quantum-future/.
8. ↑ "Azure Quantum | Quantum Computing Implementation Levels". https://quantum.microsoft.com/en-us/explore/concepts/quantum-computing-implementation-levels.
9. ↑ Alex Wilkins. "Record-breaking quantum computer has more than 1000 qubits" (in en-US). https://www.newscientist.com/article/2399246-record-breaking-quantum-computer-has-more-than-1000-qubits/.
10. ↑ Karmela Padavic-Callaghan. "IBM's 'Condor' quantum computer has more than 1000 qubits" (in en-US). https://www.newscientist.com/article/2405789-ibms-condor-quantum-computer-has-more-than-1000-qubits/.
11. ↑ "Quantum computers are already detangling nature's mysteries" (in en-GB). Wired UK. ISSN 1357-0978. https://www.wired.co.uk/article/quantum-computing. Retrieved 2021-06-29.
12. ↑ Ritter, Mark B. (2019). "Near-term Quantum Algorithms for Quantum Many-body Systems". Journal of Physics: Conference Series 1290 (1). doi:10.1088/1742-6596/1290/1/012003. ISSN 1742-6588. Bibcode: 2019JPhCS1290a2003R.
13. ↑ 13.0 13.1 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. doi:10.1103/RevModPhys.95.045005. Bibcode: 2023RvMP...95d5005C. https://journals.aps.org/rmp/abstract/10.1103/RevModPhys.95.045005.
14. ↑ González-García, Guillermo; Trivedi, Rahul; Cirac, J. Ignacio (2022-12-05). "Error Propagation in NISQ Devices for Solving Classical Optimization Problems". PRX Quantum 3 (4). doi:10.1103/PRXQuantum.3.040326. Bibcode: 2022PRXQ....3d0326G. https://link.aps.org/doi/10.1103/PRXQuantum.3.040326.
15. ↑ 15.0 15.1 "IBM lays out clear path to fault-tolerant quantum computing | IBM Quantum Computing Blog" (in en). https://www.ibm.com/quantum/blog/large-scale-ftqc.
16. ↑ Tilly, Jules; Chen, Hongxiang; Cao, Shuxiang; Picozzi, Dario; Setia, Kanav; Li, Ying; Grant, Edward; Wossnig, Leonard et al. (2022-08-25), "The Variational Quantum Eigensolver: A review of methods and best practices", Physics Reports 986: 1–128, doi:10.1016/j.physrep.2022.08.003, Bibcode: 2022PhR...986....1T
17. ↑ 17.0 17.1 Tilly, Jules; Chen, Hongxiang; Cao, Shuxiang; Picozzi, Dario; Setia, Kanav; Li, Ying; Grant, Edward; Wossnig, Leonard et al. (2022-08-25), "The Variational Quantum Eigensolver: A review of methods and best practices", Physics Reports 986: 1–128, doi:10.1016/j.physrep.2022.08.003, Bibcode: 2022PhR...986....1T
18. ↑ 18.0 18.1 Lim, Hocheol; Kang, Doo Hyung; Kim, Jeonghoon; Pellow-Jarman, Aidan; McFarthing, Shane; Pellow-Jarman, Rowan; Jeon, Hyeon-Nae; Oh, Byungdu et al. (2024-01-29). "Fragment molecular orbital-based variational quantum eigensolver for quantum chemistry in the age of quantum computing" (in en). Scientific Reports 14 (1): 2422. doi:10.1038/s41598-024-52926-3. ISSN 2045-2322. PMID 38287087. Bibcode: 2024NatSR..14.2422L.
19. ↑ "Hybrid Quantum Algorithms for Quantum Monte Carlo" (in en). https://research.google/blog/hybrid-quantum-algorithms-for-quantum-monte-carlo/.
20. ↑ Fedorov, Dmitry A.; Peng, Bo; Govind, Niranjan; Alexeev, Yuri (2022-01-06). "VQE method: a short survey and recent developments". Materials Theory 6 (1): 2. doi:10.1186/s41313-021-00032-6. ISSN 2509-8012. Bibcode: 2022MatTh...6....2F.
21. ↑ "Quantum Computing For Quantum Chemistry Simulating Molecular Reactions" (in en-US). 2024-09-01. https://quantumzeitgeist.com/quantum-computing-for-quantum-chemistry-simulating-molecular-reactions/.
22. ↑ Sturm, Andreas (2023-01-23). "Theory and Implementation of the Quantum Approximate Optimization Algorithm: A Comprehensible Introduction and Case Study Using Qiskit and IBM Quantum Computers". arXiv:2301.09535 [quant-ph].
23. ↑ Ceroni, Jack (2020-11-18). "Intro to QAOA" (in en). PennyLane Demos. https://pennylane.ai/qml/demos/tutorial_qaoa_intro.
24. ↑ Zhou, Leo; Wang, Sheng-Tao; Choi, Soonwon; Pichler, Hannes; Lukin, Mikhail D. (2020-06-24). "Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices". Physical Review X 10 (2). doi:10.1103/PhysRevX.10.021067. Bibcode: 2020PhRvX..10b1067Z. https://link.aps.org/doi/10.1103/PhysRevX.10.021067.
25. ↑ Zhou, Leo; Wang, Sheng-Tao; Choi, Soonwon; Pichler, Hannes; Lukin, Mikhail D. (2019-11-09), "Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices", Physical Review X 10 (2), doi:10.1103/PhysRevX.10.021067, Bibcode: 2020PhRvX..10b1067Z
26. ↑ Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam; Zhou, Leo (2019). "The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size" (in en). Quantum 6. doi:10.22331/q-2022-07-07-759.
27. ↑ He, Zichang; Amaro, David; Shaydulin, Ruslan; Pistoia, Marco (2025-05-24). "Performance of quantum approximate optimization with quantum error detection" (in en). Communications Physics 8 (1): 217. doi:10.1038/s42005-025-02136-8. ISSN 2399-3650. Bibcode: 2025CmPhy...8..217H. https://www.nature.com/articles/s42005-025-02136-8.
28. ↑ He, Zichang; Amaro, David; Shaydulin, Ruslan; Pistoia, Marco (2025-05-23), "Performance of quantum approximate optimization with quantum error detection", Communications Physics 8 (1), doi:10.1038/s42005-025-02136-8, Bibcode: 2025CmPhy...8..217H
29. ↑ Suzuki, Yasunari; Endo, Suguru; Fujii, Keisuke; Tokunaga, Yuuki (2022-03-18). "Quantum Error Mitigation as a Universal Error Reduction Technique: Applications from the NISQ to the Fault-Tolerant Quantum Computing Eras". PRX Quantum 3 (1). doi:10.1103/PRXQuantum.3.010345. Bibcode: 2022PRXQ....3a0345S. https://link.aps.org/doi/10.1103/PRXQuantum.3.010345.
30. ↑ 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". Reviews of Modern Physics 95 (4). doi:10.1103/RevModPhys.95.045005. Bibcode: 2023RvMP...95d5005C. https://link.aps.org/doi/10.1103/RevModPhys.95.045005.
31. ↑ Giurgica-Tiron, Tudor; Hindy, Yousef; LaRose, Ryan; Mari, Andrea; Zeng, William J. (2021-01-14), "Digital zero noise extrapolation for quantum error mitigation", 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 306–316, doi:10.1109/QCE49297.2020.00045, ISBN 978-1-7281-8969-7
32. ↑ Jin, Tian-Ren; Shi, Yun-Hao; Wang, Zheng-An; Li, Tian-Ming; Xu, Kai; Fan, Heng (2024). "Purity-Assisted Zero-Noise Extrapolation for Quantum Error Mitigation" (in en). Advanced Quantum Technologies 7 (12). doi:10.1002/qute.202400150.
33. ↑ Cai, Zhenyu (2021). "Quantum Error Mitigation using Symmetry Expansion" (in en). Quantum 5. doi:10.22331/q-2021-09-21-548. Bibcode: 2021Quant...5..548C.
34. ↑ Pelofske, Elijah; Russo, Vincent; Larose, Ryan; Mari, Andrea; Strano, Dan; Bärtschi, Andreas; Eidenbenz, Stephan; Zeng, William (2024-09-19). "Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation". ACM Transactions on Quantum Computing 5 (3): 21:1–21:18. doi:10.1145/3680290. https://dl.acm.org/doi/10.1145/3680290.
35. ↑ Chen, Sitan; Cotler, Jordan; Huang, Hsin-Yuan; Li, Jerry (2023-09-26). "The complexity of NISQ" (in en). Nature Communications 14 (1): 6001. doi:10.1038/s41467-023-41217-6. ISSN 2041-1723. PMID 37752125. Bibcode: 2023NatCo..14.6001C.
36. ↑ Chen, Sitan; Cotler, Jordan; Huang, Hsin-Yuan; Li, Jerry (2022-10-13), "The Complexity of NISQ", Nature Communications 14 (1), doi:10.1038/s41467-023-41217-6, PMID 37752125, Bibcode: 2023NatCo..14.6001C
37. ↑ O'Gorman, Joe; Campbell, Earl T. (2017-03-31). "Quantum computation with realistic magic-state factories" (in en). Physical Review A 95 (3). doi:10.1103/PhysRevA.95.032338. ISSN 2469-9926. Bibcode: 2017PhRvA..95c2338O.
38. ↑ Maria Korolov. "What Microsoft's error-correction milestone means for usable quantum computing" (in en-US). https://www.networkworld.com/article/2085751/what-microsofts-error-correction-milestone-means-for-usable-quantum-computing.html.
39. ↑ "Quantinuum Overcomes Last Major Hurdle to Deliver Scalable Universal Fault-Tolerant Quantum Computers by 2029" (in en). https://www.quantinuum.com/blog/quantinuum-overcomes-last-major-hurdle-to-deliver-scalable-universal-fault-tolerant-quantum-computers-by-2029.
40. ↑ Acharya, Rajeev; Abanin, Dmitry A.; Aghababaie-Beni, Laleh; Aleiner, Igor; Andersen, Trond I.; Ansmann, Markus; Arute, Frank; Arya, Kunal et al. (February 2025). "Quantum error correction below the surface code threshold" (in en). Nature 638 (8052): 920–926. doi:10.1038/s41586-024-08449-y. ISSN 1476-4687. PMID 39653125. Bibcode: 2025Natur.638..920G.
41. ↑ "Roadmap" (in en). https://www.quandela.com/technology/roadmap/.
42. ↑ Cheng, Bin; Deng, Xiu-Hao; Gu, Xiu; He, Yu; Hu, Guangchong; Huang, Peihao; Li, Jun; Lin, Ben-Chuan et al. (2023-03-07), "Noisy intermediate-scale quantum computers", Frontiers of Physics 18 (2), doi:10.1007/s11467-022-1249-z, Bibcode: 2023FrPhy..1821308C
43. ↑ John, Preskill (2018). "Quantum Computing in the NISQ era and beyond". Quantum 2. doi:10.22331/q-2018-08-06-79. Bibcode: 2018Quant...2...79P. https://quantum-journal.org/papers/q-2018-08-06-79/. Retrieved 2021-06-29.

## External links

* John Preskill lecture on NISQ era

* v
* t
* e

Quantum information science

General|

* Quantum computing
* Qubit
* physical vs. logical
* DiVincenzo's criteria
* Quantum information
* Quantum programming
* Quantum processors
* Cloud-based quantum computing
* Timeline of quantum computing

Theorems|

* Bell's theorem
* Gleason's theorem
* Gottesman–Knill theorem
* Holevo's theorem
* Margolus–Levitin theorem
* No-broadcast theorem
* No-cloning theorem
* No-communication theorem
* No-deleting theorem
* No-hiding theorem
* No-teleportation theorem
* PBR theorem
* Quantum threshold theorem

Quantum
communication|

* Quantum capacity
* Classical capacity
* Entanglement-assisted classical capacity
* Quantum channel
* Quantum network
* Quantum cryptography
* Quantum key distribution
* BB84
* SARG04
* Three-stage quantum cryptography protocol
* Quantum teleportation
* Superdense coding
* LOCC
* Entanglement distillation

Quantum algorithms|

* Universal quantum simulator
* Deutsch–Jozsa algorithm
* Grover's algorithm
* Quantum Fourier transform
* Shor's algorithm
* Simon's problem
* Quantum phase estimation algorithm
* Quantum counting algorithm
* Quantum annealing
* Quantum algorithm for linear systems of equations
* Amplitude amplification

Quantum
complexity theory|

* Quantum Turing machine
* EQP
* BQP
* QMA
* PostBQP
* QIP

Quantum
computing models|

* Quantum circuit
* Quantum logic gate
* One-way quantum computer
* cluster state
* Adiabatic quantum computation
* Topological quantum computer

Quantum
error correction|

* Stabilizer codes
* Entanglement-Assisted Quantum Error Correction
* Shor code
* Steane code
* CSS code
* Quantum convolutional codes
* Toric code

Physical
implementations|

| Quantum optics|

* Cavity QED
* Circuit QED
* Linear optical quantum computing
* KLM protocol
* Boson sampling

|

Ultracold atoms|

* Trapped ion quantum computer
* Optical lattice

Spin-based|

* Nuclear magnetic resonance QC
* Kane QC
* Loss–DiVincenzo QC
* Nitrogen-vacancy center

Superconducting
quantum computing|

* Charge qubit
* Flux qubit
* Phase qubit
* Transmon

Software|

* libquantum
* OpenQASM
* Q#
* Qiskit
* IBM Q Experience

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Noisy intermediate-scale quantum computing. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Noisy_intermediate-scale_quantum_computing&oldid=4296861"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template