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 5,901–6,000 of 8,640
A Taxonomy of Real Faults for Hybrid Quantum-Classical Software Architectures
Bensoussan, A., Jahangirova, G., & Mousavi, M. R. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3788677 · Cited by 9
Britant, & Tiwari, A. S. (2025) · doi:10.1109/comsnets63942.2025.10885679 · Cited by 1
From Bits to Qubits: Challenges in Classical-Quantum Integration
Kulkarni, S. P., & Bethel, E. W. (2024) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.1109/hipc62374.2024.00025 · Cited by 3
Synthesis of Quantum Simulators by Compilation
Tarabkhah, M., Delavar, M., Doosti, M., & Shaikhha, A. (2025) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3696443.3708949 · Cited by 3
A Beam Search Framework for Quantum Circuit Mapping
Qiu, C., Zhu, P., & Wei, L. (2025) · Entropy · doi:10.3390/e27030232 · Cited by 5
Efficient particle-conserving symmetric quantum circuits
Ayeni, B. M. (2025) · Physical Review A · doi:10.1103/physreva.111.022629 · Cited by 7
Neutral atom quantum computers for the applications in condensed matter physics
Shweta, Kaur, I., Singh, N., Kanjilal, S., & Santra, B. (2025) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/adbb9b · Cited by 3
Cheaper and more noise-resilient quantum state preparation using eigenvector continuation
Agrawal, A. A., Getelina, J. C., Francis, A., & Kemper, A. F. (2025) · Physical Review A · doi:10.1103/physreva.111.032607 · Cited by 4
Yordanova, Z. B. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-84078-4_8 · Cited by 1
Xie, J., 熊, J.-L. 俊. X., Cheng, B., Liang, S., & Miao, F. (2025) · Chinese Physics Letters · doi:10.1088/0256-307x/42/4/040202 · Cited by 2
Photonic simulation of localization phenomena using boson sampling
Kulkarni, A. V., Tiwari, V., Sharma, A., & Raina, A. (2025) · Physical Review A · doi:10.1103/physreva.111.032622 · Cited by 1
Controllable single-photon routing in a T-shaped quantum router with two InGaAs quantum dots
Kim, S., Ko, M.-C., Wang, L., Kim, N.-C., Ri, S.-R., & Ryom, J.-S. (2025) · Journal of the Optical Society of America B · doi:10.1364/josab.557140 · Cited by 1
Learning out-of-time-ordered correlators with classical kernel methods
Tanner, J., Pye, J., & Wang, J. B. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.144301 · Cited by 3
Saha, D., Richerme, P., & Iyengar, S. S. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01343 · Cited by 2
Application of the quantum Fourier transform in a harmonic balance solver for Burgers’ equation
Dewitte, L., Roland, J., & Eulitz, F. (2025) · Computers & Fluids · doi:10.1016/j.compfluid.2025.106619 · Cited by 4
Optimal multicore quantum computing with few interconnects
Montes, J., Borondo, F., & Carlo, G. G. (2025) · APL Quantum · doi:10.1063/5.0252348 · Cited by 1
Applying a Parameterized Quantum Circuit to Anomaly Detection
Jiang, J., & Li, J.-S. (2025) · doi:10.3390/engproc2025092003 · Cited by 1
Zhou, X., Wang, Y., Tao, W., Zhou, Z., & Luo, L. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500067 · Cited by 1
Perumal, E., Supritha, R. K., Kasule, G. W., & Kesavaraj, G. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-0164-8.ch022 · Cited by 6
Realization of two-qubit gates operations in asymmetric superconducting circuits
Zhang, T., & Zhao, C. (2025) · Indian Journal of Physics · doi:10.1007/s12648-025-03598-w · Cited by 2
Kölle, M., Schneider, K., Egger, S., Topp, F., Phan, T., Altmann, P. J., Nüßlein, J., & Linnhoff–Popien, C. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-87327-0_3 · Cited by 4
Time-Scheduled End-to-End Entanglement Establishment in Memory-Cell-Limited Quantum Networks
Wang, Y., Yu, X., Zhao, Y., Cao, Y., Nag, A., & Zhang, J. (2025) · IEEE Transactions on Networking · doi:10.1109/ton.2025.3557820 · Cited by 3
Topical issue on quantum computing in low-energy nuclear theory
Ayral, T., Duguet, T., Lacroix, D., & Somà, V. (2025) · The European Physical Journal A · doi:10.1140/epja/s10050-025-01575-9 · Cited by 1
Quantum AI and Cybersecurity: The Next Frontier in Industrial Security
Tyagi, V., Tyagi, P., Tyagi, G., & Goel, P. K. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-3241-3.ch015 · Cited by 1
Quantum Computing Methods for Malware Detection
Krátká, E., & Gábris, A. (2025) · Springer eBooks · doi:10.1007/978-3-031-83157-7_8 · Cited by 1
Advances in Random and Quantum Walks: Bridging Classical and Quantum Computational Paradigms
Soni, A., Rasool, A., & Singh, D. P. (2025) · Procedia Computer Science · doi:10.1016/j.procs.2025.04.528 · Cited by 1
Design and benchmarks for emulating Kondo dynamics on a quantum chip
Sarma, S., Väyrynen, J. I., & König, E. J. (2025) · Physical review. B./Physical review. B · doi:10.1103/c864-5bbt · Cited by 1
Quantum data generation in a denoising model with multiscale entanglement renormalization network
Zhang, W., Huang, X., Shan, S., Zhao, W., Yang, B., Pan, W., & Shi, H. (2025) · Physica Scripta · doi:10.1088/1402-4896/add8c8 · Cited by 3
Protecting Quantum Gates from Arbitrary Single‐ and Two‐Qubit Errors
Wang, G., Wu, C., Sun, C., & Feng, X. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500041 · Cited by 2
Analysis of learning with errors problems with variational quantum algorithms
Zeng, J., Zheng, M., Li, H., Wei, S., & Long, G. (2025) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/add959 · Cited by 4
Open-quantum-system simulation through exploiting noise on quantum computers
Rose, M., Kais, S., & Mazziotti, D. A. (2025) · Physical Review A · doi:10.1103/physreva.111.052612 · Cited by 4
The Symmetry‐Based Expressive QAOA for the MaxCut Problem
Xiumei, Z., Li, Y., Li, G., Shi, Y., Qin, S., & Gao, F. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500199 · Cited by 7
Self-attention U-Net decoder for toric codes
Zhang, W., Xia, Z., Zhao, W., Pan, W., & Shi, H. (2025) · Physical Review Applied · doi:10.1103/xmp9-bh84 · Cited by 3
Developing and Analyzing the Defect-Based Surface Codes Using Optimization Algorithms
Sayedsalehi, S., Bagherzadeh, N., Barrio, A. A. D., Botella, G., & Pilipović, R. (2025) · Quantum Reports · doi:10.3390/quantum7020025 · Cited by 3
Experimental verification of entangled states in the adversarial scenario
Zhang, W.-H., Li, Z., Li, G., Hong, X.-S., Zhu, H., Chen, G., Li, C., & Guo, G. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.064005 · Cited by 2
Boosting RBFNN performance in regression tasks with quantum kernel methods
Zhou, X., Geng, Q., & Jiang, T. (2025) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/add0a3 · Cited by 1
Counterfactual Quantum Secret Sharing
Lae, N., Tariq, S., Paing, S. N., Setiawan, J. W., Kim, S., Duong, T. Q., & Shin, H. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3576910 · Cited by 2
Li, G., Wang, S., Xiumei, Z., Gao, F., Qin, S., Guo, F.-Z., & Jin, Z. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04783-w · Cited by 4
Sergeev, T. T., Zyablovsky, A. A., & Andrianov, E. S. (2025) · Physical Review A · doi:10.1103/2pz7-kgxr · Cited by 1
Applying the Quantum Grover Algorithm to Improve the Efficiency of Growth Models
Muhamediyeva, D., Mamatov, N., Samijonov, B. N., Ametova, G., & Turgunova, N. M. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-94273-0_7 · Cited by 1
Su, L., Wu, M., & Li, F. (2025) · Complex & Intelligent Systems · doi:10.1007/s40747-025-01973-y · Cited by 1
QR-Map: A Map-Based Approach to Quantum Circuit Abstraction for Qubit Reuse Optimization
Kim, H. J., Jang, E., Choi, S., Kim, Y., & Ro, W. W. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731020 · Cited by 5
The quantromon: A qubit-resonator system with orthogonal qubit and readout modes
Salunkhe, K. V., Kundu, S., Das, S., Deshmukh, J., Patankar, M. P., & Vijay, R. (2025) · Applied Physics Letters · doi:10.1063/5.0260171 · Cited by 7
Huang, D., Dai, W., Gao, F., Yang, M., Pan, Y., Ju, J., & Ma, Y. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500241 · Cited by 1
Masum, A. K. M., Moghadam, M. S., Kouhalvandi, L., Najafi, M. H., & Aygün, S. (2025) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3716368.3735286 · Cited by 4
Image classification with hybrid quantum-classical neural networks under qubit flip noise
Ling, Y.-Q., Zhang, J., Zhang, L., Ding, C.-Y., & Huang, H.-L. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04821-7 · Cited by 1
Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
Barrass, R., Nagarajan, H., & Coffrin, C. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-95973-8_4 · Cited by 1
Creating Resilient and Sustainable Businesses: New Ideas for Reducing Digital Carbon Footprints
Kaushik, P., & Kaswan, K. S. (2025) · World sustainability series · doi:10.1007/978-3-031-89545-6_15 · Cited by 2
Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
Pan, S., Patel, Y. J., Neumann, A., Neumann, F., Bäck, T., & Wang, H. (2025) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3712256.3726415 · Cited by 1
Modified Quantum Long-Short Term Memory with Variational Quantum Circuits for PV Power Forecasting
Phan, H.-V., Pham, T.-H., Tran, K. B., Phan, Q., Phan, Q. D., & Wu, Y.-K. (2025) · IEEE Industry Applications Society Annual Meeting (IAS) · doi:10.1109/ias62731.2025.11061559 · Cited by 2
Neukart, F., Marx, E., Vinokur, V. M., & Titus, J. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500262 · Cited by 2
The Evolution of Precise Positioning Techniques
Aggrey, J. (2025) · IntechOpen eBooks · doi:10.5772/intechopen.1011319 · Cited by 1
Variational-toolbox-based separability detection of multiqubit states
Liang, J.-M., Fei, S.-M., & He, Q. (2025) · Physical Review A · doi:10.1103/44wv-9qlf · Cited by 1
Shi, H. J., 韩, C. 成. H., 王, P. 鹏. W., & Zhang, M. (2025) · Chinese Physics B · doi:10.1088/1674-1056/adefd7 · Cited by 1
Polynomial Scaling Localized Active Space Unitary Selective Coupled Cluster Singles and Doubles
Verma, S., D’Cunha, R., Mitra, A., Hermes, M. R., Gray, S. K., Otten, M., & Gagliardi, L. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00745 · Cited by 3
Quick design of feasible tensor networks for constrained combinatorial optimization
Nakada, H., Tanahashi, K., & Tanaka, S. (2025) · Quantum · doi:10.22331/q-2025-07-21-1799 · Cited by 9
Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
Kuroiwa, K., & Nakagawa, Y. O. (2025) · Quantum · doi:10.22331/q-2025-07-21-1800 · Cited by 10
AQUA: Hardware-Agnostic Qubit Allocation for Quantum Multi-Programming
Piao, X., Shim, J., Kim, J., & Kim, J. (2025) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps64566.2025.00022 · Cited by 4
Quantum circuits for simulating neutrino propagation in matter
Joshi, S., Rajpoot, G., & Shukla, P. (2025) · Physica Scripta · doi:10.1088/1402-4896/adf3f2 · Cited by 3
Rengasamy, K., Joshi, P., & Raveendra, V. V. S. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00301-4 · Cited by 1
Quantum Computing and Cybersecurity: Navigating Threats and Opportunities
Malik, A. H., & Islam, S. M. N. (2025) · Springer eBooks · doi:10.1007/978-981-96-4948-8_18 · Cited by 1
Abiwardani, M. R., Ruskanda, F. Z., Syafalni, I., Mulyawan, R., & Higo, A. (2025) · IEEE Access · doi:10.1109/access.2025.3596031 · Cited by 3
YANG, 杨. X.-Y., YAN, 延. Y., & LU, 陆. J. (2023) · Acta Sinica Quantum Optica · doi:10.3788/jqo20232902.0401 · Cited by 2
Nandini, K., Singh, D. P., Kavitha, V. R., et al. (2025) · doi:10.1109/netcrypt65877.2025.11102526 · Cited by 1
Investigating Techniques to Optimise the Layout of Turbines in a Windfarm Using a Quantum Computer
Hancock, J., Craven, M. J., McNeile, C., & Vadacchino, D. (2025) · Journal of quantum computing · doi:10.32604/jqc.2025.068127 · Cited by 4
Morais, A., Osaba, E., Pastor-López, I., & Oregi, I. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3734363 · Cited by 6
A Variational Quantum Algorithm for the Permutation Flow Shop Scheduling Problem
Baioletti, M., Fagiolo, F., Oddi, A., & Rasconi, R. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3734312 · Cited by 3
Conditional diffusion-based parameter generation for quantum approximate optimization algorithm
Meng, F., Zhou, X., Zhu, P., & Luo, Y. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00397-4 · Cited by 12
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Weiden, M., Kalloor, J., Kubiatowicz, J. D., Younis, E., & Iancu, C. (2025) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.426.8 · Cited by 11
Pandya, K., & Maiti, A. (2025) · Information Sciences · doi:10.1016/j.ins.2025.122584 · Cited by 1
Detecting entanglement and nonlocality with minimum observable length
Chen, Z., Shi, F., & Zhao, Q. (2025) · New Journal of Physics · doi:10.1088/1367-2630/adfe0e · Cited by 2
Quantum Neural Network Integrating with Gradient Descent Techniques for Enhanced Learning
Vidyullatha, P., Ghantasala, G. S. P., Rajesh Sharma, R., Sungheetha, A., & Ananthanagu, U. (2025) · International Conference on Computing for Sustainable Global Development · doi:10.23919/indiacom66777.2025.11115552 · Cited by 1
Simulation of the QAOA Algorithm at the JINR Quantum Testbed
Palii, Y. G., Belyakov, D. V., Bogolubskaya, A. A., Zuev, M. I., & Yanovich, D. A. (2025) · Physics of Particles and Nuclei · doi:10.1134/s1063779625700066 · Cited by 1
EDDQC: Enhanced Dynamical Distributing Quantum Compilation
Zhou, Y., Liu, K., Luo, H., Xiong, L., Zhu, Y., Casey, E., Cheng, J., Chen, S. Y.-C., & Liang, Z. (2025) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2025.3600096 · Cited by 1
Evolution of Entanglement Witness of Dicke State under Noise and Error Mitigation
Prajapati, T., Mehta, H., Banerjee, S., Panigrahi, P. K., & Narayanan, V. (2025) · International Journal of Theoretical Physics · doi:10.1007/s10773-025-06107-1 · Cited by 3
Bankruptcy and Insolvency Code: An Accelerator for the Economy of India
Garg, T., Goyal, R., & Tanveer, A. (2024) · International Conference on Information Management & Machine Intelligence (ICIMMI) · doi:10.1145/3745812.3745834 · Cited by 1
Intelligence Beyond Human Limits: The Evolution and Implications of Machine Cognition
Miljković, D. (2025) · International Convention on Information and Communication Technology, Electronics and Microelectronics · doi:10.1109/mipro65660.2025.11132078 · Cited by 1
Marzoug, N., Halab, K., Meslouhi, O. E., Elassad, Z. E. A., & Akhloufi, M. A. (2025) · BioMedInformatics · doi:10.3390/biomedinformatics5030051 · Cited by 3
Guo, Y., & Gao, X. B. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00517 · Cited by 9
Suppressing quantum errors by noise-aware circuit design
Hu, Y., Zheng, C., Wang, X., Meng, F., Yu, X., & Zhang, Z. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae05c4 · Cited by 5
Multi-Dimensional Quantum-like Resources from Complex Synchronized Networks
Saha, D., & Scholes, G. D. (2025) · Entropy · doi:10.3390/e27090963 · Cited by 1
Light as a Quantum Agent: Bridging Path Integrals and Reinforcement Learning
Poojary, B. B. (2025) · American Journal of Modern Physics · doi:10.11648/j.ajmp.20251405.11 · Cited by 1
Variational Preparation of Entangled States in a System of Transmon Qubits
Yeremeyev, A., Tolstobrov, A., Fedorov, G., Sanduleanu, S. V., Shlykov, P., Samarin, S., Kadyrmetov, S., Muraviev, A., Bolgar, A. N., Kalacheva, D. A., et al. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500316 · Cited by 1
Early IBM quantum computers: architectural analysis and performance benchmarks
AbuGhanem, M. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08386-9 · Cited by 4
A Hybrid Quantum-Classical Language Model for Text Generation: A Case Study on The Gift of the Magi
Routh, A., & Singh, J. M. (2025) · International Conference on Multidisciplinary Research and Innovations in Engineering (MRIE) · doi:10.1109/mrie66930.2025.11156371 · Cited by 1
The Quantum Advantage in Future Technologies for Supply Chain Optimization
Muralidhar, L. B., Shilpa, R., Kumar, V., Santhosh, Y., & Vainik, V. S. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-0649-0.ch012 · Cited by 1
Calculation of the Green’s Function on Near-term Quantum Computers via Cartan Decomposition
Wan, L., Liu, J., & Yang, J. (2025) · Chemical Research in Chinese Universities · doi:10.1007/s40242-025-5149-y · Cited by 1
Quantum Error Mitigation via Autoencoder Neural Networks
Lin, X.-D., Chang, H.-M., You, J.-S., & Hsu, H.-C. (2025) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl65142.2025.11158291 · Cited by 1
Overhead in Quantum Circuits with Time-Multiplexed Qubit Control
Richter, M., Strandberg, I., Gasparinetti, S., & Kockum, A. F. (2026) · PRX Quantum · doi:10.1103/82cj-lfzy · Cited by 9
Correcting and Extending Trotterized Quantum Many-Body Dynamics
Gentinetta, G., Metz, F., & Carleo, G. (2025) · PRX Quantum · doi:10.1103/1nqt-x5xh · Cited by 5
Microwave-activated high-fidelity three-qubit gate scheme for fixed-frequency superconducting qubits
Zhao, K., Ma, W.-G., Wang, Z., Li, H., Huang, K., Shi, Y., Xu, K., & Fan, H. (2025) · Physical Review Applied · doi:10.1103/l721-33qk · Cited by 8
Variational quantum recommendation system with embedded latent vectors
Debi, S., & Makmal, A. (2025) · Scientific Reports · doi:10.1038/s41598-025-15869-x · Cited by 1
HiFi-DisQ: High Fidelity Distributed Quantum Computing with Optimized Communication
Sahu, H., Pradhan, L., & Gupta, H. P. (2025) · International Conference on Communications · doi:10.1109/icc52391.2025.11161510 · Cited by 1
Rubio, Y., Olvera, C., & Montiel, O. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-85614-3_20 · Cited by 1
Quantum annealing for linear spectral unmixing: a proof-of-concept
Riet, M., Wezeman, R. S., Bontekoe, T., Phillipson, F., & Veraverbeke, S. (2025) · International Journal of Remote Sensing · doi:10.1080/01431161.2025.2557584 · Cited by 1
Quantum-ready software engineering: principles, frameworks, and hybrid development pipelines
Azeez, H. H. (2025) · International Journal of Information technology and Computer Engineering · doi:10.55529/ijitc.52.1.7 · Cited by 1
Efficient Berry phase calculation via adaptive variational quantum computing approach
Mootz, M., & Yao, Y. (2026) · APL Quantum · doi:10.1063/5.0294540 · Cited by 7
( 2 + 1 ) D quantum electrodynamics at finite density on a quantum computer
Rosanowski, E. O., Crippa, A., Funcke, L., Itaboraí, P. V., Jansen, K., & Singh, S. (2026) · Physical review. D/Physical review. D. · doi:10.1103/3ntp-l3s7 · Cited by 8
Multi‐Channel Convolutional Neural Quantum Embedding
Kim, Y., Im, C., Kim, T., Hur, T., & Park, D. K. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500575 · Cited by 6
Neural-Network-Assisted Monte Carlo Sampling Trained by Quantum Approximate Optimization Algorithm
Nakano, Y., Okada, K. N., & Fujii, K. (2026) · PRX Quantum · doi:10.1103/9nhx-5pym · Cited by 8
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.