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 1,501–1,600 of 8,640
Integrable Digital Quantum Simulation: Generalized Gibbs Ensembles and Trotter Transitions
Vernier, E., Bertini, B., Giudici, G., & Piroli, L. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.260401 · Cited by 54
Accelerated quantum Monte Carlo with probabilistic computers
Chowdhury, S., Camsari, K. Y., & Datta, S. (2023) · Communications Physics · doi:10.1038/s42005-023-01202-3 · Cited by 40
Quantum Graph Neural Network Models for Materials Search
Ryu, J.-Y., Elala, E., & Rhee, J. K. (2023) · Materials · doi:10.3390/ma16124300 · Cited by 48
A New Quantum Circuits of Quantum Convolutional Neural Network for X-Ray Images Classification
Yousif, M., Al‐Khateeb, B., & García-Zapirain, B. (2024) · IEEE Access · doi:10.1109/access.2024.3396411 · Cited by 43
Quantum state tomography using quantum machine learning
Innan, N., Siddiqui, O. I., Arora, S., Ghosh, T., Kocak, Y. P., Paragas, D., Galib, A. A. O., Khan, M. A.-Z., & Bennai, M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00162-3 · Cited by 48
Takase, K., Hanamura, F., Nagayoshi, H., Bourassa, J. E., Alexander, R. N., Kawasaki, A., Asavanant, W., Endo, M., & Furusawa, A. (2024) · Physical Review A · doi:10.1103/physreva.110.012436 · Cited by 46
Recent Advances in Deep Learning for Channel Coding: A Survey
Matsumine, T., & Ochiai, H. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3472094 · Cited by 46
Abdul‐Al, M., Kyeremeh, G. K., Qahwaji, R., Ali, N. T., & Abd‐Alhameed, R. A. (2024) · IEEE Access · doi:10.1109/access.2024.3486552 · Cited by 43
Symmetry-Protected Topological Phases of Mixed States in the Doubled Space
Ma, R., & Turzillo, A. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010348 · Cited by 96
Experimental quantum-enhanced kernel-based machine learning on a photonic processor
Yin, Z., Agresti, I., de Felice, G., Brown, D., Toumi, A., Pentangelo, C., Piacentini, S., Crespi, A., Ceccarelli, F., Osellame, R., et al. (2025) · Nature Photonics · doi:10.1038/s41566-025-01682-5 · Cited by 83
The potential of multidimensional photonic computing
Bente, I., Taheriniya, S., Lenzini, F., Brückerhoff‐Plückelmann, F., Kues, M., Bhaskaran, H., Wright, C. D., & Pernice, W. H. P. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00843-3 · Cited by 69
Wu, Q., Ribezzo, D., Sciullo, G. D., Cocchi, S., Shaji, D. A., Zischler, L., Luis, R. S., Serena, P., Lasagni, C., Bononi, A., et al. (2025) · Light Science & Applications · doi:10.1038/s41377-025-01982-z · Cited by 54
Quantum-Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits
Chen, M.-C., Li, R., Gan, L., Zhu, X., Yang, G., Lu, C., & Pan, J.-W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.080502 · Cited by 36
Entanglement accessibility measures for the quantum Internet
Gyöngyösi, L., & Imre, S. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2605-y · Cited by 33
Realizing Quantum Algorithms on Real Quantum Computing Devices
Almudéver, C. G., Lao, L., Wille, R., & Guerreschi, G. G. (2020) · Design, Automation, and Test in Europe · doi:10.23919/date48585.2020.9116240 · Cited by 35
Quantum Simulations with Complex Geometries and Synthetic Gauge Fields in a Trapped Ion Chain
Manovitz, T., Shapira, Y., Akerman, N., Stern, A., & Ozeri, R. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020303 · Cited by 41
AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation
Cheng, J., Deng, H., & Qia, X. (2020) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca45697.2020.00052 · Cited by 37
Quantum Differentially Private Sparse Regression Learning
Du, Y., Hsieh, M.-H., Liu, T., You, S., & Tao, D. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3164726 · Cited by 46
Generative machine learning with tensor networks: Benchmarks on near-term quantum computers
Wall, M. L., Abernathy, M. R., & Quiroz, G. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023010 · Cited by 44
Readout rebalancing for near-term quantum computers
Hicks, R., Bauer, C., & Nachman, B. P. (2021) · Physical Review A · doi:10.1103/physreva.103.022407 · Cited by 34
Accelerated Quantum Monte Carlo with Mitigated Error on Noisy Quantum Computer
Yang, Y., Lu, B.-N., & Li, Y. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040361 · Cited by 41
High-Performance Reservoir Computing With Fluctuations in Linear Networks
Nokkala, J., Martínez‐Peña, R., Zambrini, R., & Soriano, M. C. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3105695 · Cited by 39
Automating the Comparison of Quantum Compilers for Quantum Circuits
Salm, M., Barzen, J., Leymann, F., Weder, B., & Wild, K. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-87568-8_4 · Cited by 43
Classical–Quantum Transfer Learning for Image Classification
Mogalapalli, H., Abburi, M., Nithya, B., & Bandreddi, S. K. V. (2021) · SN Computer Science · doi:10.1007/s42979-021-00888-y · Cited by 37
Simulation of Quantum Many-Body Dynamics with Tensor Processing Units: Floquet Prethermalization
Morningstar, A., Hauru, M., Beall, J., Ganahl, M., Lewis, A. G. M., Khemani, V., & Vidal, G. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020331 · Cited by 46
Optimal Control of Families of Quantum Gates
Sauvage, F., & Mintert, F. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050507 · Cited by 31
“For instance, in the context of Noisy-Intermediate Scale Quantum (NISQ) devices [14], augmenting the set of available elementary gates allows for more compact compilation of quantum circuits, i.”
BackgroundSimulating excited states of the Lipkin model on a quantum computer
Hlatshwayo, M. Q., Zhang, Y., Wibowo, H., LaRose, R., Lacroix, D., & Литвинова, Е. (2022) · Physical Review C · doi:10.1103/physrevc.106.024319 · Cited by 38
Distributed quantum algorithm for Simon's problem
Tan, J., Xiao, L., Qiu, D., Luo, L., & Mateus, P. (2022) · Physical Review A · doi:10.1103/physreva.106.032417 · Cited by 55
Hilbert space as a computational resource in reservoir computing
Kalfus, W. D., Ribeill, G. J., Rowlands, G. E., Krovi, H., Ohki, T., & Govia, L. C. G. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033007 · Cited by 55
Quantum Error Correction: Noise-Adapted Techniques and Applications
Jayashankar, A., & Mandayam, P. (2022) · Journal of the Indian Institute of Science · doi:10.1007/s41745-022-00332-x · Cited by 53
Better Than Worst-Case Decoding for Quantum Error Correction
Ravi, G. S., Baker, J. M., Fayyazi, A., Lin, S. F., Javadi-Abhari, A., Pedram, M., & Chong, F. T. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3575693.3575733 · Cited by 62
A GNN-based predictor for quantum architecture search
He, Z., Zhang, X., Chen, C., Huang, Z., Zhou, Y., & Situ, H. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03881-x · Cited by 46
Avoiding Irreversibility: Engineering Resonant Conversions of Quantum Resources
Korzekwa, K., Chubb, C. T., & Tomamichel, M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.110403 · Cited by 34
Spin chains for two-qubit teleportation
Apollaro, T. J. G., Almeida, G. M. A., Lorenzo, S., Ferraro, A., & Paganelli, S. (2019) · Physical Review A · doi:10.1103/physreva.100.052308 · Cited by 31
The Mathematics of Text Structure
Coecke, B. (2021) · Outstanding contributions to logic · doi:10.1007/978-3-030-66545-6_6 · Cited by 60
Semiconductor Spin Qubits — A Scalable Platform for Quantum Computing?
Bluhm, H., & Schreiber, L. R. (2019) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2019.8702477 · Cited by 38
Quantum natural gradient generalised to non-unitary circuitsPreprint
Koczor, B., & Benjamin, S. C. (2019) · arXiv (Cornell University) · Cited by 35
Bootstrapping quantum process tomography via a perturbative ansatz
Govia, L. C. G., Ribeill, G. J., Ristè, D., Ware, M., & Krovi, H. (2020) · RePEc: Research Papers in Economics · Cited by 32
Cryptography in Post Quantum Computing EraPreprint
Sood, N. C. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4705470 · Cited by 57
Quantum convolutional neural networks for multi-channel supervised learning
(2023) · doi:10.1007/s42484-023-00130-3 · Cited by 32
Optimal quantum reservoir computing for the noisy intermediate-scale quantum era
Domingo, L., Carlo, G. G., & Borondo, F. (2022) · Physical review. E · doi:10.1103/physreve.106.l043301 · Cited by 48
HyperQUEEN: Hyperspectral Quantum Deep Network For Image Restoration
Lin, C.-H., & Chen, Y.-Y. (2023) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2023.3274355 · Cited by 45
Similarity-based parameter transferability in the quantum approximate optimization algorithm
Galda, A., Gupta, E., Falla, J., Liu, X., Lykov, D., Alexeev, Y., & Safro, I. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1200975 · Cited by 58
Budiyono, A. (2023) · Physical Review A · doi:10.1103/physreva.108.012431 · Cited by 38
Variational Quantum Simulators Based on Waveguide QED
Tabares, C., Heras, A. M. D. L., Tagliacozzo, L., Porras, D., & González-Tudela, A. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.073602 · Cited by 44
Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts
Brandhofer, S., Polian, I., & Krsulich, K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3347106 · Cited by 70
Asynchronous entanglement routing for the quantum internet
Yang, Z., Ghubaish, A., Jain, R. K., Shapourian, H., & Shabani, A. (2024) · AVS Quantum Science · doi:10.1116/5.0172819 · Cited by 35
Quantum Gaussian process regression for Bayesian optimization
Rapp, F., & Roth, M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00138-9 · Cited by 45
Variational quantum simulation of U(1) lattice gauge theories with qudit systems
Popov, P. P., Meth, M., Lewenstein, M., Hauke, P., Ringbauer, M., Zohar, E., & Kasper, V. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013202 · Cited by 47
Revisiting the Mapping of Quantum Circuits: Entering the Multi-core Era
Escofet, P., Ovide, A., Bandić, M., Prielinger, L., van Someren, H., Feld, S., Alarcón, E., Abadal, S., & Almudéver, C. G. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3655029 · Cited by 54
Chowdhury, T. A., Yu, K., Shamim, M. A., Kabir, M. L., & Sufian, R. S. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033107 · Cited by 52
Noisy intermediate-scale quantum simulation of the one-dimensional wave equation
Wright, L., Keever, C. M., First, J. T., Johnston, R., Tillay, J., Chaney, S., Rosenkranz, M., & Lubasch, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043169 · Cited by 58
Cyclic solid-state quantum battery: thermodynamic characterization and quantum hardware simulation
Razzoli, L., Gemme, G., Khomchenko, I., Sassetti, M., Ouerdane, H., Ferraro, D., & Benenti, G. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ad9ed4 · Cited by 44
Explaining quantum circuits with Shapley values: towards explainable quantum machine learning
Heese, R., Gerlach, T., Mücke, S., Müller, S., Jakobs, M., & Piatkowski, N. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00254-8 · Cited by 77
Formal constraint-based compilation for noisy intermediate-scale quantum systems
Murali, P., Javadi-Abhari, A., Chong, F. T., & Martonosi, M. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.02.005 · Cited by 39
Wave-function positivization via automatic differentiation
Torlai, G., Carrasquilla, J., Fishman, M., Melko, R. G., & Fisher, M. P. A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.032060 · Cited by 48
Quantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 74
Introduction to Quantum Computing
Marella, S. T., & Parisa, H. S. K. (2020) · IntechOpen eBooks · doi:10.5772/intechopen.94103 · Cited by 52
Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
Guo, C., Zhao, Y., & Huang, H.-L. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.070502 · Cited by 29
Quantum Technology for Economists
Hull, I., Sattath, O., Diamanti, E., & Wendin, G. P. (2024) · Contributions to economics · doi:10.1007/978-3-031-50780-9 · Cited by 36
Quantum machine learning with adaptive linear optics
Chabaud, U., Markham, D., & Sohbi, A. (2021) · Quantum · doi:10.22331/q-2021-07-05-496 · Cited by 61
Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale
Nguyen, T., Lyakh, D. I., Dumitrescu, E., Clark, D., Larkin, J., & McCaskey, A. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3547334 · Cited by 50
Parity Quantum Optimization: Compiler
Ender, K., ter Hoeven, R., Niehoff, B. E., Drieb-Schön, M., & Lechner, W. (2023) · Quantum · doi:10.22331/q-2023-03-17-950 · Cited by 52
Predicting quantum dynamical cost landscapes with deep learning
Dalgaard, M., Motzoi, F., & Sherson, J. F. (2022) · Physical Review A · doi:10.1103/physreva.105.012402 · Cited by 28
Variational Quantum Circuits for Machine Learning. An Application for the Detection of Weak Signals
Griol-Barres, I., Milla, S., Cebrián, A., Mansoori, Y., & Millet, J. (2021) · Applied Sciences · doi:10.3390/app11146427 · Cited by 40
Engineering the microwave to infrared noise photon flux for superconducting quantum systems
Danilin, S., Barbosa, J., Farage, M., Zhao, Z., Shang, X., Burnett, J., Ridler, N., Li, C., & Weides, M. P. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00121-6 · Cited by 29
Sugisaki, K., Sakai, C., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2021) · Physical Chemistry Chemical Physics · doi:10.1039/d1cp03156b · Cited by 36
Quantum information scrambling: from holography to quantum simulators
Bhattacharyya, A., Joshi, L. K., & Sundar, B. (2022) · The European Physical Journal C · doi:10.1140/epjc/s10052-022-10377-y · Cited by 38
Quantum expectation-value estimation by computational basis sampling
Kohda, M., Imai, R., Kanno, K., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033173 · Cited by 51
QIRO: A Static Single Assignment-based Quantum Program Representation for Optimization
Ittah, D., Häner, T., Kliuchnikov, V., & Hoefler, T. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3491247 · Cited by 58
Sugisaki, K., Kato, T., Minato, Y., Okuwaki, K., & Mochizuki, Y. (2022) · Physical Chemistry Chemical Physics · doi:10.1039/d1cp04318h · Cited by 36
Hybrid quantum-classical algorithm for computing imaginary-time correlation functions
Sakurai, R., Mizukami, W., & Shinaoka, H. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023219 · Cited by 38
Bandić, M., Feld, S., & Almudéver, C. G. (2022) · Design, Automation, and Test in Europe · doi:10.23919/date54114.2022.9774643 · Cited by 57
Quantum science: a review and current research trends
Ye, Z., & Lu, Y. (2022) · Journal of Management Analytics · doi:10.1080/23270012.2022.2089064 · Cited by 44
Tamiya, S., & Yamasaki, H. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00592-6 · Cited by 57
Bridging the quantum divides: a chance to repair classic(al) mistakes?
Holter, C. T., Inglesant, P., Srivastava, R., & Jirotka, M. D. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac8db6 · Cited by 49
rustworkx: A High-Performance Graph Library for Python
Treinish, M., Carvalho, I., Tsilimigkounakis, G., & Sá, N. (2022) · The Journal of Open Source Software · doi:10.21105/joss.03968 · Cited by 57
A Quantum-Classical Hybrid Solution for Deep Anomaly Detection
Wang, M., Huang, A., Liu, Y., Xu-ming, Y., Wu, J., & Wang, S. (2023) · Entropy · doi:10.3390/e25030427 · Cited by 45
Quantum pattern recognition on real quantum processing units
Das, S., Zhang, J., Martina, S., Suter, D., & Caruso, F. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00093-x · Cited by 38
Policy gradients using variational quantum circuits
Sequeira, A., Santos, L. P., & Barbosa, L. S. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00101-8 · Cited by 58
Solving larger maximum clique problems using parallel quantum annealing
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03962-x · Cited by 44
Q-DDCA: Decentralized Dynamic Congestion Avoid Routing in Large-Scale Quantum Networks
Chen, L., Xue, K., Li, J., Li, R., Yu, N., Sun, Q., & Lu, J. (2023) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2023.3285093 · Cited by 33
Cutting multi-control quantum gates with ZX calculus
Ufrecht, C., Periyasamy, M., Rietsch, S., Scherer, D. D., Plinge, A., & Mutschler, C. (2023) · Quantum · doi:10.22331/q-2023-10-23-1147 · Cited by 59
Probabilistic Modeling with Matrix Product States
STOKES, J. M., & Terilla, J. (2019) · Entropy · doi:10.3390/e21121236 · Cited by 46
Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits
Lacroix, N., Hofele, L., Remm, A., Benhayoune-Khadraoui, O., McDonald, A., Shillito, R., Lazar, S., Hellings, C., Swiadek, F., Colao-Zanuz, D., et al. (2023) · arXiv · doi:10.48550/arxiv.2309.07060 · Cited by 29
Teplukhin, A., Kendrick, B. K., & Babikov, D. (2020) · Physical Chemistry Chemical Physics · doi:10.1039/d0cp04272b · Cited by 28
Liu, Z., Shen, P.-X., Li, W., Duan, L.-M., & Deng, D.-L. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/aca55d · Cited by 34
El‐Araby, E., Mahmud, N., Jeng, M., MacGillivray, A., Chaudhary, M., Nobel, A., Islam, I., Levy, D., Kneidel, D., Watson, M. R., et al. (2023) · IEEE Transactions on Computers · doi:10.1109/tc.2023.3248276 · Cited by 29
Tunable coupler to fully decouple and maximally localize superconducting qubits
Heunisch, L., Eichler, C., & Hartmann, M. J. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.064037 · Cited by 42
Network intrusion detection based on variational quantum convolution neural network
Gong, C., Guan, W., Zhu, H., Gani, A., & Qi, H. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-05919-y · Cited by 43
Hatomura, T. (2024) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ad38f1 · Cited by 50
Quantum machine learning for drowsiness detection with EEG signals
Lins, I. D., Araújo, L. M. M., Maior, C. B. S., Ramos, P. M. D. S., Moura, M. J. D. C., Ferreira–Martins, A. J., Chaves, R., & Canabarro, A. (2024) · Process Safety and Environmental Protection · doi:10.1016/j.psep.2024.04.032 · Cited by 38
Fault-Tolerant Code-Switching Protocols for Near-Term Quantum Processors
Butt, F., Heußen, S., Rispler, M., & Müller, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020345 · Cited by 41
Qubernetes: Towards a unified cloud-native execution platform for hybrid classic-quantum computing
Stirbu, V., Kinanen, O., Haghparast, M., & Mikkonen, T. (2024) · Information and Software Technology · doi:10.1016/j.infsof.2024.107529 · Cited by 49
Das, A., Palesi, M., Kim, J., & Pande, P. P. (2024) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2024.3445829 · Cited by 43
Enhanced Many-Body Quantum Scars from the Non-Hermitian Fock Skin Effect
Shen, R., Qin, F., Desaules, J.-Y., Papić, Z., & Lee, C. H. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.216601 · Cited by 43
Evolutionary Algorithms and Quantum Computing: Recent Advances, Opportunities, and Challenges
Rehman, J. U., Ulum, M. S., Shaffar, A. W., Hakim, A. A., Mujirin, Abdullah, Z., Al-Hraishawi, H., Chatzinotas, S., & Shin, H. (2025) · IEEE Access · doi:10.1109/access.2025.3530952 · Cited by 40
Pelofske, E. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb029 · Cited by 61
Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits
Lacroix, N., Hofele, L., Remm, A., Benhayoune-Khadraoui, O., McDonald, A., Shillito, R., Lazar, S., Hellings, C., Swiadek, F., Zanuz, D. C., et al. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.120601 · Cited by 65
Small, Highly Accurate Quantum Processor for Intermediate-Depth Quantum Simulations
Lysne, N., Kuper, K. W., Poggi, P. M., Deutsch, I., & Jessen, P. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.230501 · Cited by 28
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.