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 6,401–6,500 of 8,640
Protecting three-dimensional entanglement from the correlated amplitude damping channel
Xiao, X., Huang, W.-R., Lu, T., & Li, Y.-L. (2025) · Chinese Journal of Physics · doi:10.1016/j.cjph.2025.03.027 · Cited by 4
Wu, Y.-T., Huang, P.-H., Chang, K., Tu, C.-H., & Hung, S. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07157-2 · Cited by 3
Phases and phase transition in Grover's algorithm with systematic noise
Dowarah, S., Zhang, C., Khemani, V., & Kolodrubetz, M. (2025) · Physical Review A · doi:10.1103/physreva.111.042603 · Cited by 1
Optimizing Machine Learning and Deep Learning Software Stacks for AI-Specific Cloud Infrastructures
Sarabu, V. R. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-9694-0.ch021 · Cited by 1
Exploration of Timing and Higher-Energy Attacks on Quantum Random Access Memory
Tan, Y. H., Xu, C., & Szefer, J. M. (2024) · doi:10.1145/3676536.3689916 · Cited by 3
Slow measurement-only dynamics of entanglement in Pauli subsystem codes
Placke, B., & Parameswaran, S. A. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.144308 · Cited by 3
Corrupted sensing quantum state tomography
Ma, M., & Shang, J. (2025) · New Journal of Physics · doi:10.1088/1367-2630/adcfbf · Cited by 3
Kumari, M., & Suri, C. (2024) · OITS International Conference on Information Technology (OCIT) · doi:10.1109/ocit65031.2024.00037 · Cited by 1
Variational Quantum Regression on NISQ Hardware with Error Mitigation
Garate, E., Sebastian, P. S., Valverde, G., Ruiz, A., & Gómez-Omella, M. (2024) · Artificial Intelligence Revolutions (AIR) · doi:10.1109/air63653.2024.00016 · Cited by 3
Quantum-Safe Hash Time-Locked Cross-Chain Transaction Mechanism
Hu, X., Cheng, W., Bai, S., Ma, C., & Liu, Y. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-78373-9_6 · Cited by 1
Kattemölle, J., & Hariharan, S. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3733842 · Cited by 7
Exploring the application of quantum technologies to industrial and real-world use cases
Osaba, E., Villar-Rodríguez, E., & Oregi, I. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07320-9 · Cited by 1
Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Liu, J., Zhou, L., Barthe, G., & Ying, M. (2025) · Journal of the ACM · doi:10.1145/3734516 · Cited by 5
Hwang, S., Seo, H., & Kim, Y. (2025) · ACM/SIGAPP Symposium on Applied Computing (SAC) · doi:10.1145/3672608.3707921 · Cited by 1
Supersymmetric extension of Deutsch–Jozsa algorithm
Khemakhmia, A., & Aissaoui, H. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04753-2 · Cited by 1
Understanding Noise-Adaptive Transpilation Techniques Using the SupermarQ Benchmark
Vorathammathorn, S., Binhar, M., Patamawisut, N., Chanchuphol, S., Prechaprapranwong, P., Hansomboon, J., & Sarochawikasit, R. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00071 · Cited by 2
Dephasing noise simulation for coherence-generating devices
Salazar, R., & Shahbeigi, F. (2025) · Physica Scripta · doi:10.1088/1402-4896/adda94 · Cited by 1
Empowering Quantum Error Traceability with MoE for Automatic Calibration
Li, T., Zhao, Z., Lu, L., Tan, S., & Yin, J. (2025) · Design, Automation, and Test in Europe · doi:10.23919/date64628.2025.10993074 · Cited by 1
English Title: The State of Quantum Computing: Hardware, Algorithms, and Emerging Networks
Singh, A. (2025) · LatIA · doi:10.62486/latia2025316 · Cited by 3
Impact of Noise and Hardware Connectivity on Grover’s Quantum Search Algorithm in NISQ Devices
Joshi, M., Mishra, M. K., & Karthikeyan, S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-88881-6_4 · Cited by 3
Hybrid Encoding-based Quantum Self Attention for Financial Time Series Analysis
Lokes, S., Reddy, S., & Chen, S. Y. C. (2025) · IEEE International Conference on Acoustics, Speech, and Signal Processing Workshops (ICASSPW) · doi:10.1109/icasspw65056.2025.11011079 · Cited by 1
Preparing for Quantum Transformation: Strategic Implications for Business and Finance in Asia
Narayan, S. (2025) · Springer eBooks · doi:10.1007/978-981-96-3452-1_14 · Cited by 1
Full-Stack Quantum Computing and Distributed Systems: A Community-Centric Approach
Feld, S. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-94263-1_1 · Cited by 2
Paraconsistent Relations as a Variant of Kleene Algebras
Cunha, J., Madeira, A., & Barbosa, L. S. (2025) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.421.8 · Cited by 1
Consider the energy consumption of your quantum circuits
Calero, C., Polo, M., Desdentado, E., et al. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00846-0 · Cited by 1
Zare, A., & Boroushaki, M. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00381-y · Cited by 3
Classical and Quantum SVM for Electromyography-Based Myopathy Detection: A Comparative Exploration
Hammachi, R., Messaoudi, N., Belkacem, S., Pasetto, E., & Delilbasic, A. (2025) · Polish Journal of Medical Physics And Engineering · doi:10.2478/pjmpe-2025-0013 · Cited by 3
Azanaw, G. M. (2025) · International Journal of Emerging Science and Engineering · doi:10.35940/ijese.g2606.13070625 · Cited by 3
Das, S., & Ghosh, S. (2025) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3716368.3735191 · Cited by 2
Classical postprocessing approach for quantum amplitude estimation
Yang, Y., & Yang, R. (2025) · Physical Review A · doi:10.1103/z9hk-f37h · Cited by 2
Gene Mining and Privacy by the Emerging High Tech
YILDIRIM, H., & Ünal, C. (2025) · Sinop Üniversitesi Fen Bilimleri Dergisi · doi:10.33484/sinopfbd.1599550 · Cited by 1
AI-Augmented Parameter Initialization for QAOA
Nana, J., Li, X., Xie, N., Pu, S., Yu, Y., Guan, Q., Han, X., Xu, S., & Chaudhary, V. (2025) · International Conference on Dependable Systems and Networks workshops · doi:10.1109/dsn-w65791.2025.00064 · Cited by 1
Arsoski, V. V. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07684-y · Cited by 3
Quantum Computing: Transforming Cybersecurity in the Quantum Era
Saxena, N., & Nigam, A. (2025) · Springer eBooks · doi:10.1007/978-981-96-4948-8_1 · Cited by 2
Simulation of Quantum and Artificial Systems
Natarajan, V. (2025) · Springer eBooks · doi:10.1007/978-981-96-5051-4_4 · Cited by 1
Ileana, M., Petrov, P., & Milev, V. (2025) · International Symposium on Innovative Approaches in Smart Technologies (ISAS) · doi:10.1109/isas66241.2025.11101908 · Cited by 1
Concurrent fermionic simulation gate
Jiang, Z., & Ansari, M. H. (2025) · Physical Review Applied · doi:10.1103/m5z3-jgk8 · Cited by 5
Scalable noisy quantum circuits for biased-noise qubits
Fellous-Asiani, M., Naseri, M., Datta, C., Streltsov, A., & Oszmaniec, M. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01054-5 · Cited by 8
Quantum Knowledge Graph: Leveraging QNLP for Semantic Relationship Modeling
Bharti, S., Lo, D. C.-T., & Shahriar, H. (2025) · IEEE Annual Computers, Software, and Applications Conference (COMPSAC) · doi:10.1109/compsac65507.2025.00192 · Cited by 1
Optimization of Quantum Error Correcting Code under Temporal Variation of Qubit Quality
Das, S., & Ghosh, S. (2025) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi65124.2025.11130303 · Cited by 3
Quantum Feature Optimization for Enhanced Clustering of Blockchain Transaction Data
Tsai, Y., & Chen, S. Y.-C. (2025) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn65249.2025.11133860 · Cited by 2
Li, Z.-M., & Liu, Y.-X. (2025) · Physical Review A · doi:10.1103/79h3-jspt · Cited by 3
Hybrid Quantum-Classical Interval Type-2 Mamdani Fuzzy Systems
Acampora, G., Schiattarella, R., & Vitiello, A. (2025) · Proceedings of ... IEEE International Conference on Fuzzy Systems · doi:10.1109/fuzz62266.2025.11152074 · Cited by 1
Research on Quantum Circuit Learning Models for Molecular Dynamics Simulation
Nishida, Y. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c03624 · Cited by 2
A Hybrid Quantum‐Assisted Column Generation Algorithm for the Fleet Conversion Problem
Chatterjee, Y., Allybokus, Z., Rančić, M. J., & Bourreau, E. (2025) · Quantum Engineering · doi:10.1155/que2/9984337 · Cited by 5
Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudomagic States
Magni, B., Christopoulos, A., Luca, A. D., & Turkeshi, X. (2025) · Physical Review X · doi:10.1103/p8dn-glcw · Cited by 65
Yu, S., & Zhou, Y. (2025) · IEEE Transactions on Industry Applications · doi:10.1109/tia.2025.3625884 · Cited by 1
Quoptuna: An Open-Source Framework for Explainable Quantum Machine Learning
José, E., & Fong, A. C. (2025) · doi:10.1109/intcec65580.2025.11256089 · Cited by 1
From Barren Plateaus Through Fertile Valleys: Conic Extensions of Parameterised Quantum Circuits
Binkowski, L., Koßmann, G., Osborne, T. J., Schwonnek, R., & Ziegler, T. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00022 · Cited by 8
Enhancing the Trainability of Variational Quantum Circuits with Regularization Strategies
Zhuang, J., Cunningham, J., & Guan, C. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10304 · Cited by 8
Quantum Tree Generator Improves Qaoa State-of-the-Art for the Knapsack Problem
Christiansen, P. G., Binkowski, L., Ramacciotti, D., & Wilkening, S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00011 · Cited by 18
Dutta, S., Innan, N., Yahia, S. B., & Shafique, M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00191 · Cited by 14
Trojan Threats in Quantum Computing Hardware: SFQ Control and Readout Vulnerabilities
Adedokun, A., Mustafa, Y., & Köse, S. (2025) · IEEE International Conference on Secure IoT, Assured and Trusted Computing (SATC) · doi:10.1109/satc65530.2025.11137191 · Cited by 3
Machine learning in bosonic quantum systems
Kan, S., & Mao, Y. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-330259-6.00017-7 · Cited by 1
Building globally controlled quantum processors with Z Z interactions
Menta, R., Cioni, F., Aiudi, R., Caravelli, F., Polini, M., & Giovannetti, V. (2026) · Physical Review A · doi:10.1103/lz5d-lnz2 · Cited by 5
Approximate quantum circuit compilation for proton-transfer kinetics on quantum processors
Kovyrshin, A., Manawadu, D., Altamura, E., Pennington, G., Jaderberg, B., Brandhofer, S., Nykänen, A., Miller, A., Talarico, N. W., Knecht, S., et al. (2026) · Physical Chemistry Chemical Physics · doi:10.1039/d5cp04097c · Cited by 6
Quantum Attention for Vision Transformers in High Energy Physics
Tesi, A., Gleyzer, S., Matchev, K. T., Matcheva, K., Kong, K., Dahale, G. R., & Magorsch, T. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-15931-1_2 · Cited by 13
Double-bracket quantum algorithms for high-fidelity ground-state preparation
Robbiati, M., Pedicillo, E., Pasquale, A., Xiaoyue, L., Kiss, O., Wright, A. L., Farias, R. M. S., Giang, K. U., Son, J., Knörzer, J., et al. (2026) · Physical Review Research · doi:10.1103/jz88-32rb · Cited by 17
Neighborhood-history quantum walk
Shakeel, A. (2019) · Physica Scripta · doi:10.1088/1402-4896/ab0254 · Cited by 1
Rogers, L., & McAllister, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-27562-4_25 · Cited by 1
Clifford-group-restricted eavesdroppers in quantum key distribution
Govia, L. C. G., Bunandar, D., Lin, J., Englund, D. R., Lütkenhaus, N., & Krovi, H. (2020) · Physical Review A · doi:10.1103/physreva.101.062318 · Cited by 2
Super-Resolution for Imagery Enhancement Using Variational Quantum Eigensolver
Alves, Y. C. D. S. (2019) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip45357.2019.8969496 · Cited by 1
Chen, J., & Nurdin, H. I. (2019) · Australian & New Zealand Control Conference (ANZCC) · doi:10.1109/anzcc47194.2019.8945670 · Cited by 1
Technology-dependent Quantum Logic Synthesis and Compilation
Smith, K. N. (2019) · SMU Scholar (Southern Methodist University) · Cited by 2
Travelling Salesperson Problem with Quantum Computing
Medury, B. L. A., & Podapati, V. H. (2020) · International Journal of Engineering Research and · doi:10.17577/ijertv9is030107 · Cited by 1
Noise Mitigation with Delay Pulses in the IBM Quantum Experience
Tomkins, S., & de Sousa, R. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00058 · Cited by 1
How Many Trials Do We Need for Reliable NISQ Computing?
Tanimoto, T., Matsuo, S., Kawakami, S., Tabuchi, Y., Hirokawa, M., & Inoue, K. (2020) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi49217.2020.00059 · Cited by 2
Hybrid Quantum-Classical Eigensolver without Variation or Parametric Gates
Jouzdani, P., & Bringuier, S. A. (2021) · Quantum Reports · doi:10.3390/quantum3010008 · Cited by 4
Phase analysis on the error scaling of entangled qubits in a 53-qubit system
Huang, W.-J., Chien, W.-C., Cho, C.-H., Huang, C.-C., Huang, T.-W., Tan, S. G., Cao, C., Zeng, B., & Chang, C.-R. (2021) · Scientific Reports · doi:10.1038/s41598-021-93856-8 · Cited by 1
Energy transfer and thermodynamics of quantum gravity computation
Gyöngyösi, L. (2020) · Chaos Solitons & Fractals X · doi:10.1016/j.csfx.2020.100050 · Cited by 1
Noisy Intermediate Scale Quantum Computers: on the Co-Simulation of Qubits and Control Electronics
Blokhina, E., Bizzarri, F., Giounanlis, P., Leipold, D. R., & Brambilla, A. (2020) · IEEE International Conference on Electronics, Circuits and Systems (ICECS) · doi:10.1109/icecs49266.2020.9294837 · Cited by 1
Fusing the single-excitation subspace with $${\mathbb C}^{2^n}$$
Geller, M. R. (2021) · Scientific Reports · doi:10.1038/s41598-020-79853-3 · Cited by 1
Gesellschaftliche Perspektiven der Quantentechnologie
Mainzer, K. (2020) · Springer eBooks · doi:10.1007/978-3-662-61998-8_12 · Cited by 1
Efficient Decoding Scheme of Non-Uniform Concatenation Quantum Code with Deep Neural Network
Lin, C., Wang, Y., Wu, J., & Yang, G. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04706-8 · Cited by 1
Lessons Learnt in the Implementation of Quantum Circuit Simulation Using Decision Diagrams
Grurl, T., Fub, J., & Wille, R. (2021) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl51352.2021.00024 · Cited by 1
Simulation of Quantum Tomography Process of Biphoton Polarization States on a Quantum Computer
Manko, S., Frolovtsev, D. N., & Magnitsky, S. A. (2021) · Moscow University Physics Bulletin · doi:10.3103/s0027134921020065 · Cited by 1
Phase analysis on the error scaling of entangled qubits in a 53-qubit system
Huang, W., Chien, W., Cho, C., Huang, C., Huang, T. H., Tan, S. G., Cao, C. C., Zeng, B., & Chang, C. (2021) · Chinese Culture University Repository · Cited by 1
Govia, L. C. G., Poole, C., Saffman, M. E., & Krovi, H. (2021) · Physical Review A · doi:10.1103/physreva.104.062428 · Cited by 20
Mineh, L., & Montanaro, A. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.125117 · Cited by 31
Pulse-level characterization of qubits on quantum devices
Salamanca, Q., & Andrés, D. B. (2021) · Cited by 1
Low overhead universality and quantum supremacy using only Z control
Barch, B., Mohseninia, R., & Lidar, D. A. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033207 · Cited by 1
Social narcissism – how society pushes us to overestimate our capacities, leaving many behind
Herrmann, P., & Yudina, M. A. (2021) · Living Standards of the Population in the Regions of Russia · doi:10.19181/lsprr.2021.17.3.8 · Cited by 1
Approximation Method for Optimization Problems in Gate-Model Quantum Computers
Gyöngyösi, L. (2021) · Chaos Solitons & Fractals X · doi:10.1016/j.csfx.2021.100066 · Cited by 1
qopt: An experiment-oriented Qubit Simulation and Quantum Optimal Control Package
Teske, J. D., & Bluhm, H. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00069 · Cited by 3
An Automatic Approach for Combinational Problems on a Hybrid Quantum Architecture
Shu, G., Wang, J., Shan, Z., Liu, F., Liu, Z., & Guo, G. (2021) · SPIN · doi:10.1142/s2010324721400063 · Cited by 1
Introducing Fermionic Link Models
Banerjee, D., Huffman, E., & Rammelmüller, L. (2022) · International Symposium on Lattice Field Theory (LATTICE) · doi:10.22323/1.396.0193 · Cited by 1
Implementing the Simplex Method with Grover’s Search
Jordon, A., Angara, P. P., & Joshi, S. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00066 · Cited by 1
Software Quality Issues in Quantum Information Systems.
Verduro, J., Rodríguez, M., & Piattini, M. G. (2021) · Cited by 1
Best-Practice Aspects of Quantum-Computer Calculations: A Case Study of the Hydrogen Molecule
Miháliková, I., Friák, M., Pivoluska, M., Plesch, M., Saip, M., & Šob, M. (2022) · Molecules · doi:10.3390/molecules27030597 · Cited by 21
Non-Functional Requirements for Quantum Programs.
Saraiva, L., Hæusler, E. H., da Costa, V. G., & Kalinowski, M. (2021) · Cited by 13
Combinatorial optimization with variational approaches on noisy quantum devices
Miki, T., Okita, R., Shimada, M., & Shirakashi, J. (2021) · IEEE International Conference on Manipulation, Manufacturing and Measurement on the Nanoscale (3M-NANO) · doi:10.1109/3m-nano49087.2021.9599740 · Cited by 1
Photonic scheme of quantum phase estimation for quantum algorithms via quantum dots
Heo, J., & Choi, S. G. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03335-2 · Cited by 2
Heating Dissipation Discussion of TSV-integrated Ion Trap with Glass Interposer
Zhao, P., Bi, X. W., Li, H. Y., Lim, Y. D., Seit, W. W., Guidoni, L., & Tan, C. S. (2021) · IEEE Electronics Packaging Technology Conference (EPTC) · doi:10.1109/eptc53413.2021.9663904 · Cited by 1
Compression and reduction of $$N*1$$ states by unitary matrices
Du, G., Zhou, C., & Kwek, L. C. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03409-9 · Cited by 2
Quantum walk based quantum secret sharing in a verifiable framework
Lu, C., Miao, F., Hou, J., & Ning, Y. (2021) · International Conference on Big Data & Artificial Intelligence & Software Engineering (ICBASE) · doi:10.1109/icbase53849.2021.00056 · Cited by 1
Power-law decay of entanglement quantifiers in a single agent coupled to a many-body system
Shpielberg, O. (2022) · Physical Review A · doi:10.1103/physreva.105.042420 · Cited by 1
A Single Qubit Quantum Perceptron for OR and XOR Logic
Chaurasiya, R., Dey, D., Rakshit, T., & Bhattacharyya, S. (2022) · Studies in computational intelligence · doi:10.1007/978-981-19-0489-9_11 · Cited by 3
Manifestation of quantum images using unitary matrix encoding
Amal, R. S., & Kannan, S. (2022) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-022-02630-w · Cited by 1
Variational Quantum Unsampling on a Programmable Nanophotonic Processor
Carolan, J., Mosheni, M., Olson, J. P., Prabhu, M., Chen, C., Bunandar, D., Harris, N. C., Wong, F. N. C., Hochberg, M., Lloyd, S., et al. (2019) · Conference on Lasers and Electro-Optics · doi:10.1364/cleo_qels.2019.fth3a.3 · Cited by 1
Zulehner, A., & Wille, R. (2020) · Springer eBooks · doi:10.1007/978-3-030-41753-6_2 · Cited by 1
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.