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,001–4,100 of 8,640
Enhancing the electron pair approximation with measurements on trapped-ion quantum computers
Zhao, L., Wang, Q., Goings, J. J., Shin, K., Kyoung, W., Noh, S., Rhee, Y. M., & Kim, K. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00871-4 · Cited by 13
Ab initio extended Hubbard model of short polyenes for efficient quantum computing
Yoshida, Y., Takemori, N., & Mizukami, W. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0213525 · Cited by 8
Quantum Mini-Apps: A Framework for Developing and Benchmarking Quantum-HPC Applications
Saurabh, N., Mantha, P. K., Kiwit, F. J., Jha, S., & Luckow, A. (2024) · doi:10.1145/3659996.3660036 · Cited by 13
Wang, S., Liu, H., Li, Y., Gao, F., Qin, S., & Wen, Q. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400201 · Cited by 9
Inexact Quantum Square Root Circuit for NISQ Devices
Sajadimanesh, S., Rad, H. A., Faye, J. P. L., & Atoofian, E. (2024) · IEEE Access · doi:10.1109/access.2024.3455997 · Cited by 8
Learning Quantum Phase Estimation by Variational Quantum Circuits
Liu, C.-Y., Chen, K., & Lin, C.-H. A. (2024) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn60899.2024.10651206 · Cited by 21
Time Resolved Quantum Tomography in Molecular Spectroscopy by the Maximal Entropy Approach
Makhija, V., Gupta, R., Neville, S. P., Schuurman, M. S., Francisco, J. S., & Kais, S. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c02368 · Cited by 8
Simulating Cavity-Modified Electron Transfer Dynamics on NISQ Computers
Lyu, N., Khazaei, P., Geva, E., & Batista, V. S. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c02220 · Cited by 8
Error mitigation, optimization, and extrapolation on a trapped-ion testbed
Maupin, O. G., Burch, A. D., Ruzic, B., Yale, C. G., Russo, A., Lobser, D., Revelle, M., Chow, M. N. H., Clark, S., Landahl, A. J., et al. (2024) · Physical Review A · doi:10.1103/physreva.110.032416 · Cited by 10
Noise Aware Utility Optimization of NISQ Devices
Waring, J.-B., Père, C., & Beux, S. L. (2024) · IEEE Interregional NEWCAS Conference (NEWCAS) · doi:10.1109/newcas58973.2024.10666318 · Cited by 13
Correr, G. I., Medina, I., Azado, P. C., Drinko, A., & Soares-Pinto, D. O. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad80be · Cited by 17
Formalization of Quantum Intermediate Representations for code safety
Luo, J., & Zhao, J. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112236 · Cited by 8
Approximate inference on optimized quantum Bayesian networks
Fathallah, W., Amor, N. B., & Leray, P. (2024) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2024.109307 · Cited by 6
QUASIM: Quantum Computing Enhanced Service Ecosystem for Simulation in Manufacturing
Maaß, W., Agrawal, A., Ciani, A., Danz, S., Delgadillo, A., Ganser, P., Kienast, P., Kulig, M., König, V., Rodellas-Gràcia, N., et al. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00860-x · Cited by 9
Exploring the Versatility of QAOA: A Comprehensive Review
Kashapogu, R., Hasib, S., & Rasool, A. (2024) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt61001.2024.10725610 · Cited by 9
Enhanced quantum long short-term memory by using bidirectional ring variational quantum circuit
Qi, H., Lv, X., Gong, C., & Gani, A. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06636-2 · Cited by 7
Non-hemolytic peptide classification using a quantum support vector machine
Zhuang, S., Tanner, J. J., Wu, Y., Huynh, D. Q., Liu, W., Cadet, X. F., Fontaine, N., Charton, P., Damour, C., Cadet, F., et al. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04540-5 · Cited by 16
Quantum-Enhanced Strategies for Optimizing Disaster Response: A Machine Learning Approach
Karn, A. K., Sinha, P., Kaur, S., & Bansal, H. (2024) · Advances in Science, Technology & Innovation/Advances in science, technology & innovation · doi:10.1007/978-3-031-73350-5_12 · Cited by 8
Quantum Computer Fault Injection Attacks
Xu, C., Erata, F., & Szefer, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00047 · Cited by 16
Characterizing Conical Intersections of Nucleobases on Quantum Computers
Wang, Y., Cianci, C., Avdic, I., Dutta, R., Warren, S., Allen, B., Vu, N. P., dos Santos, L. F., Batista, V. S., & Mazziotti, D. A. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01434 · Cited by 12
Low-Rank Variational Quantum Algorithm for the Dynamics of Open Quantum Systems
dos Santos, S. D. L., Song, X., & Savona, V. (2025) · Quantum · doi:10.22331/q-2025-02-04-1620 · Cited by 13
Ponce, M., Herrman, R., Lotshaw, P. C., Powers, S., Siopsis, G., Humble, T. S., & Ostrowski, J. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04675-z · Cited by 39
WIP: Building a Research Experience for Undergraduates in Quantum Machine Learning
Larson, J., Pujara, D., Ramirez, D., Miller, L., Patel, T. K., Babar, N. A., & Spanias, A. (2024) · IEEE Frontiers in Education Conference (FIE) · doi:10.1109/fie61694.2024.10893516 · Cited by 6
QUBO Formulations and Characterization of Penalty Parameters for the Multi-Knapsack Problem
Güney, E., Ehrenthal, J. C. F., & Hanne, T. (2025) · IEEE Access · doi:10.1109/access.2025.3550788 · Cited by 17
Unsupervised beyond-standard-model event discovery at the LHC with a novel quantum autoencoder
Duffy, C., Hassanshahi, M. H., Jastrzebski, M., & Malik, S. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00258-4 · Cited by 14
Error-mitigated photonic quantum circuit Born machine
Salavrakos, A., Sedrakyan, T., Mills, J., Mansfield, S., & Mezher, R. (2025) · Physical Review A · doi:10.1103/physreva.111.l030401 · Cited by 16
Coherence of Symmetry-Protected Rotational Qubits in Cold Polyatomic Molecules
Löw, M., Ibrügger, M., Rempe, G., & Zeppenfeld, M. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.113402 · Cited by 6
Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements
Zhang, F., Wang, C., Iadecola, T., Orth, P. P., & Yao, Y. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.094310 · Cited by 10
Qubit fidelity distribution under stochastic Schrödinger equations driven by classical noise
de Keijzer, R., Visser, L., Tse, O. T. C., & Kokkelmans, S. J. J. M. F. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023063 · Cited by 13
Yu, H., & Wei, T.-C. (2025) · Quantum · doi:10.22331/q-2025-05-05-1724 · Cited by 18
Choi, M., & Ryu, H. (2025) · New Journal of Physics · doi:10.1088/1367-2630/add8b4 · Cited by 10
Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks
Au-Yeung, R., Kendon, V. M., & Lind, S. (2025) · Physics of Fluids · doi:10.1063/5.0268240 · Cited by 10
Pushing the Limits of GPU Lossy Compression: A Hierarchical Delta Approach
Zhang, B., Huang, Y., Di, S., et al. (2025) · ACM International Conference on Supercomputing (ICS) · doi:10.1145/3721145.3725743 · Cited by 6
Noisy HQNNs: A Comprehensive Analysis of Noise Robustness in Hybrid Quantum Neural Networks
Ahmed, T., Marchisio, A., Kashif, M., & Shafique, M. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11229153 · Cited by 16
The Dilemma of Random Parameter Initialization and Barren Plateaus in Variational Quantum Algorithms
Kashif, M., & Shafique, M. (2024) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc64395.2024.10937003 · Cited by 10
Synthesizing Quantum Circuits via Numerical Optimization
de Brugière, T. G., Baboulin, M., Valiron, B., & Allouche, C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-22741-8_1 · Cited by 13
Hierarchies of localizable entanglement due to spatial distribution of local noise
Banerjee, R., Pal, A. K., & Sen, A. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023035 · Cited by 9
Higher rank matricial ranges and hybrid quantum error correction
Cao, N., Kribs, D. W., Li, C.-K., Nelson, M. I., Poon, Y., & Zeng, B. (2020) · Linear and Multilinear Algebra · doi:10.1080/03081087.2020.1748852 · Cited by 15
Improved quantum algorithm for MMSE-based massive MIMO uplink detection
Meng, F., Yu, X., & Zhang, Z. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02768-5 · Cited by 7
Quantum One-class Classification With a Distance-based Classifier
de Oliveira, N. M., de Albuquerque, L. P., de Oliveira, W. R., Ludermir, T. B., & da Silva, A. J. (2021) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn52387.2021.9533441 · Cited by 6
EDA and Quantum Computing: a symbiotic relationship?
Raghunathan, S., & Stok, L. (2020) · IEEE Design and Test · doi:10.1109/mdat.2020.3016586 · Cited by 6
Variational certification of quantum devices
Kundu, A., & Miszczak, J. A. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac8572 · Cited by 8
Reverse Checking of Quantum Algorithm Execution
Liu, C. (2020) · IEEE Access · doi:10.1109/access.2020.3043187 · Cited by 7
Special Session: Quantum Error Correction in Near Term Systems
Majumdar, R., & Sur‐Kolay, S. (2020) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd50377.2020.00015 · Cited by 6
Optimization of the variational quantum eigensolver for quantum chemistry applications
de Keijzer, R., Colussi, V. E., Škorić, B., & Kokkelmans, S. J. J. M. F. (2022) · AVS Quantum Science · doi:10.1116/5.0076435 · Cited by 9
An Empirical Study of Optimizers for Quantum Machine Learning
Huang, Y., Lei, H., & Li, X. (2020) · IEEE International Conference on Computer and Communications (ICCC) · doi:10.1109/iccc51575.2020.9345015 · Cited by 7
Quantum secure learning with classical samples
Song, W., Lim, Y., Kwon, H., Adesso, G., Wieśniak, M., Pawłowski, M., Kim, J., & Bang, J. (2021) · Physical Review A · doi:10.1103/physreva.103.042409 · Cited by 8
Perturbative readout-error mitigation for near-term quantum computers
Peters, E., Li, A. C. Y., & Perdue, G. (2023) · Physical Review A · doi:10.1103/physreva.107.062426 · Cited by 12
Negational symmetry of quantum neural networks for binary pattern classification
Dong, N., Kampffmeyer, M., Voiculescu, I. D., & Xing, E. P. (2022) · Pattern Recognition · doi:10.1016/j.patcog.2022.108750 · Cited by 9
Empirical evaluation of circuit approximations on noisy quantum devices
Wilson, E., Mueller, F., Oftelie, L. B., & Iancu, C. (2021) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3458817.3476189 · Cited by 17
Vacuum-gap-based lumped element Josephson parametric amplifier
Wu, S., Zhang, D., Wang, R., et al. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac280c · Cited by 6
Hard-instance learning for quantum adiabatic prime factorization
Lin, J. H., Zhang, Z., Zhang, J., & Li, X. (2022) · Physical Review A · doi:10.1103/physreva.105.062455 · Cited by 7
Weber, M., Anand, A., Cervera-Lierta, A., Kottmann, J. S., Kyaw, T. H., Li, B., Aspuru‐Guzik, A., Zhang, C., & Zhao, Z. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033217 · Cited by 12
Surface code design for asymmetric error channels
Azad, U., Lipińska, A., Mahato, S., Sachdeva, R., Bhoumik, D., & Majumdar, R. (2022) · IET Quantum Communication · doi:10.1049/qtc2.12042 · Cited by 9
A Secure Quantum Protocol for Anonymous One-Vote Veto Voting
Wu, S., Sun, W., Wang, Q., et al. (2021) · IEEE Access · doi:10.1109/access.2021.3123681 · Cited by 6
Classically efficient quantum scalable Fermi-Hubbard benchmark
Gard, B., & Meier, A. M. (2022) · Physical Review A · doi:10.1103/physreva.105.042602 · Cited by 9
Toward a quantum computing algorithm to quantify classical and quantum correlation of system states
Mahdian, M., & Yeganeh, H. D. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03331-6 · Cited by 12
A Review Article on Quantum Natural Language Processing
Rai, A. (2022) · International Journal for Research in Applied Science and Engineering Technology · doi:10.22214/ijraset.2022.40103 · Cited by 7
Experimenting quantum phenomena on NISQ computers using high level quantum programming
Tran, D. M., Duy, N. V., Ho, L. B., & Nguyen, H. Q. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00126-1 · Cited by 9
Sign-problem free quantum stochastic series expansion algorithm on a quantum computer
Tan, K. C., Bhowmick, D., & Sengupta, P. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00555-x · Cited by 18
Quantum-enhanced filter: QFilter
Atchade-Adelomou, P., & Alonso-Linaje, G. (2022) · Soft Computing · doi:10.1007/s00500-022-07190-w · Cited by 19
Design and Logic Synthesis of a Scalable, Efficient Quantum Number Theoretic Transform
Lu, C., Kundu, S., Kuruvila, A. P., Ravichandran, S. M., & Basu, K. (2022) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1145/3531437.3543827 · Cited by 6
Rajakumar, J., Moondra, J., Gard, B., Gupta, S., & Herold, C. D. (2022) · Physical Review A · doi:10.1103/physreva.106.022606 · Cited by 12
Slepyan, G. Y., & Boag, A. (2022) · Applied Sciences · doi:10.3390/app12178498 · Cited by 6
Implementation of Shor's Algorithm and Reliability of Quantum Computing Devices
Sabani, M. E., Galanis, I., Savvas, I. Κ., & Garani, G. (2021) · Panhellenic Conference on Informatics · doi:10.1145/3503823.3503895 · Cited by 8
Quantum Mating Operator: A New Approach to Evolve Chromosomes in Genetic Algorithms
Acampora, G., Schiattarella, R., & Vitiello, A. (2022) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec55065.2022.9870425 · Cited by 6
Quantum algorithms for Schrieffer-Wolff transformation
Zhang, Z., Yang, Y., Xu, X., & Li, Y. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043023 · Cited by 11
Faster Born probability estimation via gate merging and frame optimisation
Koukoulekidis, N., Kwon, H., Jee, H. H., Jennings, D., & Kim, M. S. (2022) · Quantum · doi:10.22331/q-2022-10-13-838 · Cited by 9
Programmable Hamiltonian engineering with quadratic quantum Fourier transform
Wang, P., Huang, Z., Qiu, X., & Li, X. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.134313 · Cited by 7
The complexity of quantum circuit mapping with fixed parameters
Zhu, P., Zheng, S., Wei, L., Cheng, X., Guan, Z., & Feng, S. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03698-0 · Cited by 12
Mimicking quantum correlation of a long-range Hamiltonian by finite-range interactions
Lakkaraju, L. G. C., Ghosh, S., Sadhukhan, D., & Sen, A. (2022) · Physical Review A · doi:10.1103/physreva.106.052425 · Cited by 8
Wang, A., Zhang, J.-N., & Li, Y. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043140 · Cited by 9
Periodic plane-wave electronic structure calculations on quantum computers
Song, D., Bauman, N. P., Prawiroatmodjo, G., Peng, B., Granade, C., Rosso, K. M., Low, G. H., Roetteler, M., Kowalski, K., & Bylaska, E. J. (2023) · Materials Theory · doi:10.1186/s41313-022-00049-5 · Cited by 6
Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
Mironowicz, P. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acb22d · Cited by 12
Optimally Band-Limited Noise Filtering for Single-Qubit Gates
Oda, Y., Lucarelli, D. G., Schultz, K., Clader, B. D., & Quiroz, G. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.014062 · Cited by 11
Parametrized quantum circuit for weight-adjustable quantum loop gas
Sun, R.-Y., Shirakawa, T., & Yunoki, S. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.l041109 · Cited by 12
Benchmarking Speed of Post-Quantum Lattice Based PKE/KEM Schemes Using Liboqs
Garrach, M. A., Waghela, C., Mathews, M. M., & Sreekuttan, L. S. (2022) · International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT) · doi:10.1109/tqcebt54229.2022.10041663 · Cited by 6
Combating errors in quantum communication: an integrated approach
Bala, R., Asthana, S., & Ravishankar, V. (2023) · Scientific Reports · doi:10.1038/s41598-023-30178-x · Cited by 7
Entanglement transmission due to the Dzyaloshinskii–Moriya interaction
Motamedifar, M., Sadeghi, F., & Golshani, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-29995-x · Cited by 7
Assisted quantum simulation of open quantum systems
Liang, J., Lv, Q.-Q., Wang, Z., & Fei, S.-M. (2023) · iScience · doi:10.1016/j.isci.2023.106306 · Cited by 8
Quantum Computing and the Qubit: The Future of Artificial Intelligence
Sasi, P., Soni, G., Tyagi, A. K., Kakulapati, V., Mohan, J. S. S., & Singh, R. K. (2023) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-6684-6697-1.ch013 · Cited by 6
Recent Trends and Open Challenges in Blind Quantum Computation
Joshi, M., Karthikeyan, S., & Mishra, M. K. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-28183-9_34 · Cited by 7
Near-term $n$ to $k$ distillation protocols using graph codes
Goodenough, K., de Bone, S., Addala, V. L., et al. (2023) · Institutional Repositories DataBase (IRDB) · doi:10.48550/arxiv.2303.11465 · Cited by 6
Power and limitations of learning quantum dynamics incoherently
Jerbi, S., Gibbs, J., Rudolph, M. S., Caro, M. C., Coles, P. J., Huang, H.-Y., & Holmes, Z. (2026) · Physical Review Research · doi:10.1103/s5xy-lk91 · Cited by 28
Optimized laser models with Heisenberg-limited coherence and sub-Poissonian beam photon statistics
Ostrowski, L. A., Baker, T. J., Saadatmand, S. N., & Wiseman, H. M. (2023) · Physical Review A · doi:10.1103/physreva.107.053702 · Cited by 7
Variational quantum simulation of long-range interacting systems
Lyu, C., Tang, X., Li, J., Xu, X., Yung, M., & Bayat, A. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acd571 · Cited by 15
Partial transpose moments, principal minors and entanglement detection
Ali, M. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03966-7 · Cited by 9
Parameter-parallel distributed variational quantum algorithm
Niu, Y.-F., Zhang, S., Ding, C., Bao, W., & Huang, H.-L. (2023) · SciPost Physics · doi:10.21468/scipostphys.14.5.132 · Cited by 11
Practical quantum simulation of small-scale non-Hermitian dynamics
Liu, H., Yang, X., Tang, K., Che, L., Nie, X., Xin, T., Li, J., & Lu, D. (2023) · Physical Review A · doi:10.1103/physreva.107.062608 · Cited by 13
Quantum computer-aided design for advanced superconducting qubit: Plasmonium
Liu, F., Wang, C., Chen, M.-C., Chen, H. H., Li, S., Shang, Z.-X., Ying, C., Wang, J., Huo, Y.-H., Peng, C.-Z., et al. (2023) · 中国科学通报:英文版 · doi:10.1016/j.scib.2023.06.030 · Cited by 12
Variational quantum circuits for convolution and window-based image processing applications
Yetış, H., & Karaköse, M. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace378 · Cited by 12
QUBO.jl : a Julia ecosystem for quadratic unconstrained binary optimization
Xavier, P. M., Ripper, P., Andrade, T., Garcia, J. D., Maculan, N., & Bernal, D. E. (2026) · Optimization methods & software · doi:10.1080/10556788.2026.2702926 · Cited by 20
Quantum secure metrology for network sensing-based applications
Rahim, M. T., Khan, A., Khalid, U., Rehman, J. U., Jung, H., & Shin, H. (2023) · Scientific Reports · doi:10.1038/s41598-023-38802-6 · Cited by 11
Zhang, S., Wu, J., & Li, L. (2023) · Physical Review A · doi:10.1103/physreva.108.022603 · Cited by 10
Differentiable Quantum Programming with Unbounded Loops
Fang, W. S., Ying, M., & Wu, X. (2023) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3617178 · Cited by 14
Dynamic full quantum one-way function based on quantum circuit mapping
Tang, Y., Shang, T., & Liu, J. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04065-3 · Cited by 6
Quantum-inspired Computing: Entanglement-enhanced Technique for Short Portfolio in Global Markets
Jiang, Y.-C., Lai, Y.-T., Chen, P.-C., et al. (2023) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano58406.2023.10231234 · Cited by 6
MPS-VQE: A variational quantum computational chemistry simulator with matrix product states
Xu, Z., Fan, Y., Guo, C., & Shang, H. (2023) · Computer Physics Communications · doi:10.1016/j.cpc.2023.108897 · Cited by 8
Quantum algorithm for smoothed particle hydrodynamics
Au-Yeung, R., Williams, A. J., Kendon, V. M., & Lind, S. (2023) · Computer Physics Communications · doi:10.1016/j.cpc.2023.108909 · Cited by 14
Rise and fall of entanglement between two qubits in a non-Markovian bath
Roy, S., Otto, C., Menu, R., & Morigi, G. (2023) · Physical Review A · doi:10.1103/physreva.108.032205 · Cited by 8
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.