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 4,101–4,200 of 8,640
Non-adaptive measurement-based quantum computation on IBM Q
Mackeprang, J., Bhatti, D., & Barz, S. (2023) · Scientific Reports · doi:10.1038/s41598-023-41025-4 · Cited by 6
Quantum algorithm for de novo DNA sequence assembly based on quantum walks on graphs
Varsamis, G. D., Karafyllidis, I. G., Gilkes, K. M., Arranz, U., Martin-Cuevas, R., Calleja, G., Wong, J., Jessen, H. C., Dimitrakis, P., Kolovos, P., et al. (2023) · Biosystems · doi:10.1016/j.biosystems.2023.105037 · Cited by 10
Modular Cluster Circuits for the Variational Quantum Eigensolver
Ghasempouri, S. E., Dueck, G. W., & Baerdemacker, S. D. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c03015 · Cited by 12
Mapping Molecular Hamiltonians into Hamiltonians of Modular cQED Processors
Lyu, N., Miano, A., Tsioutsios, I., Cortiñas, R. G., Jung, K. A., Wang, Y., Hu, Z., Geva, E., Kais, S., & Batista, V. S. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00620 · Cited by 7
Zhao, T., Sun, C., Cohen, A., STOKES, J. M., & Veerapaneni, S. (2023) · Quantitative Finance · doi:10.1080/14697688.2023.2259954 · Cited by 13
MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
Lee, J., Kang, Y., Lee, Y.-S., Chung, B., & Choi, D. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04142-7 · Cited by 7
SoK: A First Order Survey of Quantum Supply Dynamics and Threat Landscapes
Das, S., Chatterjee, A., & Ghosh, S. (2023) · Hardware and Architectural Support for Security and Privacy · doi:10.1145/3623652.3623664 · Cited by 8
Zardini, E., Blanzieri, E., & Pastorello, D. (2023) · PLoS ONE · doi:10.1371/journal.pone.0287869 · Cited by 7
Software for Massively Parallel Quantum Computing
Nguyen, T., Arya, D., Doherty, M. W., Herrmann, N., Kuhlmann, J., Preis, F., Scott, P., & Yin, S. (2023) · Springer eBooks · doi:10.1007/978-3-031-37966-6_6 · Cited by 10
Model-Driven Optimization for Quantum Program Synthesis with MOMoT
Gemeinhardt, F., Eisenberg, M., Klikovits, S., & Wimmer, M. (2023) · ACM/IEEE International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C) · doi:10.1109/models-c59198.2023.00100 · Cited by 9
The Quantum Amplitude Estimation Algorithms on Near-Term Devices: A Practical Guide
Maronese, M., Incudini, M., Asproni, L., & Prati, E. (2023) · Quantum Reports · doi:10.3390/quantum6010001 · Cited by 18
Training and meta-training an ensemble of binary neural networks with quantum computing
Leal, D. V., Araujo, I. F., & da Silva, A. J. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.127169 · Cited by 9
Chemically Accurate Potential Curves for H2 Molecules Using Explicitly Correlated Qubit-ADAPT
Volkmann, H., Sathyanarayanan, R., Sáenz, A., Jansen, K., & Kühn, S. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c01281 · Cited by 8
Continuously monitored quantum systems beyond Lindblad dynamics
Lami, G., Santini, A., & Collura, M. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad1f0a · Cited by 13
Limitations of probabilistic error cancellation for open dynamics beyond sampling overhead
Ma, Y., & Kim, M. S. (2024) · Physical Review A · doi:10.1103/physreva.109.012431 · Cited by 13
PQCLP: Parameterized quantum circuit based link prediction in dynamic networks
Singh, N., Kumar, M., & Biswas, B. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110210 · Cited by 11
Adaptive variational ground state preparation for spin-1 models on qubit-based architectures
Getelina, J. C., Wang, C., Iadecola, T., Yao, Y., & Orth, P. P. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.085128 · Cited by 6
Stabilizer Formalism for Operator Algebra Quantum Error Correction
Dauphinais, G., Kribs, D. W., & Vasmer, M. (2024) · Quantum · doi:10.22331/q-2024-02-21-1261 · Cited by 22
Proceedings of the 8th International Conference on Attosecond Science and Technology
Argenti, L., Chini, M., & Li, F. (2024) · Springer proceedings in physics · doi:10.1007/978-3-031-47938-0 · Cited by 8
Zong, Z., Huai, S., Cai, T., Jin, W., Zhan, Z., Zhang, Z., Bu, K., Sui, L., Fei, Y., Zheng, Y.-C., et al. (2024) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-023-2315-0 · Cited by 9
Quantum self-organizing feature mapping neural network algorithm based on Grover search algorithm
Ye, Z., Yu, K., Guo, G., & Lin, S. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.129690 · Cited by 9
Probing Quantum Telecloning on Superconducting Quantum Processors
Pelofske, E., Bärtschi, A., Eidenbenz, S., Garcia, B., & Kiefer, B. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3391654 · Cited by 9
Maxwell Demon and Einstein–Podolsky–Rosen Steering
Hu, M., Hu, X., & Zhang, Y.-S. (2024) · Chinese Physics Letters · doi:10.1088/0256-307x/41/5/050302 · Cited by 7
Demonstrating quantum computation for quasiparticle band structures
Ohgoe, T., Iwakiri, H., Kohda, M., Ichikawa, K., Nakagawa, Y. O., Valencia, H., & Koh, S. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.l022022 · Cited by 11
Relations between Markovian and non-Markovian correlations in multitime quantum processes
Zambon, G., & Soares-Pinto, D. O. (2024) · Physical Review A · doi:10.1103/physreva.109.062401 · Cited by 7
Constructive plaquette compilation for the parity architecture
ter Hoeven, R., Niehoff, B. E., Kale, S., & Lechner, W. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad5a36 · Cited by 10
Superconducting Quantum Simulation for Many-Body Physics beyond Equilibrium
Yao, Y., & Xiang, L. (2024) · Entropy · doi:10.3390/e26070592 · Cited by 9
Single entanglement connection architecture between multi-layer bipartite hardware efficient ansatz
Zhang, S., Qin, Z., Yang, Z., Li, R., Du, C., & Xiao, Z. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad64fb · Cited by 11
Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
Pelofske, E., Russo, V., LaRose, R., Mari, A., Strano, D., Bärtschi, A., Eidenbenz, S., & Zeng, W. J. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3680290 · Cited by 14
QAOA-Assisted Benders' Decomposition for Mixed-integer Linear Programming
Zhao, Z., Fan, L., Guo, Y., Wang, Y., Han, Z., & Hanzo, L. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10622474 · Cited by 9
An introduction to variational quantum algorithms for combinatorial optimization problems
Grange, C., Poss, M., & Bourreau, E. (2024) · Annals of Operations Research · doi:10.1007/s10479-024-06253-5 · Cited by 12
Combining Parameterized Pulses and Contextual Subspace for More Practical VQE
Liang, Z., Song, Z., Cheng, J., Ren, H., Hao, T., Yang, R., Shi, Y., & Li, T. (2024) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3649329.3656245 · Cited by 11
Wasserstein complexity of quantum circuits
Li, L., Bu, K., Koh, D. E., Jaffe, A. M., & Lloyd, S. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ade381 · Cited by 29
Effective Hamiltonian theory of the geometric evolution of quantum systems
Shkolnikov, V. O., & Burkard, G. (2020) · Physical Review A · doi:10.1103/physreva.101.042101 · Cited by 8
A quantum solution for efficient use of symmetries in the simulation of many-body systems
Schmitz, A. T., & Johri, S. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0232-1 · Cited by 9
The Classical Capacity of a Quantum Erasure Queue-Channel
Mandayam, P., Jagannathan, K., & Chatterjee, A. (2019) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2019.8815462 · Cited by 6
Quantum State Merging for Arbitrarily Small-Dimensional Systems
Yamasaki, H., & Murao, M. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2889829 · Cited by 17
Noisy three-player dilemma game: robustness of the quantum advantage
Kairon, P., Thapliyal, K., Srikanth, R., & Pathak, A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02830-2 · Cited by 13
Biosensors for Biomolecular Computing: a Review and Future Perspectives
Aiassa, S., Terracciano, R., Carrara, S., & Demarchi, D. (2020) · BioNanoScience · doi:10.1007/s12668-020-00764-8 · Cited by 7
Bastidas, V. M., Haug, T., Gravel, C., Kwek, L. C., Munro, W. J., & Nemoto, K. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.075140 · Cited by 6
A probabilistic spin annihilation method for quantum chemical calculations on quantum computers
Sugisaki, K., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2020) · Physical Chemistry Chemical Physics · doi:10.1039/d0cp03745a · Cited by 6
Protection of qubits by nonlinear resonances
Saini, R. K., Sehgal, R., & Jain, S. R. (2022) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-022-02561-6 · Cited by 6
Sublinear Classical and Quantum Algorithms for General Matrix Games
Li, T., Wang, C., Chakrabarti, S., & Wu, X. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i10.17028 · Cited by 26
Explorations in Quantum Neural Networks with Intermediate Measurements.
Franken, L., & Georgiev, B. (2020) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 7
Effect of electron-irradiation on layered quantum materials
Dash, A. K., Mondal, M., Verma, M., Kumar, K. S., & Singh, A. (2021) · Bulletin of Materials Science · doi:10.1007/s12034-021-02516-0 · Cited by 6
Circuit centric quantum architecture design
Azad, U., Papneja, A., Saini, R. K., Behera, B. K., & Panigrahi, P. K. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12004 · Cited by 6
Research progress of measurement-based quantum computation
Zhang, S., Zhang, X., & Li, L.-Z. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210923 · Cited by 8
Khalid, I., Weidner, C. A., JONCKHEERE, E. A., Schirmer, S. G., & Langbein, F. C. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683463 · Cited by 5
Chen, S., Yu, W., Zeng, P., & Flammia, S. T. (2021) · University of Chicago · doi:10.6082/cbqhv-2k196 · Cited by 15
Variational learning of quantum ground states on spiking neuromorphic hardware
Klassert, R., Baumbach, A., Petrovici, M. A., & Gärttner, M. (2022) · iScience · doi:10.1016/j.isci.2022.104707 · Cited by 7
Reliability Analysis of ASIC Designs With Xilinx SRAM-Based FPGAs
Aranda, L. A., Ruano, Ó., García-Herrero, F., et al. (2021) · IEEE Access · doi:10.1109/access.2021.3119633 · Cited by 6
Shiba, K., Chen, C.-C., Sogabe, M., Sakamoto, K., & Sogabe, T. (2021) · Applied Sciences · doi:10.3390/app112311386 · Cited by 7
Large scale multi-node simulations of ℤ2 gauge theory quantum circuits using Google Cloud Platform
Gustafson, E., Holzman, B., Kowalkowski, J., Lamm, H., Li, A. C. Y., Perdue, G., Isakov, S. V., Martin, O., Thomson, R., Beall, J., et al. (2021) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00012 · Cited by 16
Optimizing Link-Level Entanglement Generation in Quantum Networks with Unequal Link Lengths
Pathumsoot, P., Benchasattabuse, N., Satoh, R., Hajdušek, M., Meter, R. V., & Suwanna, S. (2021) · International Computer Science and Engineering Conference · doi:10.1109/icsec53205.2021.9684634 · Cited by 12
A hybrid algorithm to solve linear systems of equations with limited qubit resources
Gao, F., Wu, G., Yang, M., Cui, W., & Shuang, F. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03388-3 · Cited by 9
Lim, H., Jeon, H.-N., Rhee, J. K., Oh, B., & No, K. T. (2022) · Scientific Reports · doi:10.1038/s41598-022-11537-6 · Cited by 9
Koch, C. P., Boscain, U., Calarco, T., Dirr, G., Filipp, S., Glaser, S. J., Kosloff, R., Montangero, S., Schulte-Herbrüggen, T., Sugny, D., et al. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00138-x · Cited by 405
Qiskit As a Simulation Platform for Measurement-based Quantum Computation
Kashif, M., & Al-Kuwari, S. M. (2022) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c54293.2022.00037 · Cited by 10
A Distributed Architecture for Secure Delegated Quantum Computation
Ma, S., Zhu, C., Quan, D., & Nie, M. (2022) · Entropy · doi:10.3390/e24060794 · Cited by 10
Qubit Assignment Using Time Reversal
Peters, E., Shyamsundar, P., Li, A. C. Y., & Perdue, G. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040333 · Cited by 10
EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations
Ayanzadeh, R., Das, P., Tannu, S., & Qureshi, M. K. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00074 · Cited by 9
Splitting Quantum-Classical Scripts for the Generation of Quantum Workflows
Vietz, D., Barzen, J., Leymann, F., & Weder, B. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17604-3_15 · Cited by 10
Investigating the Individual Performances of Coupled Superconducting Transmon Qubits
Ahmad, H. G., Jordan, C., van den Boogaart, R., Waardenburg, D., Zachariadis, C., Mastrovito, P., Georgiev, A. L., Montemurro, D., Pepe, G. P., Arthers, M., et al. (2023) · Condensed Matter · doi:10.3390/condmat8010029 · Cited by 11
Characterizing quantum circuits with qubit functional configurations
Hu, Z., & Kais, S. (2023) · Scientific Reports · doi:10.1038/s41598-023-31980-3 · Cited by 15
Universal noise-precision relations in variational quantum algorithms
Ito, K., Mizukami, W., & Fujii, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023025 · Cited by 13
Computer-aided design for quantum computation
Wille, R., Fowler, A. G., & Naveh, Y. (2018) · doi:10.1145/3240765.3267469 · Cited by 8
Robust Diabatic Grover Search by Landau–Zener–Stückelberg Oscillations
Atia, Y., Oren, Y., & Katz, N. Y. (2019) · Entropy · doi:10.3390/e21100937 · Cited by 6
Revisiting Old Combinatorial Beasts in the Quantum Age: Quantum Annealing Versus Maximal Matching
Vert, D., Sirdey, R., & Louise, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-50433-5_37 · Cited by 6
Roadmap for quantum simulation of the fractional quantum Hall effect
Kaicher, M., Jäger, S. B., Dallaire-Demers, P.-L., & Wilhelm, F. K. (2020) · Physical Review A · doi:10.1103/physreva.102.022607 · Cited by 10
Feynman-path-type simulation using stabilizer projector decomposition of unitaries
Huang, Y., & Love, P. J. (2021) · Physical Review A · doi:10.1103/physreva.103.022428 · Cited by 13
Bosonic entanglement renormalization circuits from wavelet theory
Witteveen, F., & Walter, M. (2021) · SciPost Physics · doi:10.21468/scipostphys.10.6.143 · Cited by 15
Quantum codes from classical graphical models
Roffe, J., Zohren, S., Horsman, D. C., & Chancellor, N. (2020) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 6
Advantages of a modular high-level quantum programming framework
Steiger, D. S., Häner, T., & Troyer, M. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.02.003 · Cited by 13
Noise reduction using past causal cones in variational quantum algorithmsPreprint
Shehab, O., Kim, I. H., Nguyen, N. H., Landsman, K. A., Alderete, C. H., Zhu, D., Monroe, C. R., & Linke, N. M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.00476 · Cited by 19
eQASM: An Executable Quantum Instruction Set ArchitecturePreprint
Fu, X., Riesebos, L., Rol, M. A., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.02449 · Cited by 6
Optimization of Quantum Circuit Mapping using Gate Transformation and CommutationPreprint
Itoko, T., Raymond, R., Imamichi, T., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.02686 · Cited by 6
Robust and efficient algorithms for high-dimensional black-box quantum optimizationPreprint
Leng, Z., Mundada, P., Ghadimi, S., & Houck, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.03591 · Cited by 7
Comparison of Amplitude Estimation Algorithms by ImplementationPreprint
Yu, K., Lim, H., Rao, P., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.05300 · Cited by 5
Sign Problems in Quantum Field Theory: Classical and Quantum Approaches
Lawrence, S. R. (2020) · University Libraries (University of Maryland) · doi:10.13016/u5eg-x7y6 · Cited by 7
Larkin, J. M., Jonsson, M., Justice, D., & Guerreschi, G. G. (2020) · arXiv (Cornell University) · Cited by 6
A framework for engineering quantum likelihood functions for expectation estimationPreprint
Koh, D. E., Wang, G., Johnson, P. D., & Cao, Y. (2020) · arXiv (Cornell University) · Cited by 6
MISTIQS: An open-source software for performing quantum dynamics simulations on quantum computers
Powers, C., Oftelie, L. B., Linker, T., Nomura, K., Gulania, S., Kalia, R. K., Nakano, A., & Vashishta, P. D. (2021) · SoftwareX · doi:10.1016/j.softx.2021.100696 · Cited by 11
Quantum Accelerator Stack: A Research RoadmapPreprint
Bertels, K., Sarkar, A., Krol, A. M., Budhrani, R., Samadi, J., Geoffroy, E., Matos, J. S., Abreu, R., Gielen, G. E., & Ashraf, I. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.02035 · Cited by 22
Spurious Antenna Modes of the Transmon QubitPreprint
Rafferty, O., Patel, S., Liu, C. H., Abdullah, S., Wilen, C. D., Harrison, D. C., & McDermott, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.06803 · Cited by 27
Quantum Enhanced Filter: QFilterPreprint
Atchade-Adelomou, P., & Alonso-Linaje, G. (2021) · Research Square · doi:10.21203/rs.3.rs-405334/v1 · Cited by 6
Arimitsu, K., Nakagawa, Y. O., Koh, S., Mizukami, W., Gao, Q., & Kobayashi, T. (2021) · arXiv (Cornell University) · Cited by 5
Evaluating the impact of noise on the performance of the Variational Quantum Eigensolver
Oliv, M., Matic, A., Messerer, T., & Lorenz, J. M. (2022) · arXiv · doi:10.48550/arxiv.2209.12803 · Cited by 6
Limitations of Variational Quantum Algorithms: A Quantum Optimal Transport Approach
Palma, G. D., Marvian, M., Rouzé, C., & França, D. S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010309 · Cited by 152
Parez, G., & Witczak‐Krempa, W. (2026) · SciPost Physics · doi:10.21468/scipostphys.20.1.002 · Cited by 24
Cascaded variational quantum eigensolver algorithm
Gunlycke, D., Hellberg, C. S., & Stenger, J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013238 · Cited by 12
Adversarial examples detection based on quantum fuzzy convolution neural network
Huang, C., & Zhang, S. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04310-3 · Cited by 4
Robustness of chaotic behavior in iterated quantum protocols
Portik, A., Kálmán, O., Jex, I., & Kiss, T. (2024) · Physical Review A · doi:10.1103/physreva.109.042410 · Cited by 5
Physics informed quantum computing: A decade scientometric analysis
Sood, V., & Chauhan, R. P. (2024) · Journal of Computational Science · doi:10.1016/j.jocs.2024.102382 · Cited by 7
Scalable parity architecture with a shuttling-based spin qubit processor
Ginzel, F., Fellner, M., Ertler, C., Schreiber, L. R., Bluhm, H., & Lechner, W. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.075302 · Cited by 17
One-step implementation of a nonadiabatic geometric fSim gate in superconducting circuits
Yun, M.-R., Shan, Z., Sun, L.-N., Yan, L.-L., Jia, Y., Su, S., & Chen, G. (2024) · Physical Review A · doi:10.1103/physreva.110.022608 · Cited by 6
GeQuPI: Quantum Program Improvement with Multi-Objective Genetic Programming
Gemeinhardt, F., Klikovits, S., & Wimmer, M. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112223 · Cited by 7
The Matrix: Quantum AI for Interacting Two Worlds in Prioritized Metaverse Spaces
Park, S., Baek, H., & Kim, J. (2024) · IEEE Communications Magazine · doi:10.1109/mcom.001.2300457 · Cited by 5
Simulating a quasiparticle on a quantum device
Jaiswal, R., Lovas, I., & Balents, L. (2025) · Physical Review A · doi:10.1103/physreva.111.012629 · Cited by 6
What comes after Moore's Law: A comprehensive review of emerging computing paradigms
Urhobo, B., & Ugwuegbulam, D. (2024) · World Journal of Advanced Research and Reviews · doi:10.30574/wjarr.2024.24.3.4033 · Cited by 7
Transformer models for quantum gate set tomography
Yu, K. Y., Sarkar, A., Rimbach-Russ, M., et al. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00237-9 · 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.