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,601–5,700 of 8,640
A Perturbative Approach to the Solution of the Thirring Quantum Cellular Automaton
Bisio, A., Perinotti, P., Pizzamiglio, A., & Rota, S. (2025) · Entropy · doi:10.3390/e27020198 · Cited by 3
Distributed Generalized Deutsch-Jozsa Algorithm
Li, H., Qiu, D., & Luo, L. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-1093-8_18 · Cited by 2
Quantum Network Routing with Heterogeneous Nodes
Pandey, A. K., Tamma, B. R., & Rao, M. V. P. (2025) · International Conference on Communication Systems & Networks (COMSNETS) · doi:10.1109/comsnets63942.2025.10885596 · Cited by 2
Code-level quantum circuit generation based on large language models
He, Z.-M., Li, G.-H., Situ, H.-Z., Zhou, Y., Zheng, S., & Lvzhou, L. (2025) · SCIENTIA SINICA Physica, Mechanica & Astronomica · doi:10.1360/sspma-2024-0594 · Cited by 2
Towards Effective Local Search for Qubit Mapping
Luo, C. W., Cao, S., Guo, S., & Hu, C. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3544869 · Cited by 4
SWAP Gate for Spin Qubits Based on Silicon Devices Integrated with a Micromagnet
Ni, M., Ma, R.-L., Kong, Z., Xue, X., Zhu, S.-K., Wang, C., Li, A.-R., Chu, N., Liao, W.-Z., Cao, G., et al. (2025) · Nano Letters · doi:10.1021/acs.nanolett.4c05540 · Cited by 22
Transversal cnot gate with multicycle error correction
Kim, Y., Sevior, M. E., & Usman, M. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.024074 · Cited by 7
Spectrum analysis with parametrically modulated transmon qubits
Gavrielov, N., Oviedo-Casado, S., & Retzker, A. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.l012056 · Cited by 4
Experimental demonstration of reconstructing quantum states with generative models
Li, X., Jiang, W., Hua, Z., Wang, W., Pan, X., Cai, W., Lu, Z., Han, J., Wu, R.-B., Zou, C., et al. (2025) · 中国科学通报:英文版 · doi:10.1016/j.scib.2025.03.007 · Cited by 5
Quantum Zeno Monte Carlo for computing observables
Han, M., Park, H., & Choi, S. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01002-3 · Cited by 5
Nagies, S., Geier, K. T., Akram, J., Okamoto, J., Bantounas, D., Wunderlich, C., Johanning, M., & Hauke, P. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adc1fe · Cited by 8
Protocols for i SWAP gates using a fixed coupler driven by two microwave pulses
Xu, P., Zhang, H., & Wu, S. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.034036 · Cited by 6
A Fundamental Energy-Complexity Uncertainty Relation
Nye, L. (2025) · Journal of Quantum Information Science · doi:10.4236/jqis.2025.151003 · Cited by 2
Spontaneous emission in a coupled cavity array featuring random-dimer disorder
Monteiro, M. O., Almeida, G. M. A., & de Moura, F. A. B. F. (2025) · Annals of Physics · doi:10.1016/j.aop.2025.170009 · Cited by 3
Quantum surrogate modelling to solve phase field simulation problems in metal solidification
Eider, G.-P., Gómez-Omella, M., Lambarri, J., & Naroa, M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07032-0 · Cited by 2
Akrom, M., Rustad, S., Sutojo, T., Setiadi, D. R. I. M., Andono, P. N., Shidik, G. F., Dipojono, H. K., & Maezono, R. (2025) · Materials Today Communications · doi:10.1016/j.mtcomm.2025.112341 · Cited by 15
Vuppala, T., Kulkarni, P., & Mohanty, N. (2024) · IEEE MIT Undergraduate Research Technology Conference (URTC) · doi:10.1109/urtc65039.2024.10937533 · Cited by 2
The quantum non-Markovianity for a special class of generalized Weyl channel
Xu, W., Li, M.-S., Li, B., Jiao, G.-M., & Zheng, Z. (2025) · Physica Scripta · doi:10.1088/1402-4896/adca0b · Cited by 3
Szasz, A., Younis, E., & de Jong, W. A. (2025) · Quantum · doi:10.22331/q-2025-04-09-1704 · Cited by 5
Learning density functionals from noisy quantum data
Koridon, E., Frohnert, F., Prehn, E., van Nieuwenburg, E., Tura, J., & Polla, S. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/adcb89 · Cited by 4
Seifert, L. M., Dangwal, S., Chong, F. T., & Ravi, G. S. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3622781.3674178 · Cited by 14
kNN classification using Hausdorff metric with quantum-based Euclidean distance
Luna-Márquez, D. C., Pinto-Elías, R., Pérez-Becerra, T., Magadán-Salazar, A., González-Franco, N., & Fuentes-Pacheco, J. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00275-3 · Cited by 4
PT -symmetric mapping of three states and its implementation on a cloud quantum processor
Balytskyi, Y., Kotukh, Y. V., Khalimov, G., & Chang, S. (2025) · Quantum · doi:10.22331/q-2025-04-18-1716 · Cited by 3
Impact of hardware connectivity on Grover’s algorithm in NISQ era
Joshi, M., Mishra, M. K., & Karthikeyan, S. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04733-6 · Cited by 2
Barren plateaus are amplified by the dimension of qudits
Friedrich, L., Farias, T. D. S., & Maziero, J. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00282-4 · Cited by 8
Paul, S., & Chakraborty, S. (2025) · International Conference on Intelligent Systems, Advanced Computing and Communication (ISACC) · doi:10.1109/isacc65211.2025.10969380 · Cited by 2
Bremner, M. J., Cheng, B., & Ji, Z. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020315 · Cited by 19
Expressibility, entangling power, and quantum average causal effect for causally indefinite circuits
Azado, P. C., Correr, G. I., Drinko, A., Medina, I., Canabarro, A., & Soares-Pinto, D. O. (2025) · Physical Review A · doi:10.1103/physreva.111.042620 · Cited by 7
Cheng, S., Wang, S.-P., Neto, G. D. D. M., & Xianlong, G. (2025) · Physical Review A · doi:10.1103/physreva.111.053501 · Cited by 5
Broadband spectroscopy of quantum noise
Wang, Y., & Paz-Silva, G. A. (2025) · Physical Review A · doi:10.1103/physreva.111.052407 · Cited by 9
Alzaydi, A. A., Sarhan, A. A. D., & Khalifa, M. (2025) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-025-10230-w · Cited by 2
QuFM: Towards Efficient Quantum Link Fidelity Measurements in Quantum Networks
Zhao, Z., Li, T., & Li, Z. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00086 · Cited by 2
Logarithmic entanglement light cone from eigenstate correlations in the many-body localized phase
Thakur, R., Pain, B., & Roy, S. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.174206 · Cited by 2
Entanglement-informed construction of variational quantum circuits
Joch, A., Uhrig, G. S., & Fauseweh, B. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/addb6f · Cited by 11
Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers
Stade, Y., Schmid, L., Burgholzer, L., & Wille, R. (2024) · Design, Automation and Test in Europe · doi:10.23919/date64628.2025.10993241 · Cited by 12
Quantum Firefly Algorithm: A Novel Approach for Quantum Circuit Scheduling Optimization
Du, Z., Wang, J., & Li, H. (2025) · Electronics · doi:10.3390/electronics14112123 · Cited by 4
Simulating work extraction in a dinuclear quantum battery using a variational quantum algorithm
Galvão, L. Q., das Neves, A. C., Anka, M. F., & Cruz, C. (2025) · Physical review. E · doi:10.1103/6bm4-8ckl · Cited by 5
Sihare, S. R. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06369-y · Cited by 3
AI-Driven Reverse Engineering of QML Models
Ghosh, A., & Ghosh, S. (2025) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed65160.2025.11014316 · Cited by 7
Effective Floquet Lindblad generators from spectral unwinding
Dinc, G. D., Eckardt, A., & Schnell, A. (2025) · Physical Review A · doi:10.1103/x2qh-12gg · Cited by 4
Improved Big Data Security Using Quantum Chaotic Map of Key Sequence
Kotangale, A., Kumar, M. S., & Bhagat, A. P. (2025) · Computers · doi:10.3390/computers14060214 · Cited by 5
Accelerated VQE: Parameter Recycling for Similar Recurring Problem Instances
Rohe, T., Mansky, M. B., Kölle, M., Stein, J., Sünkel, L., & Linnhoff–Popien, C. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-94263-1_5 · Cited by 2
Ha, J., Kang, Y., Lee, J., & Heo, J. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04789-4 · Cited by 3
Tomography of Parametrized Quantum States
Schreiber, F. J., Eisert, J., & Meyer, J. J. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020346 · Cited by 14
Sokolov, I., & Dziarmaga, J. (2025) · Physical review. B./Physical review. B · doi:10.1103/wkys-cd39 · Cited by 5
Alonso, M., Martínez, R., Díez-Valle, P., Garbayo, A., García‐Santiago, X., & Gil, G. B. (2025) · IEEE Access · doi:10.1109/access.2025.3578780 · Cited by 5
ArtA: automating Design Space Exploration of spin-qubit architectures
Paraskevopoulos, N., Hamel, D., Sarkar, A., Almudéver, C. G., & Feld, S. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04759-w · Cited by 9
Yu, D. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-92605-1_1 · Cited by 4
Quantum Machine Learning: Hybrid System of Quantum and Classical Computing
Peng, L., Meikang Qiu, A., Li, C., & Lu, Z. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-8725-1_35 · Cited by 3
Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures
Rached, S. B., Agudo, I. L., Rodrigo, S., Bandić, M., García-Sáez, A., Feld, S., van Someren, H., Alarcón, E., Almudéver, C. G., & Abadal, S. (2025) · IEEE Access · doi:10.1109/access.2025.3583218 · Cited by 11
Exploring Quantum Computing for Metal Cluster Analysis
Pollard, N., Hines, A. C., & Clayborne, A. Z. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c01404 · Cited by 4
Liu, Y., He, M.-Q., & Wang, Z. D. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130766 · Cited by 7
Qubit mapping: the adaptive divide-and-conquer approach
Huang, Y., Zhou, X., Meng, F., & Li, S. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04815-5 · Cited by 6
Complexity of Local Quantum Circuits under Nonunital Noise
Shtanko, O., & Sharma, K. (2025) · PRX Quantum · doi:10.1103/xwz2-wfr4 · Cited by 11
Decoding Quantum Search Advantage: The Critical Role of State Properties in Random Walks
Zhou, S.-Q., Liang, J., Ding, Z.-H., Chen, Z., Fei, S.-M., & Ma, Z. (2025) · Chinese Physics Letters · doi:10.1088/0256-307x/42/9/090602 · Cited by 4
Sati, H., & Schreiber, U. (2025) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-025-00368-5 · Cited by 13
Tunable multibit stochasticity in La 0.67 Sr 0.33 Mn O 3 -based probabilistic bits
Bhaduri, I., Jaman, A., Quiñonez, W., Gupta, A., & Banerjee, T. (2025) · Physical Review Applied · doi:10.1103/rqsl-4xxd · Cited by 3
EU Cybersecurity Regulation in the Quantum Age
Davis, P. A. E., Aboy, M., Bygrave, L. A., Minssen, T., Gasser, U., & Compagnucci, M. C. (2026) · Perspectives in law, business and innovation · doi:10.1007/978-981-95-8371-3_5 · Cited by 3
Steiner Traveling Salesman Problem with Quantum Annealing
Ciacco, A., Guerriero, F., & Osaba, E. (2025) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3712255.3734313 · Cited by 2
Closed-form expressions for unitaries of spin-adapted fermionic operators
Magoulas, I., & Evangelista, F. A. (2025) · Molecular Physics · doi:10.1080/00268976.2025.2534672 · Cited by 4
Distributed Deutsch–Jozsa algorithm
Li, H., Qiu, D., & Luo, L. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07683-z · Cited by 29
Cavity polariton blockade for non-local entangling gates with trapped atoms
Srivastava, V., Jandura, S., Brennen, G. K., & Pupillo, G. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adfd79 · Cited by 4
HQCC: A Hybrid Quantum-Classical Classifier With Adaptive Structure
Zhao, R.-X., Šiljak, H., Wang, S., He, Y., & Wang, Y. (2025) · IEEE Signal Processing Letters · doi:10.1109/lsp.2025.3606843 · Cited by 6
QuanFlex-GAN: a flexible algorithm for image generation via quantum generative modeling
Lou, X., & Wang, L. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00316-x · Cited by 4
Hybrid Quantum-Classical Neural Network for Breast Cancer Detection
Rahim, M. T., Ali, A., & Alam, T. (2025) · International Conference on Data Science and Its Applications (ICoDSA) · doi:10.1109/icodsa67155.2025.11157288 · Cited by 4
Quantum Error Correction with Girth-16 Non-Binary LDPC Codes via Affine Permutation Construction
Kasai, K. (2025) · International Symposium on Topics in Coding (ISTC) · doi:10.1109/istc65386.2025.11154564 · Cited by 2
Multiparty Quantum Secret Sharing of Classical Message Under Noisy Scenario
Basak, N., & Paul, G. (2025) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl65142.2025.11158800 · Cited by 2
Quantum Surrogate-Driven Image Classifier: a Gradient-Free Approach to Avoid Barren Plateaus
Xie, Y. (2025) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl65142.2025.11158317 · Cited by 6
Curiël, R., Alsahag, A. M. M., & Ziabari, S. S. M. (2025) · Sustainability · doi:10.3390/su17198687 · Cited by 4
AraBERT-QC: a novel quantum-based classification architecture to classify short Arabic sentences
Djemmal, I., & Belhadef, H. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07966-5 · Cited by 4
Kasai, K. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195217 · Cited by 2
Climbing the diagonal Clifford hierarchy
Hu, J., Liang, Q., & Calderbank, R. (2025) · Academia quantum. · doi:10.20935/acadquant7957 · Cited by 23
Monte Carlo approach for finding optimally controlled quantum gates with differential geometry
da Silva, A. H., Castelano, L. K., & Napolitano, R. D. J. (2025) · Physical Review A · doi:10.1103/c76s-d7pw · Cited by 4
Distributing Quantum Computations, Shot-Wise
Bisicchia, G., Clemente, G., García-Alonso, J. M., Murillo, J. M., D’Elia, M., & Brogi, A. (2025) · Future Internet · doi:10.3390/fi17110507 · Cited by 14
Nonadiabatic molecular dynamics on quantum computers: challenges and opportunities
Gil, E. S., & González, L. (2025) · Pure and Applied Chemistry · doi:10.1515/pac-2025-0599 · Cited by 3
DisQu: Investigating the Impact of Disorder in Quantum Generative Models
Werner, Y., Frkatovic, J., Rey, V. F., Tschöpe, M., Suh, S., Lukowicz, P., Palaiodimopoulos, N. E., & Kiefer-Emmanouilidis, M. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11227841 · Cited by 3
Optimal Mechanisms for Quantum Local Differential Privacy
Guan, J. (2025) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3719027.3765178 · Cited by 18
Doyle, L., Seifollahi, F., & Singh, C. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00454-y · Cited by 10
Source of Heralded Atom-Photon Entanglement for Quantum Networking
Chiarella, G., Frank, T., Zuka, L., Farrera, P., & Rempe, G. (2025) · Physical Review Letters · doi:10.1103/5zk9-3rpv · Cited by 6
Quantum Generative Neural Networks for Imaging Applications
Vittal, S., Ramirez, D., Uehara, G. S., Luca, G. D., & Spanias, A. (2025) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa66859.2025.11311234 · Cited by 2
Connectivity-Aware Qubit Mapping and CNOT Cost Minimization for Quantum Hashing Circuits
Zinnatullin, I., Khadiev, K. R., & Nikitin, I. A. (2025) · Russian Microelectronics · doi:10.1134/s1063739725602073 · Cited by 2
Erste Demonstration von Quantenüberlegenheit
Hartmann, M. J., & Deppe, F. (2021) · Physik in unserer Zeit · doi:10.1002/piuz.202001587 · Cited by 2
Optimal local unitary encoding circuits for the surface code
Higgott, O., Wilson, M., Hefford, J., Dborin, J., Hanif, F., Burton, S., & Browne, D. E. (2021) · UCL Discovery (University College London) · Cited by 2
Efficient Criteria of Quantumness for a Large System of Qubits
Watabe, S., Serikow, M. Z., Kawabata, S., & Zagoskin, A. M. (2022) · Frontiers in Physics · doi:10.3389/fphy.2021.773128 · Cited by 3
Dynamics of field observables in quantum channels
Medvedeva, S., Gaidash, A., Kozubov, A. V., et al. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1984/1/012007 · Cited by 2
Efficient Quantum Gate Discovery with Optimal Control
Kairys, P., & Humble, T. S. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00062 · Cited by 7
Enabling a Programming Environment for an Experimental Ion Trap Quantum Testbed
Adams, A. S., Pinto, E., Young, J., Herold, C. D., McCaskey, A., Dumitrescu, E., & Conte, T. M. (2021) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc53822.2021.00014 · Cited by 2
Quantum Information and Symmetry
Leoński, W., Kalaga, J. K., & Szczȩśniak, R. (2020) · MDPI eBooks · doi:10.3390/books978-3-03928-801-4 · Cited by 2
Correlations in Noisy Measurements
Seo, S., Seong, J., & Bae, J. (2022) · Open Systems & Information Dynamics · doi:10.1142/s1230161222500093 · Cited by 2
Bhattacharyya, M., & Raina, A. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05074-8 · Cited by 3
QAOA.jl: Toolkit for the Quantum and Mean-Field Approximate Optimization Algorithms
Bode, T., Bagrets, D., Misra-Spieldenner, A., Stollenwerk, T., & Wilhelm, F. K. (2023) · The Journal of Open Source Software · doi:10.21105/joss.05364 · Cited by 2
Quantum state transfer: interplay between gate and readout errors
Thotakura, B., & Wei, T.-C. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04030-0 · Cited by 4
Padilha, D., Weinstock, S., & Hodson, M. J. (2019) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2019.8916450 · Cited by 3
Adiabatic ground state preparation in an expanding lattice
Olund, C. T., Block, M., Gazit, S., McGreevy, J., & Yao, N. Y. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.155152 · Cited by 5
Groenland, K., Groenland, C., & Kramer, R. (2020) · Journal of Mathematical Physics · doi:10.1063/1.5116655 · Cited by 2
Noise-adaptive test of quantum correlations with quasiprobability functions
Lee, S.-W., Kim, J., & Son, W. (2020) · Physical Review A · doi:10.1103/physreva.102.012408 · Cited by 2
Practical Error Modeling Toward Realistic NISQ Simulation
Tanimoto, T., Matsuo, S., Kawakami, S., Tabuchi, Y., Hirokawa, M., & Inoue, K. (2020) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi49217.2020.00060 · Cited by 3
Gate-Error-Resilient Quantum Steane Codes
Cane, R., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.3027638 · Cited by 2
Modeling Complex Quantum Dynamics: Evolution of Numerical Algorithms in the HPC Context
Meyerov, I. B., Liniov, A., Ivanchenko, M., & Denisov, S. (2020) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080220080120 · Cited by 4
Impact of laser frequency noise on high-extinction optical modulation
West, G. N., Loh, W., Kharas, D., & Ram, R. J. (2020) · Optics Express · doi:10.1364/oe.413850 · Cited by 3
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.