Quantum Computing in the NISQ era and beyond
Open accessThe DOI matches its Crossref record; 75 of the 82 references it cites were found in a registry or an index; 25 of the 40 sources its claims cite were checked for support.
Abstract
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.
Overview
CoChat Summary
TL;DR
Preskill introduces the NISQ era—noisy intermediate-scale quantum devices with 50–100 qubits—as a near-term step toward quantum computing, useful for exploring many-body quantum physics but limited by noise and not expected to change the world by itself. He argues that fault-tolerant quantum computing remains distant and that near-term applications, especially hybrid quantum-classical algorithms, are promising but unproven.
Key findings
- NISQ devices will have 50 to a few hundred qubits; 50 qubits is a milestone because it is beyond brute-force simulation by the most powerful existing digital supercomputers. However, with two-qubit gate error rates above 0.1%, circuits with many more than about 1000 gates are not expected to be reliable.
- NISQ technology may be useful for exploring many-body quantum physics and quantum dynamics, and hybrid quantum-classical algorithms such as QAOA and VQE may find approximate solutions to optimization problems, but whether they outperform classical methods is an open question.
- Quantum algorithms offer speedups for problems such as factoring, matrix inversion (HHL runs in O(log N)), recommendation systems (O(poly(k)polylog(mn))), and semidefinite programming (polylog(N)), but many require error correction or QRAM and are probably not feasible in the NISQ era. A note added states that Tang’s quantum-inspired classical algorithm removes the exponential speedup claimed for quantum recommendation systems.
- Fault-tolerant quantum computing is still distant: running algorithms with thousands of protected qubits will require millions of physical qubits, so NISQ should be regarded as a step toward more powerful future quantum technologies.
Methods
- This is a conceptual review and keynote address, based on a Keynote Address at Quantum Computing for Business, 5 December 2017; it is not an empirical study.
- The paper assesses the current status and future potential of quantum computing, discussing hardware platforms, gate errors, qubit counts, quantum algorithms, and fault-tolerance requirements.
- The main analysis is a qualitative synthesis of theoretical arguments, experimental examples, and open questions; no dataset, sample, or statistical analysis is reported.
Limitations
- The paper states it is “the result of an uneasy compromise,” minimizes jargon and technical details for a broader audience, and does not attempt a comprehensive list of references.
- The paper states that NISQ devices have imperfect control and noise, that gate error rates are above 0.1% and may not be maintained in larger devices, that circuit size is limited to roughly 1000 gates, and that validating quantum outputs may be hard.
- Evident from the text: as a keynote-style review, it offers projections and opinions rather than new experimental data or a systematic review; several speedup claims are explicitly open questions, and the recommendation-systems speedup is later undercut by a quantum-inspired classical algorithm.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 Valid · 9 Not valid · 10 Not checked · 85 Own results and interpretations
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“50 qubits is a significant milestone, because that's beyond what can be simulated by brute force using the most powerful existing digital supercomputers.”
What the sources say
- Supportedcites [11] [11] S. Boixo, S. V. Isakov, V. N. Smelyansky, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14, 595-600 (2018), arXiv:1608.00263 (2016), https://doi.org/10.1038/s41567-018-0124-x. - source
The Introduction (p. 1) says that even modest-depth circuits acting on approximately fifty qubits cannot be directly simulated in practice. The Conclusion (p. 12) estimates that state-of-the-art supercomputers fail to simulate universal random circuits beyond approximately 48 qubits at a depth of about 40. The milestone claim is supported in that circuit context. (LLM, conf=0.90)
- Disputedcites [12] [12] S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, arXiv:1612.05903 (2017). - sourceExperimental — accuracy not yet measured
Section 1.2 (p. 4) describes 40–50 qubits as a range where classical simulation is difficult but not impossible, contrary to the claim that 50 qubits is beyond brute-force simulation. Section 1.3 (p. 7) also describes a classical simulation method and says its 2^n time is reasonable for a planned setup with roughly 40 or 50 qubits. (LLM, conf=0.86)
Checked by a reasoning model — may be wrong.
- Supportedcites [13] [13] E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, and R. Wisnieff, Breaking the 49-qubit barrier in the simulation of quantum circuits, arXiv:1710.05867 (2017). - source
The Abstract (p. 1) frames systems of more than 50 qubits as the coming regime and states that 'resource requirements for such calculations on classical computers grow exponentially', with the relevant calculations 'thought to be impossible due to resource requirements'. Section 2.1 (p. 3) gives the concrete brute-force bound: the full state of a 49-qubit system needs 2^49 complex numbers (8 PB in double precision), which 'eliminates the possibility of keeping the entire state in primary storage', and the Feynman-path alternative 'grows to intractable levels very quickly'. The Introduction (p. 2) reinforces this by noting that the state-of-the-art full-state techniques of the time would have required 8 PB (49 qubits) and 1 EB (56 qubits), far beyond the ~64 TB aggregate RAM of Vulcan/Sequoia-class machines. The citing sentence's 'brute force' qualifier matches the paper's own contrast with tensor-contraction-deferral methods, so the attribution holds; only the rhetorical label 'significant milestone' is the citing authors' framing. (LLM, conf=0.83)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Eventually we expect to be able to protect quantum systems and scale up quantum computers using the principle of quantum error correction [10].”
What the sources say
- Supportedcites [10] [10] D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, Proceedings of Symposia in Applied Matthematics 68 (2010), arXiv:0904.2557. - source
The Background (p. 1) says quantum computers need protection from noise and identifies error correction as necessary. Fault-tolerant gates (p. 17) explains that, below an error-rate threshold, arbitrarily accurate quantum computation is possible with polylogarithmic overhead. This supports the expectation of protecting quantum systems and scaling up quantum computers, subject to that threshold. (LLM, conf=0.91)
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“as of now we don't have a convincing theoretical argument or persuasive experimental evidence indicating that quantum annealers can really speed up the time to solution compared to the best classical hardware running the best algorithms for the same problems [28, 29].”
What the sources say
- Partly supportedcites [28] [28] T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup, Science 345, 420-424 (2014), https://doi.org/10.1126/science.1252319. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
- Partly supportedcites [29] [29] S. Mandrà, H. G. Katzgraber, and C. Thomas, The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again), Quantum Sci. Technol. 2, 038501 (2017), arXiv:1703.00622, https://doi.org/10.1088/2058-9565/aa7877. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“In particular, the task of matrix inversion admits an exponential quantum speedup, which could have many applications.”
What the sources say
- Supportedcites [40] [40] A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009), arXiv:0811.3171, https://doi.org/10.1103/PhysRevLett.103.150502. - source
The paper’s Outline says its hardness results imply that the algorithm runs exponentially faster than any classical algorithm for the matrix-inversion task. The performance discussion qualifies this speedup: it is greatest when the condition number and inverse accuracy are polylogarithmic in matrix size, and the algorithm outputs a quantum representation rather than every component of the solution. (LLM, conf=0.92)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“As Laughlin and Pines [8] emphasized in the statement I quoted earlier, we think that simulating such 'strongly correlated' matter is a difficult computational problem, because many very good physicists have tried to solve it for decades and have not succeeded.”
What the sources say
- Supportedcites [8] [8] R. B. Laughlin and D. Pines, The theory of everything, PNAS 97, 28-31 (2000), https://doi.org/10.1073/pnas.97.1.28. - source
In the paper’s main text (page not supplied), Laughlin and Pines say accurate solutions become infeasible for more than about 10 particles because the computational requirements grow rapidly. They also describe notorious failures of approximate calculations for high-temperature superconductors, supporting the claim that simulating such matter is difficult. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
37 more claims · 4 with their cited sources checked
Create a free account to see all 118 claims and to verify the 5 references still open.
- It may state two separate claims as one. 26
- Probably not a substantial claim. 63
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“so-called Noisy Intermediate-Scale Quantum (NISQ) computers already exist today”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [209]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Furthermore, they are challenging to make extensible as required to surpass noisy intermediate-scale quantum (NISQ)-era scales [221] and thereby enable practically relevant quantum computation.”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [221]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Therefore, research on quantum algorithms splits, on the one hand, into algorithms for fault-tolerant quantum computers, which we may think of as a future perfect quantum computer, and, on the other hand, into algorithms for nearterm or noisy-intermediate stage quantum (NISQ) [120] devices of dozens to thousands of physical qubits, that are characterized by the absence of complete fault-tolerance.”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [120]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations within a limited coherence time.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Preskill, 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These hybrid quantum-classical algorithms are specifically designed to minimize the limitations of current quantum hardware, such as decoherence and gate errors, by delegating some computational tasks to classical processors. [8]”
From Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE (2026) · cites this paper as [8]
Experimental — accuracy not yet measured
10 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 2 Opportunities at the entanglement frontier · p. 2
“We don't think that's not true for classical ( i.e. , nonquantum) digital computers”
§ 2 Opportunities at the entanglement frontier · p. 2
“which (as far as we know) can't simulate highly entangled quantum systems.”
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“to be hard for classical computers, but for which quantum algorithmshavebeendiscoveredthatcouldsolvetheseproblemseasily. Thebestknown exampleistheproblemoffindingtheprimefactorsofalargecompositeinteger[1]. Webelievefactoringishardbecausemanysmartpeoplehavetriedformanydecades to find better factoring algorithms and haven…”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779 · cited 1×
“” Much of the literature on the subject builds on quantum algorithms that speed up linear algebra and related tasks [37, 38], and I’ll address such applications in the ensuing subsections.”
BackgroundA variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045 · cited 1×
“antum sensing. Quantum technology has advantages for some kinds of sensing. Quantum systems can sense weak forces with better sensitivity and higher spatial resolution than other sensing technologies [19]; thus quantum sensing could have relatively near-term high-impact applications, to medicine for example. Quantum c…”
BackgroundPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“6.6 Quantummatrixinversion QRAMhasfurtherimplicationsforquantumalgorithms. Inparticular,thetaskofmatrix inversionadmitsanexponentialquantumspeedup,whichcouldhavemanyapplications. ThealgorithmwecallHHL[40](afterthethreeauthorswhofirstdiscusseditnineyears ago) takes as input a succinct representation of a very large N×N…”
BackgroundInfluentialSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“for a while, because of the large number of physical qubits needed. To run algorithms involving thousands of protected qubits we’ll need a number of physical qubits which is in the millions, or more [50]. That’s a very large leap from where we will be for the next few years, with of order a hundred qubits. Crossing th…”
BackgroundProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460 · cited 1×
“Analog quantum simulators have been getting notably more sophisticated, and are already being employed to study quantum dynamics in regimes which may be beyond the reach of classical simulators [51, 52].”
Background
Cited by
Items 5,201–5,300 of 8,640
Meinhardt, N., Dekker, B., Neumann, N. M. P., & Phillipson, F. (2019) · Digitale Welt · doi:10.1007/s42354-019-0242-3 · Cited by 3
Tabu-Driven Quantum Neighborhood Samplers
Moussa, C., Wang, H., Calandra, H., Bäck, T., & Dunjko, V. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-72904-2_7 · Cited by 6
Circulator function in a Josephson junction circuit and braiding of Majorana zero modes
Kim, M. D. (2021) · Scientific Reports · doi:10.1038/s41598-021-81503-1 · Cited by 3
Faujdar, J., & Kumar, A. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-02993-6 · Cited by 4
Geometric manipulation of a decoherence-free subspace in atomic ensembles
Chen, D. S., Luo, S., Wang, Y.-D., Chesi, S., & Choi, M. (2022) · Physical Review A · doi:10.1103/physreva.105.022627 · Cited by 3
Atchade-Adelomou, P., Alonso-Linaje, G., Albó-Canals, J., & Casado-Faulí, D. (2021) · Algorithms · doi:10.3390/a14070194 · Cited by 49
Adaptive random quantum eigensolver
Barraza, N., Pan, C.-Y., Lamata, L., Solano, E., & Albarrán-Arriagada, F. (2022) · Physical Review A · doi:10.1103/physreva.105.052406 · Cited by 3
Machine learning assisted quantum adiabatic algorithm design
Lin, J. H., Ye, M., Zhu, J., & Li, X. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210831 · Cited by 3
Xu, L., Lee, J. T., & Freericks, J. K. (2022) · Physical Review A · doi:10.1103/physreva.105.012406 · Cited by 5
A Modified Deep Q-Learning Algorithm for Control of Two-qubit Systems
Shindi, O., Yu, Q., & Dong, D. (2021) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc52423.2021.9658732 · Cited by 3
Hu, Z., & Kais, S. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100158 · Cited by 5
Vector Field Visualization of Single-Qubit State Tomography
Suau, A., Vuffray, M., Lokhov, A. Y., Cincio, Ł., & Coffrin, C. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00075 · Cited by 4
Variational Quantum Simulation of Valence-Bond Solids
Huerga, D. (2022) · Quantum · doi:10.22331/q-2022-12-13-874 · Cited by 7
Quantum Angle Generator for Image Generation
Rehm, F., Vallecorsa, S., Grossi, M., Borras, K., Krücker, D., Schnake, S., & Verney-Provatas, A. (2022) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec54971.2022.00064 · Cited by 3
A New Era of Quantum Materials Mastery and Quantum Simulators In and Out of Equilibrium
Kennes, D. M., & Rubio, Á. (2023) · Lecture notes in physics · doi:10.1007/978-3-031-32469-7_1 · Cited by 9
Semantifying the PlanQK Platform and Ecosystem for Quantum Applications
Martyniuk, D., Karam, N., Falkenthal, M., Dong, Y., & Paschke, A. (2023) · Studies on the semantic web · doi:10.3233/ssw230017 · Cited by 3
Quantum Chaos and Universal Trotterisation Behaviours in Digital Quantum Simulations
Kargı, C., Manatuly, A., Sieberer, L. M., Dehollain, J. P., Henriques, F., Olsacher, T., Hauke, P., Heyl, M., Zoller, P., & Langford, N. K. (2025) · Quantum · doi:10.22331/q-2025-12-02-1924 · Cited by 20
Maximal entanglement and state transfer using Arthurs–Kelly type interaction for qubits
Sahu, S., & Roy, S. M. (2018) · The European Physical Journal D · doi:10.1140/epjd/e2018-90420-4 · Cited by 3
Using ZDDs in the Mapping of Quantum Circuits
Smith, K. N., Soeken, M., Schmitt, B. D. O., Micheli, G. D., & Thornton, M. A. (2020) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.318.7 · Cited by 5
Iizuka, S., Asai, H., Hattori, J., Fukuda, K., & Mori, T. (2020) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ab769d · Cited by 3
Quantum Information Processing: An Essential Primer
Soljanin, E. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3019340 · Cited by 3
Gradients just got more flexible
Meyer, J. J. (2021) · doi:10.22331/qv-2021-01-26-50 · Cited by 4
Djordjević, I. B. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821982-9.00007-1 · Cited by 7
Time-Dependent Variational Principle for Open Quantum Systems with Artificial Neural Networks
Reh, M., Schmitt, M., & Gärttner, M. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.230501 · Cited by 56
Virtual Logical Qubits: A Compact Architecture for Fault-Tolerant Quantum Computing
Baker, J. M., Duckering, C., Schuster, D., & Chong, F. T. (2021) · IEEE Micro · doi:10.1109/mm.2021.3072789 · Cited by 4
Moving quantum states without swap via intermediate higher-dimensional qudits
Saha, A., Saha, D., & Chakrabarti, A. (2022) · Physical Review A · doi:10.1103/physreva.106.012429 · Cited by 6
Blinding quantum computation using alternative sources
Huang, C., Huang, T., Lin, Q., & Wei, K. (2021) · Physical Review A · doi:10.1103/physreva.104.012614 · Cited by 3
Advancing hybrid quantum-classical algorithms via mean operators
Kim, D., Noh, P., Lee, H., & Moon, E.-G. (2023) · Physical Review A · doi:10.1103/physreva.108.l010401 · Cited by 5
Binary classification of single qubits using quantum machine learning method
Yi, T., Wang, J., & Xu, F. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2006/1/012020 · Cited by 3
Discrimination of quantum states under locality constraints in the many-copy setting
Cheng, H., Winter, A. J., & Yu, N. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518100 · Cited by 3
Training Ensembles of Quantum Binary Neural Networks
Leal, D. V., Lima, T. D., & da Silva, A. J. (2021) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn52387.2021.9534253 · Cited by 3
HybridQ: A Hybrid Simulator for Quantum Circuits
Mandrà, S., Marshall, J., Rieffel, E. G., & Biswas, R. (2021) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00015 · Cited by 23
Fundamental Physics and Computation: The Computer-Theoretic Framework
Miguel-Tomé, S., Lázaro, Á. L. S., & Alonso-Romero, L. (2022) · Universe · doi:10.3390/universe8010040 · Cited by 3
Simultaneous Communication and Parameter Estimation of Pauli Channels
Rehman, J. U., & Shin, H. (2022) · International Conference on Communications · doi:10.1109/icc45855.2022.9838702 · Cited by 4
Digital Quantum Simulation and Circuit Learning for the Generation of Coherent States
Liu, R., Romero, S. V., Oregi, I., Osaba, E., Villar-Rodríguez, E., & Ban, Y. (2022) · Entropy · doi:10.3390/e24111529 · Cited by 5
Generalization Performance of Quantum Metric Learning Classifiers
Kim, J., & Bekiranov, S. (2022) · Biomolecules · doi:10.3390/biom12111576 · Cited by 3
Learning Mixed Strategies in Quantum Games with Imperfect Information
Silva, A., Zabaleta, O. G., & Arizmendi, C. M. (2022) · Quantum Reports · doi:10.3390/quantum4040033 · Cited by 3
Implementation of Socket Programming Simulation Using Quantum Communication Technologies
Özceylan, E., Yaşar, C., & Assanova, B. (2022) · International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT) · doi:10.1109/ismsit56059.2022.9932779 · Cited by 3
Ohtsuki, Y., Mikami, S., Ajiki, T., & Tannor, D. J. (2023) · Journal of the Chinese Chemical Society · doi:10.1002/jccs.202200451 · Cited by 6
Amplitude-based implementation of the unit step function on a quantum computer
Koppe, J., & Wolf, M.-O. (2023) · Physical Review A · doi:10.1103/physreva.107.022606 · Cited by 5
Solving NP-hard Problems with Quantum Annealing
Jiang, J., & Chu, C.-W. (2022) · IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE) · doi:10.1109/ecice55674.2022.10042862 · Cited by 5
The unitary dependence theory for characterizing quantum circuits and states
Hu, Z., & Kais, S. (2023) · Communications Physics · doi:10.1038/s42005-023-01188-y · Cited by 6
Zobov, V. E., & Lundin, A. A. (2023) · Journal of Experimental and Theoretical Physics Letters · doi:10.1134/s0021364023601525 · Cited by 3
Qian, W., Basili, R., Eshaghian‐Wilner, M. M., Khokhar, A., Luecke, G. R., & Vary, J. P. (2023) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw59300.2023.00094 · Cited by 4
Error-Mitigated Quantum Routing on Noisy Devices
Shi, W., & Malaney, R. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437807 · Cited by 5
Mahmud, N., & El‐Araby, E. (2019) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc46988.2019.1570558150 · Cited by 3
Function Approximation with Quantum CircuitPreprint
Delgado, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.00557 · Cited by 3
Bipartite Quantum Interactions: Entangling and Information Processing Abilities
Das, S. (2018) · Louisiana State University · doi:10.31390/gradschool_dissertations.4717 · Cited by 7
Topics in Quantum NetworkingPreprint
Sun, F. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02910 · Cited by 5
Predicting Features of Quantum Systems using Classical Shadows.Preprint
Huang, H.-Y., & Kueng, R. (2019) · arXiv (Cornell University) · Cited by 3
Tensor rank and entanglement of pure quantum statesPreprint
Bruzda, W., Friedland, S., & Życzkowski, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.06854 · Cited by 3
TILT: Achieving Higher Fidelity on a Trapped-Ion Linear-Tape Quantum Computing ArchitecturePreprint
Wu, X.-C., Debroy, D. M., Ding, Y., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.15876 · Cited by 3
Allowing leakage can increase quantum transmissionPreprint
Siddhu, V. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.15116 · Cited by 12
Optimal quantum simulation of open quantum systemsPreprint
Gupta, P., & Chandrashekar, C. M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.07540 · Cited by 8
Gradient-free quantum optimization on NISQ devices.Preprint
Franken, L., Georgiev, B., Mücke, S., Wolter, M., Piatkowski, N., & Bauckhage, C. (2020) · arXiv (Cornell University) · Cited by 4
Enhancing Combinatorial Optimization with Quantum Generative ModelsPreprint
Alcazar, J. A., & Perdomo‐Ortiz, A. (2021) · arXiv (Cornell University) · Cited by 4
Classical simulation of bosonic linear-optical random circuits beyond linear light conePreprint
Oh, C., Lim, Y., Fefferman, B., & Jiang, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.10083 · Cited by 9
Tabu-driven Quantum Neighborhood SamplersPreprint
Moussa, C., Wang, H., Calandra, H., Bäck, T. H. W., & Dunjko, V. (2020) · Leiden Repository (Leiden University) · Cited by 3
Svensson, M., Andersson, M., Grönkvist, M., Vikstål, P., Dubhashi, D., Ferrini, G., & Johansson, G. (2021) · arXiv (Cornell University) · Cited by 3
Randomized Algorithms for Scientific Computing (RASC)
Buluç, A., Kolda, T. G., Wild, S. M., Anitescu, M., DeGennaro, A. M., Jakeman, J. D., Kamath, C., Kannan, R., Lopes, M. E., Martinsson, P., et al. (2021) · Lawrence Berkeley National Laboratory · doi:10.2172/2006805 · Cited by 5
Gleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)Preprint
Tao, R., Shi, Y., Yao, J., Hui, J., Chong, F. T., & Gu, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.06349 · Cited by 3
Trainable Discrete Feature Embeddings for Variational Quantum ClassifierPreprint
Thumwanit, N., Lortaraprasert, C., Yano, H., & Raymond, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.09415 · Cited by 10
Efficient ground state preparation in variational quantum eigensolver with symmetry-breaking layersPreprint
Park, C.-Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.02509 · Cited by 3
Thermal variational quantum simulation on a superconducting quantum processorPreprint
Guo, X., Li, S.-S., Xiao, X., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.06234 · Cited by 3
Stair, N. H., & Evangelista, F. A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.04413 · Cited by 3
Kawashima, Y., Lloyd, E., Coons, M. P., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.07045 · Cited by 3
Hybrid Classical-Quantum method for Diabetic Foot Ulcer ClassificationPreprint
Alavi, A., & Akhoundi, H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.02222 · Cited by 5
Geometric and holonomic quantum computationPreprint
Zhang, J., Kyaw, T. H., Filipp, S., Kwek, L. C., Sjöqvist, E., & Tong, D. M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.03602 · Cited by 2
Deterministic, scalable, and entanglement efficient initialization of arbitrary quantum statesPreprint
Gundlapalli, P., & Lee, J. (2021) · arXiv (Cornell University) · Cited by 3
Tight bounds on the convergence of noisy random circuits to uniform.Preprint
Deshpande, A., Fefferman, B., Gorshkov, A. V., Gullans, M. J., Niroula, P., & Shtanko, O. (2021) · arXiv (Cornell University) · Cited by 3
Quantum Computing for Healthcare: A ReviewPreprint
Qayyum, A., Rasool, R. U., Ahmad, H. F., Rafique, W., Qadir, J., & Anwar, Z. (2021) · doi:10.36227/techrxiv.17198702.v1 · Cited by 4
Proceedings of the East Asia Joint Symposium on Fields and Strings 2021
Online, E. A. J. S. O. F. A. S. 2. O., Iso, S., Itoyama, H., Maruyoshi, K., Nishinaka, T., Oota, T., Sakai, K., Tsuchiya, A., & Yoshioka, R. (2022) · doi:10.1142/13004 · Cited by 3
Altares-López, S., García‐Ripoll, J. J., & Ribeiro, Á. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2208.13246 · Cited by 3
The Q-Day Dilemma and the Quantum Supremacy/Advantage ConjecturePreprint
Raheman, F. (2022) · Research Square · doi:10.21203/rs.3.rs-2331935/v1 · Cited by 5
Gate-based Quantum Computing: An OverviewPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4347584 · Cited by 6
QUBO Formulations of Combinatorial Optimization Problems for Quantum Computing Devices
Quintero, R. A., & Zuluaga, L. F. (2022) · Springer eBooks · doi:10.1007/978-3-030-54621-2_853-1 · Cited by 11
Hybrid Quantum-Classical Computing - A Fusion of Classical And Quantum Computational SubstratesPreprint
Ramouthar, R., & Şeker, H. (2023) · AfricArXiv (OSF Preprints) · doi:10.31730/osf.io/rj7cv · Cited by 8
Lowering the cost of fault-tolerant Quantum Comparator CircuitsPreprint
Donaire, L. M., Ortega, G., Garzón, E. M., & Orts, F. J. (2023) · Research Square · doi:10.21203/rs.3.rs-3407304/v1 · Cited by 3
Solving the Resource-Constrained Project Scheduling Problem (RCPSP) with Quantum AnnealingPreprint
Armas, L. F. P., Creemers, S., & Deleplanque, S. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4689017 · Cited by 3
The Second Quantum Revolution: Unexplored Facts and Latest News
Intonti, K., Viscardi, L., Lamberti, V., Matteucci, A., Micciola, B., Modestino, M. R., & Noce, C. (2024) · Encyclopedia · doi:10.3390/encyclopedia4020040 · Cited by 11
Treespilation: Architecture- and State-Optimised Fermion-to-Qubit MappingsPreprint
Miller, A., Glos, A., & Zimborás, Z. (2024) · Research Square · doi:10.21203/rs.3.rs-4343077/v1 · Cited by 5
Chamorro, N. L. (2024) · Documento ocasional/Documento ocasional - Banco de España · doi:10.53479/36696 · Cited by 10
Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum CircuitsPreprint
Qi, J., Yang, C.-H. H., Samuel, Y.-C., Chen, P., Zenil, H., & Tegner, J. N. (2024) · Research Square · doi:10.21203/rs.3.rs-5442273/v1 · Cited by 4
The Impact of Quantum Computing on Present CryptographyPreprint
Gangwar, S., Pachnanda, V., & Pundir, T. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5017957 · Cited by 3
Zhao, Y., & Liu, D. E. (2025) · PNAS Nexus · doi:10.1093/pnasnexus/pgaf063 · Cited by 5
Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
Gonzalez-Conde, J., Morrell, Z., Vuffray, M., Albash, T., & Coffrin, C. (2024) · arXiv · doi:10.48550/arxiv.2402.17667 · Cited by 3
Yoneda, Y., Shimada, M., Yoshida, A., & Shirakashi, J.-I. (2023) · Applied Physics Express · doi:10.35848/1882-0786/accc6d · Cited by 2
Simple formulation of no-cloning and no-hiding that admits efficient and robust verification
Girling, M., Cîrstoiu, C., & Jennings, D. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023090 · Cited by 2
“However, current devices are inherently noisy with error mitigation and correction being key obstacles to overcome for scalable quantum computing [14–17].”
Implementation of quantum walks on IBM quantum computers
Acasiete, F., Agostini, F. P., Moqadam, J. K., & Portugal, R. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02938-5 · Cited by 76
Sahai, T., Mishra, A., Pasini, J. M., & Jha, S. (2020) · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · doi:10.1609/aaai.v34i02.5524 · Cited by 5
Platform tailored codesign of gate-based quantum simulation
Seetharam, K., Sels, D., & Demler, E. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033059 · Cited by 3
Faryal, M., Rubab, S., Khan, M. M. Z. M., Khan, M. A., Shehab, A., Tariq, U., Chelloug, S. A., & Osman, L. (2022) · Optical and Quantum Electronics · doi:10.1007/s11082-022-03943-x · Cited by 2
RetractedQuantum Circuit Compilation for the Graph Coloring Problem
Oddi, A., Rasconi, R., Baioletti, M., Santucci, V. G., & Beck, H. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-27181-6_26 · Cited by 3
Efficient Mean-Field Simulation of Quantum Circuits Inspired by Density Functional Theory
Bernardi, M. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00607 · Cited by 3
Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent
Srinivasan, D., Chakrabarti, K., Chopra, N., & Dutt, A. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00057 · Cited by 3
Design and Implementation of Quantum Repeaters: Insights on Quantum Entanglement Purification
Mũgambi, K. A., & Okeng'o, G. O. (2023) · Journal of quantum computing · doi:10.32604/jqc.2023.045654 · Cited by 4
Advanced Shuttle Strategies for Parallel QCCD Architectures
Dai, W., Brown, K. A., & Robertazzi, T. G. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3408757 · Cited by 10
Jeon, H., Lee, K., Lee, D., Kim, B., & Kim, T. (2024) · Physics Letters A · doi:10.1016/j.physleta.2024.129642 · Cited by 2
Quantum variations of cyclotomic cosets for cyclic stabiliser codes construction
Yap, E. C., & Ong, K. L. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04451-5 · Cited by 2
Variational quantum cloning machine on an integrated photonic interferometer
Hoch, F., Rodari, G., Caruccio, E., Polacchi, B., Carvacho, G., Giordani, T., Doosti, M., Nicolau, S., Pentangelo, C., Piacentini, S., et al. (2025) · Optica Quantum · doi:10.1364/opticaq.553762 · Cited by 5
Metadata
- Authors
- Preskill, J.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Preskill, John
- ORCID
- Preskill, John
- Venue
- Quantum
- Published
- 2018-08-06
- Volume
- 2
- Pages
- 79
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2781738013
- Cited by
- 8,830
- References
- 82
- Citations by year
- 2026: 1366 · 2025: 1674 · 2024: 1435 · 2023: 1263 · 2022: 1053 · 2021: 1014 · 2020: 638 · 2019: 322 · 2018: 59
- FWCI
- 286.68
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Bulletin of the American Physical Society
- Funders
- National Science Foundation
- U.S. Department of Energy
- Simons Foundation
- Intelligence Advanced Research Projects Activity
- Institute for Quantum Information and Matter, California Institute of Technology
- Kavli Institute for Theoretical Physics, University of California, Santa Barbara
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- NISQ devices, fault-tolerant quantum computing, quantum advantage, quantum computing hardware
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.