Quantum Computing in the NISQ era and beyond
Open accessThe DOI matches its Crossref record; 75 of the 82 references it cites were found in a registry or an index; 25 of the 40 sources its claims cite were checked for support.
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.
Overview
CoChat Summary
TL;DR
Preskill introduces the NISQ era—noisy intermediate-scale quantum devices with 50–100 qubits—as a near-term step toward quantum computing, useful for exploring many-body quantum physics but limited by noise and not expected to change the world by itself. He argues that fault-tolerant quantum computing remains distant and that near-term applications, especially hybrid quantum-classical algorithms, are promising but unproven.
Key findings
- NISQ devices will have 50 to a few hundred qubits; 50 qubits is a milestone because it is beyond brute-force simulation by the most powerful existing digital supercomputers. However, with two-qubit gate error rates above 0.1%, circuits with many more than about 1000 gates are not expected to be reliable.
- NISQ technology may be useful for exploring many-body quantum physics and quantum dynamics, and hybrid quantum-classical algorithms such as QAOA and VQE may find approximate solutions to optimization problems, but whether they outperform classical methods is an open question.
- Quantum algorithms offer speedups for problems such as factoring, matrix inversion (HHL runs in O(log N)), recommendation systems (O(poly(k)polylog(mn))), and semidefinite programming (polylog(N)), but many require error correction or QRAM and are probably not feasible in the NISQ era. A note added states that Tang’s quantum-inspired classical algorithm removes the exponential speedup claimed for quantum recommendation systems.
- Fault-tolerant quantum computing is still distant: running algorithms with thousands of protected qubits will require millions of physical qubits, so NISQ should be regarded as a step toward more powerful future quantum technologies.
Methods
- This is a conceptual review and keynote address, based on a Keynote Address at Quantum Computing for Business, 5 December 2017; it is not an empirical study.
- The paper assesses the current status and future potential of quantum computing, discussing hardware platforms, gate errors, qubit counts, quantum algorithms, and fault-tolerance requirements.
- The main analysis is a qualitative synthesis of theoretical arguments, experimental examples, and open questions; no dataset, sample, or statistical analysis is reported.
Limitations
- The paper states it is “the result of an uneasy compromise,” minimizes jargon and technical details for a broader audience, and does not attempt a comprehensive list of references.
- The paper states that NISQ devices have imperfect control and noise, that gate error rates are above 0.1% and may not be maintained in larger devices, that circuit size is limited to roughly 1000 gates, and that validating quantum outputs may be hard.
- Evident from the text: as a keynote-style review, it offers projections and opinions rather than new experimental data or a systematic review; several speedup claims are explicitly open questions, and the recommendation-systems speedup is later undercut by a quantum-inspired classical algorithm.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 Valid · 9 Not valid · 10 Not checked · 85 Own results and interpretations
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“50 qubits is a significant milestone, because that's beyond what can be simulated by brute force using the most powerful existing digital supercomputers.”
What the sources say
- Supportedcites [11] [11] S. Boixo, S. V. Isakov, V. N. Smelyansky, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14, 595-600 (2018), arXiv:1608.00263 (2016), https://doi.org/10.1038/s41567-018-0124-x. - source
The Introduction (p. 1) says that even modest-depth circuits acting on approximately fifty qubits cannot be directly simulated in practice. The Conclusion (p. 12) estimates that state-of-the-art supercomputers fail to simulate universal random circuits beyond approximately 48 qubits at a depth of about 40. The milestone claim is supported in that circuit context. (LLM, conf=0.90)
- Disputedcites [12] [12] S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, arXiv:1612.05903 (2017). - sourceExperimental — accuracy not yet measured
Section 1.2 (p. 4) describes 40–50 qubits as a range where classical simulation is difficult but not impossible, contrary to the claim that 50 qubits is beyond brute-force simulation. Section 1.3 (p. 7) also describes a classical simulation method and says its 2^n time is reasonable for a planned setup with roughly 40 or 50 qubits. (LLM, conf=0.86)
Checked by a reasoning model — may be wrong.
- Supportedcites [13] [13] E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, and R. Wisnieff, Breaking the 49-qubit barrier in the simulation of quantum circuits, arXiv:1710.05867 (2017). - source
The Abstract (p. 1) frames systems of more than 50 qubits as the coming regime and states that 'resource requirements for such calculations on classical computers grow exponentially', with the relevant calculations 'thought to be impossible due to resource requirements'. Section 2.1 (p. 3) gives the concrete brute-force bound: the full state of a 49-qubit system needs 2^49 complex numbers (8 PB in double precision), which 'eliminates the possibility of keeping the entire state in primary storage', and the Feynman-path alternative 'grows to intractable levels very quickly'. The Introduction (p. 2) reinforces this by noting that the state-of-the-art full-state techniques of the time would have required 8 PB (49 qubits) and 1 EB (56 qubits), far beyond the ~64 TB aggregate RAM of Vulcan/Sequoia-class machines. The citing sentence's 'brute force' qualifier matches the paper's own contrast with tensor-contraction-deferral methods, so the attribution holds; only the rhetorical label 'significant milestone' is the citing authors' framing. (LLM, conf=0.83)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Eventually we expect to be able to protect quantum systems and scale up quantum computers using the principle of quantum error correction [10].”
What the sources say
- Supportedcites [10] [10] D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, Proceedings of Symposia in Applied Matthematics 68 (2010), arXiv:0904.2557. - source
The Background (p. 1) says quantum computers need protection from noise and identifies error correction as necessary. Fault-tolerant gates (p. 17) explains that, below an error-rate threshold, arbitrarily accurate quantum computation is possible with polylogarithmic overhead. This supports the expectation of protecting quantum systems and scaling up quantum computers, subject to that threshold. (LLM, conf=0.91)
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“as of now we don't have a convincing theoretical argument or persuasive experimental evidence indicating that quantum annealers can really speed up the time to solution compared to the best classical hardware running the best algorithms for the same problems [28, 29].”
What the sources say
- Partly supportedcites [28] [28] T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup, Science 345, 420-424 (2014), https://doi.org/10.1126/science.1252319. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
- Partly supportedcites [29] [29] S. Mandrà, H. G. Katzgraber, and C. Thomas, The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again), Quantum Sci. Technol. 2, 038501 (2017), arXiv:1703.00622, https://doi.org/10.1088/2058-9565/aa7877. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“In particular, the task of matrix inversion admits an exponential quantum speedup, which could have many applications.”
What the sources say
- Supportedcites [40] [40] A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009), arXiv:0811.3171, https://doi.org/10.1103/PhysRevLett.103.150502. - source
The paper’s Outline says its hardness results imply that the algorithm runs exponentially faster than any classical algorithm for the matrix-inversion task. The performance discussion qualifies this speedup: it is greatest when the condition number and inverse accuracy are polylogarithmic in matrix size, and the algorithm outputs a quantum representation rather than every component of the solution. (LLM, conf=0.92)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“As Laughlin and Pines [8] emphasized in the statement I quoted earlier, we think that simulating such 'strongly correlated' matter is a difficult computational problem, because many very good physicists have tried to solve it for decades and have not succeeded.”
What the sources say
- Supportedcites [8] [8] R. B. Laughlin and D. Pines, The theory of everything, PNAS 97, 28-31 (2000), https://doi.org/10.1073/pnas.97.1.28. - source
In the paper’s main text (page not supplied), Laughlin and Pines say accurate solutions become infeasible for more than about 10 particles because the computational requirements grow rapidly. They also describe notorious failures of approximate calculations for high-temperature superconductors, supporting the claim that simulating such matter is difficult. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
37 more claims · 4 with their cited sources checked
Create a free account to see all 118 claims and to verify the 5 references still open.
- It may state two separate claims as one. 26
- Probably not a substantial claim. 63
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“so-called Noisy Intermediate-Scale Quantum (NISQ) computers already exist today”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [209]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Furthermore, they are challenging to make extensible as required to surpass noisy intermediate-scale quantum (NISQ)-era scales [221] and thereby enable practically relevant quantum computation.”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [221]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Therefore, research on quantum algorithms splits, on the one hand, into algorithms for fault-tolerant quantum computers, which we may think of as a future perfect quantum computer, and, on the other hand, into algorithms for nearterm or noisy-intermediate stage quantum (NISQ) [120] devices of dozens to thousands of physical qubits, that are characterized by the absence of complete fault-tolerance.”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [120]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations within a limited coherence time.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Preskill, 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These hybrid quantum-classical algorithms are specifically designed to minimize the limitations of current quantum hardware, such as decoherence and gate errors, by delegating some computational tasks to classical processors. [8]”
From Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE (2026) · cites this paper as [8]
Experimental — accuracy not yet measured
10 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 2 Opportunities at the entanglement frontier · p. 2
“We don't think that's not true for classical ( i.e. , nonquantum) digital computers”
§ 2 Opportunities at the entanglement frontier · p. 2
“which (as far as we know) can't simulate highly entangled quantum systems.”
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“to be hard for classical computers, but for which quantum algorithmshavebeendiscoveredthatcouldsolvetheseproblemseasily. Thebestknown exampleistheproblemoffindingtheprimefactorsofalargecompositeinteger[1]. Webelievefactoringishardbecausemanysmartpeoplehavetriedformanydecades to find better factoring algorithms and haven…”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779 · cited 1×
“” Much of the literature on the subject builds on quantum algorithms that speed up linear algebra and related tasks [37, 38], and I’ll address such applications in the ensuing subsections.”
BackgroundA variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045 · cited 1×
“antum sensing. Quantum technology has advantages for some kinds of sensing. Quantum systems can sense weak forces with better sensitivity and higher spatial resolution than other sensing technologies [19]; thus quantum sensing could have relatively near-term high-impact applications, to medicine for example. Quantum c…”
BackgroundPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“6.6 Quantummatrixinversion QRAMhasfurtherimplicationsforquantumalgorithms. Inparticular,thetaskofmatrix inversionadmitsanexponentialquantumspeedup,whichcouldhavemanyapplications. ThealgorithmwecallHHL[40](afterthethreeauthorswhofirstdiscusseditnineyears ago) takes as input a succinct representation of a very large N×N…”
BackgroundInfluentialSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“for a while, because of the large number of physical qubits needed. To run algorithms involving thousands of protected qubits we’ll need a number of physical qubits which is in the millions, or more [50]. That’s a very large leap from where we will be for the next few years, with of order a hundred qubits. Crossing th…”
BackgroundProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460 · cited 1×
“Analog quantum simulators have been getting notably more sophisticated, and are already being employed to study quantum dynamics in regimes which may be beyond the reach of classical simulators [51, 52].”
Background
Cited by
Items 4,601–4,700 of 8,640
Prototype of a Batched Quantum Circuit Simulator for the Vector Engine
Takahashi, K., Mōri, T., & Takizawa, H. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3624062.3624226 · Cited by 4
Resource Estimation of Quantum Multiplication Algorithms
Hansen, E., Joshi, S., & Rarick, H. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10211 · Cited by 8
Higher-Order Topological Kernels via Quantum Computation
Incudini, M., Martini, F., & Pierro, A. D. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00076 · Cited by 7
Artificial Intelligence and Nanotechnology: Transforming the Future
Jaber, W. (2023) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-0368-9.ch001 · Cited by 5
Enhancing qubit readout with Bayesian learning
Cosco, F., & Gullo, N. L. (2023) · Physical Review A · doi:10.1103/physreva.108.l060402 · Cited by 6
Cross-platform comparison of arbitrary quantum processes
Zheng, C., Yu, X., & Wang, K. (2024) · npj Quantum Information · doi:10.1038/s41534-023-00797-3 · Cited by 12
Murta, B., & Fernández-Rossier, J. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.035128 · Cited by 8
Investigating a Quantum Cloud Paradigm with Quantum Neural Networks
Yarter, M., Uehara, G. S., & Spanias, A. (2023) · IEEE International Midwest Symposium on Circuits and Systems (MWSCAS) · doi:10.1109/mwscas57524.2023.10406072 · Cited by 5
Yuan, P., & Zhang, S. (2025) · Quantum · doi:10.22331/q-2025-05-28-1757 · Cited by 18
Quantum Poisson solver without arithmetic
Wang, S., Wang, Z., Cui, G., Shi, S., Shang, R., Li, J., Li, W., Wei, Z., & Gu, Y. (2024) · Intelligent Marine Technology and Systems · doi:10.1007/s44295-023-00020-1 · Cited by 6
Embedding memory-efficient stochastic simulators as quantum trajectories
Elliott, T. J., & Gu, M. (2024) · Physical Review A · doi:10.1103/physreva.109.022434 · Cited by 5
Solvent Distribution Effects on Quantum Chemical Calculations with Quantum Computers
Yoshida, Y., Mizukami, W., & Yoshida, N. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c01189 · Cited by 7
Machine Learning in the Quantum Era
Khurana, S., & Nene, M. J. (2023) · International Conference on Futuristic Technologies (INCOFT) · doi:10.1109/incoft60753.2023.10425372 · Cited by 5
Classical to Quantum Transfer Learning Framework for Wireless Sensing Under Domain Shift
Shan, Y., Liao, P., Wang, X., An, L., & Mao, S. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437382 · Cited by 4
Parallelized variational quantum classifier with shallow QRAM circuit
Duan, B., Sun, X., & Hsieh, C. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04295-z · Cited by 6
A general learning scheme for classical and quantum Ising machines
Schmid, L., Zardini, E., & Pastorello, D. (2024) · SciPost Physics Core · doi:10.21468/scipostphyscore.7.1.013 · Cited by 4
JustQ: Automated Deployment of Fair and Accurate Quantum Neural Networks
Wang, R., Yara, F. B., & Chen, F. (2024) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac58780.2024.10473829 · Cited by 5
Comparing planar quantum computing platforms at the quantum speed limit
Basilewitsch, D., Dlaska, C., & Lechner, W. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023026 · Cited by 9
Santos, L. P., Bashford‐Rogers, T., Barbosa, J., & Navrátil, P. (2024) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2024.3386103 · Cited by 16
The sounds of science—a symphony for many instruments and voices: part II
Hooft, G. ’., Phillips, W. D., Zeilinger, A., Allen, R. E., Baggott, J., Bouchet, F. R., Cantanhede, S. M. G., Castanedo, L. A. M., Cetto, A. M., Coley, A. A., et al. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad2abe · Cited by 5
Photonic variational quantum eigensolver using entanglement measurements
Lee, J., Song, W., Lee, D., Kim, Y., Lee, S.-W., Lim, H., Jung, H., Han, S.-W., & Kim, Y. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad6d87 · Cited by 6
Optimizing Variational Quantum Neural Networks Based on Collective Intelligence
Li, Z., Xiao, T., Deng, X., Zeng, G., & Li, W. (2024) · Mathematics · doi:10.3390/math12111627 · Cited by 9
Model-Driven Engineering for Quantum Programming: A Case Study on Ground State Energy Calculation
Polat, F., Tuncer, H., Moin, A., & Challenger, M. (2024) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac61105.2024.00378 · Cited by 7
Multi-party semi-quantum secret sharing protocol based on measure-flip and reflect operations
Li, J., & Ye, C. (2024) · Laser Physics Letters · doi:10.1088/1612-202x/ad4eb6 · Cited by 4
Improving the full quantum eigensolver with exponentiated operators
Wang, B., Wen, J., Wu, J., Xie, H., Yang, F., Ruan, D., Wei, S., & Long, G. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.245117 · Cited by 6
Phase transitions induced by standard and feedback measurements in transmon arrays
Martín-Vázquez, G., Tolppanen, T., & Silveri, M. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.214308 · Cited by 7
Quantifying subspace entanglement with geometric measures
Zhu, X., Zhang, C., & Zeng, B. (2024) · Physical Review A · doi:10.1103/physreva.110.012452 · Cited by 10
Using Quantum Computers In Control: Interval Matrix Properties
Schneider, J., & Berberich, J. (2024) · European Control Conference (ECC) · doi:10.23919/ecc64448.2024.10591197 · Cited by 4
Approximate Relational Reasoning for Quantum Programs
Yan, P., Jiang, H., & Yu, N. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-65633-0_22 · Cited by 8
Pulse-based variational quantum optimization and metalearning in superconducting circuits
Wang, Y., Ding, Y., Cárdenas-López, F. A., & Chen, X. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.024009 · Cited by 9
Non-iterative disentangled unitary coupled-cluster based on lie-algebraic structure
Haidar, M., Adjoua, O., Badreddine, S., Peruzzo, A., & Piquemal, J. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb3c5 · Cited by 12
Optimal quantum circuit generation for pixel segmentation in multiband images
Altares-López, S., García‐Ripoll, J. J., & Ribeiro, Á. (2024) · Applied Soft Computing · doi:10.1016/j.asoc.2024.112175 · Cited by 6
Solving the homogeneous Bethe-Salpeter equation with a quantum annealer
Fornetti, F., Gnech, A., Frederico, T., Pederiva, F., Rinaldi, M., Roggero, A., Salmè, G., Scopetta, S., & Viviani, M. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.110.056012 · Cited by 4
Overview of Digital Quantum Simulator: Applications and Comparison with Latest Methods
Tang, H., Simancas-García, J. L., Mai, J., Cheng, M., Iqbal, I., & Por, L. Y. (2024) · SPIN · doi:10.1142/s2010324724400046 · Cited by 4
Time Crystals from Single-Molecule Magnet Arrays
Sarkar, S., & Dubi, Y. (2024) · ACS Nano · doi:10.1021/acsnano.4c05817 · Cited by 4
Recompiling QAOA Circuits on Various Rotational Directions
Jang, E., Ha, D., Choi, S., Kim, Y., Kwon, J., Lee, Y., Ahn, S., Kim, H. J., & Ro, W. W. (2024) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1145/3656019.3676899 · Cited by 8
Automated Reasoning in Quantum Circuit Compilation
Thanos, D., Villoria, A., Brand, S., Quist, A.-J., Mei, J., Coopmans, T. J., & Laarman, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-66149-5_6 · Cited by 14
Pulse family optimization for parameterized quantum gates using spectral clustering
de Keijzer, R., Snijders, J., Carvalho, A. R. R., & Kokkelmans, S. J. J. M. F. (2024) · Academia quantum. · doi:10.20935/acadquant7374 · Cited by 8
Intelligent Generative Models for Quantum Neural Networks
Ding, X., Xiong, Q., Xu, J., Liu, F., Qiu, J., Zhu, Y., Hou, Y., & Shan, Z. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400178 · Cited by 5
Invited: Leveraging Machine Learning for Quantum Compilation Optimization
Ren, X., Zhang, T., Xu, X., Zheng, Y.-C., & Zhang, S. (2024) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3649329.3663510 · Cited by 17
A quantum neural network for sequential data analysis in machine learning
Nguyen, P.-N. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00223-7 · Cited by 5
Coherent feed-forward quantum neural network
Singh, U., Goldberg, A. Z., & Heshami, K. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00222-8 · Cited by 14
Seo, H., & Kim, Y. (2024) · Proceedings - International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems · doi:10.1109/mascots64422.2024.10786505 · Cited by 4
Purification of noisy measurements and faithful distillation of entanglement
Kim, J., Yun, J., & Bae, J. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ada0fa · Cited by 11
Experimental computations of atomic properties on a superconducting quantum processor
Singh, A. P., Sugisaki, K., Prasannaa, V. S., Sahoo, B. K., Das, B. P., & Nakamura, Y. (2024) · Physical Review A · doi:10.1103/physreva.110.062620 · Cited by 6
Quantum Machine Learning for Invasive Ductal Carcinoma Classification using Quantum Kernels
Dhanalakshmi, K., & Nagarajan, G. (2024) · International Conference on Data Intelligence and Cognitive Informatics (ICDICI) · doi:10.1109/icdici62993.2024.10810956 · Cited by 5
Hybrid Quantum-Classical Computing in Federated Learning With Data Heterogeneity
Hisamori, K., Chiang, Y.-H., Lin, H. F., & Ji, Y. (2024) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc59610.2024.10817181 · Cited by 9
Quantum Computing: Challenges and Future Directions
Ayyamgari, S., Thumma, B. Y. R., Tumma, C., & Azmeera, R. (2023) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-14000v · Cited by 12
Hamiltonian-Based Quantum Reinforcement Learning for Neural Combinatorial Optimization
Kruse, G., Coelho, R., Roßkopf, A., Wille, R., & Lorenz, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00189 · Cited by 7
Entanglement-enhanced Quantum Reinforcement Learning: an Application using Single-Photons
Gaspar, J. M., Bergerault, A., Apostolou, V., & Ricou, A. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10301 · Cited by 7
Hardware-efficient preparation of architecture-specific graph states on near-term quantum computers
Brandhofer, S., Polian, I., Barz, S., & Bhatti, D. (2025) · Scientific Reports · doi:10.1038/s41598-024-82715-x · Cited by 7
Robustness of diabatic enhancement in quantum annealing
Feinstein, N., Shalashilin, I., Bose, S., & Warburton, P. A. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adab14 · Cited by 12
Code generation for classical-quantum software systems modeled in UML
Jiménez-Navajas, L., Pérez‐Castillo, R., & Piattini, M. G. (2025) · Software & Systems Modeling · doi:10.1007/s10270-024-01259-w · Cited by 11
Noise-tolerant Grover's algorithm via success-probability prediction
Leng, J., Yang, F., & Wang, X. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.l012017 · Cited by 9
Digital quantum simulation of cosmological particle creation with IBM quantum computers
Maceda, M., & Sabín, C. (2025) · Scientific Reports · doi:10.1038/s41598-025-87015-6 · Cited by 12
Oh, S., Roh, J., Park, H., Lee, D., Joo, C., Park, J., Moon, I., Ro, I., & Kim, J. (2025) · ACS Sustainable Chemistry & Engineering · doi:10.1021/acssuschemeng.4c08534 · Cited by 4
A community detection-based parallel algorithm for quantum circuit simulation using tensor networks
Pastor, A. M., Badía, J. M., & Castillo, M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-06918-3 · Cited by 4
Finding quantum codes via Riemannian optimization
Casanova, M., Ohki, K., & Ticozzi, F. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb3c6 · Cited by 7
Parallel circuit implementation of variational quantum algorithms
Cattelan, M., Yarkoni, S., & Lechner, W. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00982-6 · Cited by 18
Sandanamudi, P. K., Agrawal, N., Tripathi, N., & N, P. K. B. (2025) · International Conference on Communication Systems & Networks (COMSNETS) · doi:10.1109/comsnets63942.2025.10885608 · Cited by 6
Gupta, D., Budhiraja, I., & Mazumdar, B. D. (2025) · Ad Hoc Networks · doi:10.1016/j.adhoc.2025.103802 · Cited by 5
Berberich, J., Kosut, R. L., & Schulte‐Herbrüggen, T. (2024) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc56724.2024.10886787 · Cited by 8
Maiti, S., Banerjee, D., Chakraborty, B., & Huffman, E. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013283 · Cited by 11
Imaginary Hamiltonian variational Ansatz for combinatorial optimization problems
Wang, X., Chai, Y., Feng, X., Guo, Y., Jansen, K., & Tüysüz, C. (2025) · Physical Review A · doi:10.1103/physreva.111.032612 · Cited by 16
Simulating open quantum systems with molecular spin qudits
Roca-Jerat, S., Macaluso, E., Chiesa, A., Santini, P. M., & Carretta, S. (2025) · Materials Horizons · doi:10.1039/d4mh01512f · Cited by 4
Collective preparation of large quantum registers with high fidelity
Buffoni, L., & Campisi, M. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/adc3bb · Cited by 2
Q‐fid: Quantum Circuit Fidelity Improvement with LSTM Networks
Mao, Y., Shresthamali, S., & Kondo, M. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500022 · Cited by 12
Nonlinear-response theory for lossy superconducting quantum circuits
Vadimov, V., Xu, M., Stockburger, J. T., Ankerhold, J., & Möttönen, M. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013317 · Cited by 8
Quantum computing for molecular vibrational energies: A comprehensive study
Somasundaram, R., Jayaharish, R., Ramanan, R., & Chowdhury, C. (2025) · Materials Today Quantum · doi:10.1016/j.mtquan.2025.100031 · Cited by 7
Cheng, L.-X., & Zhang, D.-B. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130516 · Cited by 9
Quantum correlations in general qubit–qudit axially symmetric states
Haddadi, S., Kuznetsova, E. I., & Yurischev, M. A. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04719-4 · Cited by 6
Majsak, J., McNulty, D., & Oszmaniec, M. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00957-7 · Cited by 15
Approximate inverse measurement channel for shallow shadows
Cioli, R., Ercolessi, E., Ippoliti, M., Turkeshi, X., & Piroli, L. (2025) · Quantum · doi:10.22331/q-2025-04-08-1698 · Cited by 14
Quasi-Perfect state transfer in spin chains via parametrization of on-site energies
Bezaz, F., Nelmes, C. C., Estarellas, M. P., Spiller, T. P., & D’Amico, I. (2025) · Physica Scripta · doi:10.1088/1402-4896/adcb71 · Cited by 10
Li, Z., Seidel, T., Leib, D., Bortz, M., & Heese, R. (2025) · Journal of Heuristics · doi:10.1007/s10732-025-09556-3 · Cited by 5
Probing Many-Body Bell Correlation Depth with Superconducting Qubits
Wang, K., Li, W., Xu, S., Hu, M., Chen, J., Wu, Y., Zhang, C., Jin, F., Zhu, X., Gao, Y. Q., et al. (2025) · Physical Review X · doi:10.1103/physrevx.15.021024 · Cited by 23
An Empirical Study on Self-Admitted Technical Debt in Quantum Software
Ishimoto, Y., Nakamura, Y., Katsube, R., Sato, N., Ogawa, H., Kondo, M., Kamei, Y., & Ubayashi, N. (2024) · Asia-Pacific Software Engineering Conference (APSEC) · doi:10.1109/apsec65559.2024.00015 · Cited by 9
Quantum Computing and Nanotechnology
Nayak, M., & Moharana, S. K. (2025) · Information systems engineering and management · doi:10.1007/978-3-031-77296-2_9 · Cited by 10
Quantum Computer Simulation of Molecules in Optical Cavity
Sheng, Z., Ge, Y., Chen, J., Li, W., & Shuai, Z. (2025) · Precision Chemistry · doi:10.1021/prechem.4c00108 · Cited by 6
Geodesic algorithm for unitary gate design with time-independent Hamiltonians
Lewis, D., Wiersema, R., Carrasquilla, J., & Bose, S. (2025) · Physical Review A · doi:10.1103/physreva.111.052618 · Cited by 15
QuForge: A library for qudits simulation
Farias, T. D. S., Friedrich, L., & Maziero, J. (2025) · Computer Physics Communications · doi:10.1016/j.cpc.2025.109687 · Cited by 12
Reducing Quantum Error Correction Overhead With Versatile Flag-Sharing Syndrome Extraction Circuits
Liou, P.-H., & Lai, C. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3572764 · Cited by 9
Towards Robust Benchmarking of Quantum Optimization Algorithms
Bucher, D., Kraus, N., Blenninger, J., Lachner, M., Stein, J., & Linnhoff–Popien, C. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.11030870 · Cited by 16
Unitary-invariant method for witnessing nonstabilizerness in quantum processors
Wagner, R., Peres, F. C. R., Cruzeiro, E. Z., & Galvão, E. F. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ade9ff · Cited by 20
Deep Circuit Compression for Quantum Dynamics via Tensor Networks
Gibbs, J., & Cincio, Ł. (2025) · Quantum · doi:10.22331/q-2025-07-09-1789 · Cited by 36
Warm-start adaptive-bias quantum approximate optimization algorithm
Yu, Y., Wang, X., Shannon, N., & Joynt, R. (2025) · Physical Review A · doi:10.1103/nt3w-j4mj · Cited by 12
Fidelity-Aware Multipath Routing for Multipartite State Distribution in Quantum Networks
Sutcliffe, E., & Beghelli, A. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3588783 · Cited by 11
Suppression of decoherence dynamics by a dissipative bath at strong coupling
Chen, J., Garwoła, J., & Segal, D. (2025) · Physical Review A · doi:10.1103/3d9c-4x2q · Cited by 6
Leveraging commuting groups for an efficient variational Hamiltonian ansatz
Anand, A., & Brown, K. R. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adf507 · Cited by 10
Quantum Artificial Intelligence: Some Strategies and Perspectives
Baioletti, M., Fagiolo, F., Loglisci, C. A. A. M. D., Losavio, V. N., Oddi, A., Rasconi, R., & Gentili, P. L. (2025) · AI · doi:10.3390/ai6080175 · Cited by 10
Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
Steinberg, M., Fan, J., Harris, R. J., Elkouss, D., Feld, S., & Jahn, A. (2025) · Quantum · doi:10.22331/q-2025-08-08-1826 · Cited by 26
Comparison of Two Optimization Methods for a Rydberg Quantum Gate
Bosch, L. S. Y., & Wimberger, S. (2025) · Annals of Physics · doi:10.1002/andp.202500163 · Cited by 3
Kumar, V. (2025) · International Journal of Theoretical Physics · doi:10.1007/s10773-025-06104-4 · Cited by 4
Quantum simulation of the phase transition of the massive Thirring model
Gong, J.-Q., & Yang, J.-C. (2025) · Journal of High Energy Physics · doi:10.1007/jhep09(2025)120 · Cited by 5
Li, Z., Grabowska, D. M., & Savage, M. J. (2025) · Quantum · doi:10.22331/q-2025-09-29-1865 · Cited by 52
Optimal spatial searches with long-range tunneling
King, E. C., Linnebacher, M., Orth, P. P., Rizzi, M., & Morigi, G. (2025) · Physical Review Research · doi:10.1103/cv26-dk1q · Cited by 12
Behrends, J., & Béri, B. (2025) · PRX Quantum · doi:10.1103/gskb-t5ql · Cited by 30
Switzer, E. D., Gálvez, J. R., Giedke, G., et al. (2025) · Nanoscale Advances · doi:10.1039/d5na00421g · Cited by 4
Escofet, P., Das, A., Rached, S. B., Rodrigo, S., Domingo, J., Sebastiano, F., Babaie, M., Keskin, B., Charbon, E., Bolívar, P. H., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00110 · Cited by 10
Timetronics: From temporal printed circuit board to quantum computer
Giergiel, K., Hannaford, P., & Sacha, K. (2024) · Physical review B · doi:10.1103/sk9x-d3dz · Cited by 5
Metadata
- Authors
- Preskill, J.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Preskill, John
- ORCID
- Preskill, John
- Venue
- Quantum
- Published
- 2018-08-06
- Volume
- 2
- Pages
- 79
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2781738013
- Cited by
- 8,830
- References
- 82
- Citations by year
- 2026: 1366 · 2025: 1674 · 2024: 1435 · 2023: 1263 · 2022: 1053 · 2021: 1014 · 2020: 638 · 2019: 322 · 2018: 59
- FWCI
- 286.68
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Bulletin of the American Physical Society
- Funders
- National Science Foundation
- U.S. Department of Energy
- Simons Foundation
- Intelligence Advanced Research Projects Activity
- Institute for Quantum Information and Matter, California Institute of Technology
- Kavli Institute for Theoretical Physics, University of California, Santa Barbara
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- NISQ devices, fault-tolerant quantum computing, quantum advantage, quantum computing hardware
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.