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 2,301–2,400 of 8,640
Experimental Implementation of Short-Path Nonadiabatic Geometric Gates in a Superconducting Circuit
Yang, X.-X., Guo, L.-L., Zhang, H.-F., Du, L., Zhang, C., Tao, H., Chen, Y., Duan, P., Jia, Z.-L., Kong, W., et al. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.044076 · Cited by 20
Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
Yu, Y., Cao, C., Wang, X., Shannon, N., & Joynt, R. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023147 · Cited by 27
Kashif, M., & Al-Kuwari, S. M. (2023) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760.2023.2231163 · Cited by 29
Quantum-assisted Monte Carlo algorithms for fermions
Xu, X., & Li, Y. (2023) · Quantum · doi:10.22331/q-2023-08-03-1072 · Cited by 23
Error mitigation for quantum approximate optimization
Weidinger, A., Mbeng, G. B., & Lechner, W. (2023) · Physical Review A · doi:10.1103/physreva.108.032408 · Cited by 27
SpinQ: Compilation Strategies for Scalable Spin-Qubit Architectures
Paraskevopoulos, N., Sebastiano, F., Almudéver, C. G., & Feld, S. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3624484 · Cited by 25
Li, H., Wang, Z., & Fei, S.-M. (2023) · Physical Review A · doi:10.1103/physreva.108.032418 · Cited by 19
Fast Quantum Algorithms for Trace Distance Estimation
Wang, Q., & Zhang, Z. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3321121 · Cited by 59
Fractonic higher-order topological phases in open quantum systems
Zhang, J.-H., Ding, K., Yang, S., & Bi, Z. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.155123 · Cited by 24
Bayesian Optimization for QAOA
Tibaldi, S., Vodola, D., Tignone, E., & Ercolessi, E. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3325167 · Cited by 39
Zhang, J., Ferguson, R., Kühn, S., Haase, J. F., Wilson, C. M., Jansen, K., & Muschik, C. A. (2023) · Quantum · doi:10.22331/q-2023-10-23-1148 · Cited by 37
QDoor: Exploiting Approximate Synthesis for Backdoor Attacks in Quantum Neural Networks
Chu, C., Chen, F., Richerme, P., & Jiang, L. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00124 · Cited by 39
Enhancing quantum computation via superposition of quantum gates
Miguel-Ramiro, J., Shi, Z., Dellantonio, L., Chan, A., Muschik, C. A., & Dür, W. (2023) · Physical Review A · doi:10.1103/physreva.108.062604 · Cited by 22
QuComm: Optimizing Collective Communication for Distributed Quantum Computing
Wu, A., Ding, Y., & Li, A. (2023) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3613424.3614253 · Cited by 27
Probing Oxidation-Driven Amorphized Surfaces in a Ta(110) Film for Superconducting Qubit
Mun, J., Sushko, P. V., Brass, E., Zhou, C., Kisslinger, K., Qu, X., Liu, M., & Zhu, Y. (2023) · ACS Nano · doi:10.1021/acsnano.3c10740 · Cited by 23
Quantum State Tomography for Matrix Product Density Operators
Qin, Z., Jameson, C., Gong, Z., Wakin, M. B., & Zhu, Z. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3360951 · Cited by 49
Perrin, H., Scoquart, T., Shnirman, A., Schmalian, J., & Snizhko, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013142 · Cited by 36
Quantum-parallel vectorized data encodings and computations on trapped-ion and transmon QPUs
Balewski, J. T., Amankwah, M. G., Beeumen, R. V., Bethel, E. W., Perciano, T., & Camps, D. (2024) · Scientific Reports · doi:10.1038/s41598-024-53720-x · Cited by 39
Federated quantum natural gradient descent for quantum federated learning
Qi, J., & Hsieh, M.-H. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-319037-7.00028-4 · Cited by 37
Accelerated variational quantum eigensolver with joint Bell measurement
Cao, C., Yano, H., & Nakagawa, Y. O. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013205 · Cited by 19
Testing and Debugging Quantum Circuits
Metwalli, S. A., & Meter, R. V. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3374879 · Cited by 33
Transfer of Logistics Optimizations to Material Flow Resource Optimizations using Quantum Computing
Pfister, R., Schubert, G., & Kröll, M. (2024) · Procedia Computer Science · doi:10.1016/j.procs.2024.01.004 · Cited by 20
Wu, J., Fu, H., Zhu, M., Zhang, H. Y., Xie, W., & Li, X. (2024) · Physical Review A · doi:10.1103/physreva.109.032623 · Cited by 29
Quantum Optimization Methods for Satellite Mission Planning
Makarov, A., Pérez-Herradón, C., Franceschetto, G., Taddei, M. M., Osaba, E., del Barrio, P., Villar-Rodríguez, E., & Oregi, I. (2024) · IEEE Access · doi:10.1109/access.2024.3402990 · Cited by 28
Narottama, B., & Aïssa, S. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3396437 · Cited by 20
Using Ai to Help Reduce the Effect of Global Warming
Khallaf, A. N. (2024) · Power System Technology · doi:10.52783/pst.464 · Cited by 29
Assessing and advancing the potential of quantum computing: A NASA case study
Rieffel, E. G., Asanjan, A. A., Alam, M. S., Anand, N., Bernal, D. E., Block, S., Brady, L. T., Cotton, S., Izquierdo, Z. G., Grabbe, S. R., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.06.012 · Cited by 34
Shor’s algorithm does not factor large integers in the presence of noise
Cai, J. (2024) · Science China Information Sciences · doi:10.1007/s11432-023-3961-3 · Cited by 32
Neural quantum embedding: Pushing the limits of quantum supervised learning
Hur, T., Araujo, I. F., & Park, D. K. (2024) · Physical Review A · doi:10.1103/physreva.110.022411 · Cited by 38
Quantum visual feature encoding revisited
Nguyen, X.-B., Nguyen, H.-Q., Churchill, H., Khan, S. U., & Luu, K. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00192-x · Cited by 32
Shedding Light on the Future: Exploring Quantum Neural Networks through Optics
Yu, S., Jia, Z., Zhang, A., Mer, E., Li, Z., Crescimanna, V., Chen, K., Patel, R. B., Walmsley, I. A., & Kaszlikowski, D. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400074 · Cited by 24
Self-supervised pre-trained neural network for quantum natural language processing
Yao, B., Tiwari, P., & Li, Q. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.107004 · Cited by 25
Reviving the Lieb–Schultz–Mattis theorem in open quantum systems
Zhou, Y.-N., Li, X., Zhai, H., Li, C., & Gu, Y. (2024) · National Science Review · doi:10.1093/nsr/nwae287 · Cited by 39
Singh, S., Kumar, S., Chhabra, A., Sharma, A., Arya, V., Srinivasan, M., & Gupta, B. B. (2025) · Cyber Security and Applications · doi:10.1016/j.csa.2025.100089 · Cited by 21
Quasiparticle Cooling Algorithms for Quantum Many-Body State Preparation
Lloyd, J., Michailidis, A. A., Mi, X., Smelyanskiy, V., & Abanin, D. A. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010361 · Cited by 46
Quantum Kernel-Based Long Short-term Memory for Climate Time-Series Forecasting
Hsu, Y.-C., Chen, N.-Y., Li, T.-Y., Lee, P.-H. H., & Chen, K. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00072 · Cited by 42
A control microarchitecture for fault-tolerant quantum computing
Fu, X., Lao, L., Bertels, K., & Almudéver, C. G. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.06.011 · Cited by 23
Unitary-coupled restricted Boltzmann machine ansatz for quantum simulations
Hsieh, C., Sun, Q., Zhang, S., & Lee, C. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00347-1 · Cited by 23
Efficient two-electron ansatz for benchmarking quantum chemistry on a quantum computer
Smart, S. E., & Mazziotti, D. A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023048 · Cited by 20
Detecting Many-Body Bell Nonlocality by Solving Ising Models
Frérot, I., & Roscilde, T. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.140504 · Cited by 23
Quantum computing and simulation
Cirac, J. I. (2020) · Nanophotonics · doi:10.1515/nanoph-2020-0351 · Cited by 18
Quantum advantage for differential equation analysis
Kiani, B. T., Palma, G. D., Englund, D. R., Kaminsky, W. M., Marvian, M., & Lloyd, S. (2022) · Physical Review A · doi:10.1103/physreva.105.022415 · Cited by 36
A critical overview on Quantum Computing
Sahoo, S., Mandal, A. K., Samanta, P. K., Basu, I., & Roy, P. (2020) · Journal of quantum computing · doi:10.32604/jqc.2020.015688 · Cited by 20
Smith, K. C., Bhattacharya, A., & Masiello, D. J. (2021) · Physical Review A · doi:10.1103/physreva.104.013707 · Cited by 19
QProv: A provenance system for quantum computing
Weder, B., Barzen, J., Leymann, F., Salm, M., & Wild, K. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12012 · Cited by 30
Gleipnir: toward practical error analysis for Quantum programs
Tao, R., Shi, Y., Yao, J., Hui, J., Chong, F. T., & Gu, R. (2021) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3453483.3454029 · Cited by 33
Improved bound on entropy production in a quantum annealer
Campisi, M., & Buffoni, L. (2021) · Physical review. E · doi:10.1103/physreve.104.l022102 · Cited by 21
Information Scrambling with Conservation Laws
Kudler-Flam, J., Sohal, R., & Nie, L. (2022) · SciPost Physics · doi:10.21468/scipostphys.12.4.117 · Cited by 24
Mato, K., Mengoni, R., Ottaviani, D., & Palermo, G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac73af · Cited by 22
Conditionally Rigorous Mitigation of Multiqubit Measurement Errors
Geller, M. R. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.090502 · Cited by 24
Assembly of a Coreset of Earth Observation Images on a Small Quantum Computer
Otgonbaatar, S., & Datcu, M. P. (2021) · Electronics · doi:10.3390/electronics10202482 · Cited by 19
A comparative study of universal quantum computing models: Toward a physical unification
Wang, D. (2021) · Quantum Engineering · doi:10.1002/que2.85 · Cited by 23
Cooper-pair condensates with nonclassical long-range order on quantum devices
Sager-Smith, L. M., & Mazziotti, D. A. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013003 · Cited by 18
Skyrmion helicity: Quantization and quantum tunneling effects
Psaroudaki, C., & Panagopoulos, C. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.104422 · Cited by 29
Mitigating algorithmic errors in quantum optimization through energy extrapolation
Cao, C., Yu, Y., Wu, Z., Shannon, N., Zeng, B., & Joynt, R. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac969c · Cited by 26
Quantum Software Engineering Landscape and Challenges
Piattini, M. G., & Murillo, J. M. (2022) · Springer eBooks · doi:10.1007/978-3-031-05324-5_2 · Cited by 19
Q2Chemistry: A quantum computation platform for quantum chemistry
Fan, Y., Liu, J., Zeng, X., Xu, Z., Shang, H., Li, Z., & Yang, J. (2022) · JUSTC · doi:10.52396/justc-2022-0118 · Cited by 30
QCSH: A full quantum computer nuclear shell-model package
Lv, P., Wei, S., Xie, H.-N., & Long, G. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-2044-5 · Cited by 20
Error suppression in adiabatic quantum computing with qubit ensembles
Mohseni, N., Narożniak, M., Pyrkov, A. N., Ivannikov, V., Dowling, J. P., & Byrnes, T. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00405-2 · Cited by 20
Boolean satisfiability in quantum compilation
Soeken, M., Meuli, G., Schmitt, B. D. O., Mozafari, F., Riener, H., & Micheli, G. D. (2019) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2019.0161 · Cited by 21
Pedersen, S. P., & Zinner, N. T. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.103.235103 · Cited by 20
Experimental Demonstration of Quantum Tunneling in IBM Quantum ComputerPreprint
Hegade, N. N., Kortikar, N. L., Das, B., Behera, B. K., & Panigrahi, P. K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.07326 · Cited by 40
Guest Editorial Advances in Quantum Communications, Computing, Cryptography, and Sensing
Ng, S. X., Conti, A., Long, G., Muller, P., Sayeed, A. M., Yuan, J., & Hanzo, L. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2973529 · Cited by 19
A deep learning model for noise prediction on near-term quantum devicesPreprint
Zlokapa, A., & Gheorghiu, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.10811 · Cited by 58
Stability of noisy quantum computing devicesPreprint
Dasgupta, S., & Humble, T. S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.09472 · Cited by 17
Quantum Computing for Healthcare: A ReviewPreprint
Qayyum, A., Rasool, R. U., Ahmad, H. F., Rafique, W., Qadir, J., & Anwar, Z. (2022) · doi:10.36227/techrxiv.17198702.v3 · Cited by 18
Potential of quantum machine learning for solving the real-world problem of cancer classification
Ghobadi, M. Z., & Afsaneh, E. (2024) · Discover Applied Sciences · doi:10.1007/s42452-024-06220-6 · Cited by 37
Briceño, R. A., Edwards, R. G., Eaton, M., González-Arciniegas, C., Pfister, O., & Siopsis, G. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043065 · Cited by 36
Quantum Dynamics with Stochastic Non-Hermitian Hamiltonians
Martínez-Azcona, P., Kundu, A., Saxena, A., del Campo, A., & Chenu, A. (2025) · Physical Review Letters · doi:10.1103/5ksl-tjjm · Cited by 24
Hassan, S. S., Khan, L. U., Park, Y. M., Guizani, M., Han, Z., Ratnarajah, T., & Hong, C. S. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3610357 · Cited by 31
Machine learning interatomic potentials at the centennial crossroads of quantum mechanics
Kalita, B., Gökcan, H., & Isayev, O. (2025) · Nature Computational Science · doi:10.1038/s43588-025-00930-6 · Cited by 54
Optimal local unitary encoding circuits for the surface code
Higgott, O., Wilson, M., Hefford, J., Dborin, J., Hanif, F., Burton, S., & Browne, D. E. (2021) · Quantum · doi:10.22331/q-2021-08-05-517 · Cited by 33
Architecture aware compilation of quantum circuits via lazy synthesis
Martiel, S., & de Brugière, T. G. (2022) · Quantum · doi:10.22331/q-2022-06-07-729 · Cited by 33
Diabetes Type 2: Poincar�Data Preprocessing for Quantum Machine Learning
Sierra-Sosa, D., D. Arcila-Moreno, J., Garcia-Zapirain, B., & Elmaghraby, A. (2021) · Computers, Materials & Continua · doi:10.32604/cmc.2021.013196 · Cited by 16
Fitting quantum noise models to tomography data
Onorati, E., Kohler, T., & Cubitt, T. S. (2023) · Quantum · doi:10.22331/q-2023-12-05-1197 · Cited by 37
Efficient quantum simulation of open quantum system dynamics on noisy quantum computers
Sun, S., Shih, L.-C., & Cheng, Y. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad1c27 · Cited by 26
Quantum Error Mitigation Relying on Permutation Filtering
Xiong, Y., Ng, S. X., & Hanzo, L. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3132914 · Cited by 18
Modelling Short-range Quantum Teleportation for Scalable Multi-Core Quantum Computing Architectures
Rodrigo, S., Abadal, S., Almudéver, C. G., & Alarcón, E. (2021) · ACM International Conference on Nanoscale Computing and Communication (NANOCOM) · doi:10.1145/3477206.3477461 · Cited by 18
Miki, T., Okita, R., Shimada, M., Tsukayama, D., & Shirakashi, J. (2022) · AIP Advances · doi:10.1063/5.0077706 · Cited by 17
Fermionic approach to variational quantum simulation of Kitaev spin models
Jahin, A., Li, A. C. Y., Iadecola, T., Orth, P. P., Perdue, G., Macridin, A., Alam, M. S., & Tubman, N. M. (2022) · Physical Review A · doi:10.1103/physreva.106.022434 · Cited by 20
Three phases of quantum annealing: Fast, slow, and very slow
Soriani, A., Nazé, P., Bonança, M. V. S., Gardas, B., & Deffner, S. (2022) · Physical Review A · doi:10.1103/physreva.105.042423 · Cited by 18
Programming physical quantum systems with pulse-level control
Smith, K. N., Ravi, G. S., Alexander, T., Bronn, N. T., Carvalho, A. R. R., Cervera-Lierta, A., Chong, F. T., Chow, J. M., Cubeddu, M., Hashim, A., et al. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.900099 · Cited by 32
Conditional Born machine for Monte Carlo event generation
Kiss, O., Grossi, M., Kajomovitz, E., & Vallecorsa, S. (2022) · Physical Review A · doi:10.1103/physreva.106.022612 · Cited by 28
Variational Entanglement-Assisted Quantum Process Tomography with Arbitrary Ancillary Qubits
Xue, S., Wang, Y., Zhan, J., Wang, Y., Zeng, R., Ding, J., Shi, W., Liu, Y., Liu, Y., Huang, A., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.133601 · Cited by 30
Huffman, E., Vera, M. G., & Banerjee, D. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.094502 · Cited by 33
Performance of quantum kernel on initial learning process
Tomono, T., & Natsubori, S. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00157-8 · Cited by 18
TorchQuantum Case Study for Robust Quantum Circuits
Wang, H., Liang, Z., Gu, J., Li, Z., Ding, Y., Jiang, W., Shi, Y., Pan, D. Z., Chong, F. T., & Han, S. (2022) · International Conference on Computer Aided Design · doi:10.1145/3508352.3561118 · Cited by 46
Gilliam, F. R., Ciesielski, R., Shahinyan, K., Shakya, P., Cunsolo, J., Panchal, J., Król-Józaga, B., Król, M., Kierul, O. S., Bridges, C. R., et al. (2022) · npj Digital Medicine · doi:10.1038/s41746-022-00725-3 · Cited by 19
Quantum Computing: Progress and Innovation
Byrd, G. T., & Ding, Y. (2023) · Computer · doi:10.1109/mc.2022.3217021 · Cited by 16
FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes
Ayanzadeh, R., Alavisamani, N., Das, P., & Qureshi, M. K. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3575693.3575741 · Cited by 32
Navigating the Dynamic Noise Landscape of Variational Quantum Algorithms with QISMET
Ravi, G. S., Smith, K. N., Baker, J. M., Kannan, T., Earnest, N., Javadi-Abhari, A., Hoffmann, H., & Chong, F. T. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3575693.3575739 · Cited by 35
Model-Free Quantum Gate Design and Calibration Using Deep Reinforcement Learning
Shindi, O., Yu, Q., Girdhar, P., & Dong, D. (2023) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2023.3243187 · Cited by 21
Improved Variational Quantum Eigensolver Via Quasidynamical Evolution
Jattana, M. S., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.024047 · Cited by 26
Liu, B., Zhu, L., Yang, Z., & He, G. (2023) · Communications in Computational Physics · doi:10.4208/cicp.oa-2022-0081 · Cited by 19
Signatures of Open and Noisy Quantum Systems in Single-Qubit Quantum Annealing
Morrell, Z., Vuffray, M., Lokhov, A. Y., Bärtschi, A., Albash, T., & Coffrin, C. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.034053 · Cited by 20
Volpe, D., Cirillo, G. A., Zamboni, M., & Turvani, G. (2023) · IEEE Access · doi:10.1109/access.2023.3260765 · Cited by 22
Quantum simulator of link models using spinor dipolar ultracold atoms
Fontana, P., Barros, J. C. P., & Trombettoni, A. (2023) · Physical Review A · doi:10.1103/physreva.107.043312 · Cited by 19
Training circuit-based quantum classifiers through memetic algorithms
Acampora, G., Chiatto, A., & Vitiello, A. (2023) · Pattern Recognition Letters · doi:10.1016/j.patrec.2023.04.008 · Cited by 19
QSurfNet: a hybrid quantum convolutional neural network for surface defect recognition
Mishra, S., & Tsai, C. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03930-5 · Cited by 20
Optimizing the information extracted by a single qubit measurement
Polla, S., Anselmetti, G.-L., & O’Brien, T. E. (2023) · Physical Review A · doi:10.1103/physreva.108.012403 · Cited by 27
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.