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 2,401–2,500 of 8,640
Multiqubit time-varying quantum channels for NISQ-era superconducting quantum processors
Martínez, J. E., Fuentes, P., iOlius, A. D., Garcia‐Frias, J., Fonollosa, J. R., & Crespo, P. M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033055 · Cited by 20
Amsler, M., Deglmann, P., Degroote, M., Kaicher, M., Kiser, M., Kühn, M., Kumar, C., Maier, A., Samsonidze, G. G., Schroeder, A. K., et al. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0146934 · Cited by 28
Zhang, H., Wan, L., Ramos-Calderer, S., Zhan, Y., Mok, W., Cai, H. N., Gao, F., Luo, X., Lo, G., Kwek, L. C., et al. (2023) · Photonics Research · doi:10.1364/prj.493865 · Cited by 18
Solving graph problems with single photons and linear optics
Mezher, R., Carvalho, A. F., & Mansfield, S. (2023) · Physical Review A · doi:10.1103/physreva.108.032405 · Cited by 25
Interconnect Fabrics for Multi-Core Quantum Processors: A Context Analysis
Escofet, P., Rached, S. B., Rodrigo, S., Almudéver, C. G., Alarcón, E., & Abadal, S. (2023) · International Workshop on Network on Chip Architectures (NoCArc) · doi:10.1145/3610396.3623267 · Cited by 28
Approximate Boltzmann distributions in quantum approximate optimization
Lotshaw, P. C., Siopsis, G., Ostrowski, J., Herrman, R., Alam, R., Powers, S., & Humble, T. S. (2023) · Physical Review A · doi:10.1103/physreva.108.042411 · Cited by 35
Deterministic Bell state measurement with a single quantum memory
Kamimaki, A., Wakamatsu, K., Mikata, K., Sekiguchi, Y., & Kosaka, H. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00771-z · Cited by 20
Quantum Optimization Algorithm for LEO Satellite Communications based on Cell-Free Massive MIMO
Al-Hraishawi, H., Rehman, J. U., & Chatzinotas, S. (2023) · IEEE International Conference on Communications workshops · doi:10.1109/iccworkshops57953.2023.10283753 · Cited by 19
Superposed Quantum Error Mitigation
Miguel-Ramiro, J., Shi, Z., Dellantonio, L., Chan, A., Muschik, C. A., & Dür, W. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.230601 · Cited by 22
Waintal, X. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2313269120 · Cited by 28
Priyanka, G., Venkatesan, M., & Prabhavathy, P. (2023) · International Conference on Quantum Technologies, Communications, Computing, Hardware and Embedded Systems Security (iQ-CCHESS) · doi:10.1109/iq-cchess56596.2023.10391745 · Cited by 19
Complexity of life sciences in quantum and AI era
Pyrkov, A. N., Aliper, A., Bezrukov, D. S., Podolskiy, D. I., Ren, F., & Zhavoronkov, A. A. (2024) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.1701 · Cited by 30
Quantum‐Based Combinatorial Optimization for Optimal Sensor Placement in Civil Structures
Martín, G. S., & Droguett, E. L. (2024) · Structural Control and Health Monitoring · doi:10.1155/2024/6681342 · Cited by 30
Qibolab: an open-source hybrid quantum operating system
Efthymiou, S., Orgaz, Á., Carobene, R., Cereijo, J., Pasquale, A., Ramos-Calderer, S., Bordoni, S., Fuentes-Ruiz, D., Candido, A., Pedicillo, E., et al. (2024) · Quantum · doi:10.22331/q-2024-02-12-1247 · Cited by 36
Sublattice scars and beyond in two-dimensional U(1) quantum link lattice gauge theories
Sau, I., Stornati, P., Banerjee, D., & Sen, A. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.109.034519 · Cited by 29
Exact distributed quantum algorithm for generalized Simon’s problem
Li, H., Qiu, D., Luo, L., & Mateus, P. (2024) · Acta Informatica · doi:10.1007/s00236-024-00455-x · Cited by 24
Optimizing edge-state transfer in a Su-Schrieffer-Heeger chain via hybrid analog-digital strategies
Romero, S. V., Chen, X., Platero, G., & Ban, Y. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034033 · Cited by 26
Superposition-enhanced quantum neural network for multi-class image classification
Bai, Q., & Hu, X. (2024) · Chinese Journal of Physics · doi:10.1016/j.cjph.2024.03.026 · Cited by 22
Near-Term n to k Distillation Protocols Using Graph Codes
Goodenough, K., de Bone, S., Addala, V. L., Krastanov, S., Jansen, S., Gijswijt, D., & Elkouss, D. (2024) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2024.3380094 · Cited by 35
Simple information-processing tasks with unbounded quantum advantage
Heinosaari, T., Kerppo, O., Leppäjärvi, L., & Plávala, M. (2024) · Physical Review A · doi:10.1103/physreva.109.032627 · Cited by 21
What is Quantum Parallelism, Anyhow?
Markidis, S. (2024) · ISC High Performance (ISC) · doi:10.23919/isc.2024.10528926 · Cited by 32
Quantum convolutional neural networks for multiclass image classification
Shi, S., Wang, Z., Li, J., Li, Y., Shang, R., Zhong, G., & Gu, Y. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04360-7 · Cited by 25
Variational Quantum Algorithms for Semidefinite Programming
Patel, D., Coles, P. J., & Wilde, M. M. (2024) · Quantum · doi:10.22331/q-2024-06-17-1374 · Cited by 34
Zhao, H., Bukov, M., Heyl, M., & Moessner, R. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.010603 · Cited by 31
Enhancing the expressivity of quantum neural networks with residual connections
Wen, J., Huang, Z., Cai, D., & Qian, L. (2024) · Communications Physics · doi:10.1038/s42005-024-01719-1 · Cited by 31
Control-enhanced non-Markovian quantum metrology
Yang, X., Long, X., Liu, R., Tang, K., Zhai, Y., Nie, X., Xin, T., Li, J., & Lu, D. (2024) · Communications Physics · doi:10.1038/s42005-024-01758-8 · Cited by 32
VQC-based reinforcement learning with data re-uploading: performance and trainability
Coelho, R., Sequeira, A., & Santos, L. P. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00190-z · Cited by 23
Quantum state tomography with locally purified density operators and local measurements
Guo, Y., & Yang, S. (2024) · Communications Physics · doi:10.1038/s42005-024-01813-4 · Cited by 48
Beyond MP2 initialization for unitary coupled cluster quantum circuits
Hirsbrunner, M. R., Chamaki, D., Mullinax, J. W., & Tubman, N. M. (2024) · Quantum · doi:10.22331/q-2024-11-26-1538 · Cited by 25
Tomal, S. M. Y. I., Shafin, A. A., Afaf, A., & Bhattacharjee, D. (2024) · Journal of Future Artificial Intelligence and Technologies · doi:10.62411/faith.3048-3719-48 · Cited by 23
Grimsley, H. R., & Evangelista, F. A. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ad9fa2 · Cited by 28
Long-Range Z Z Interaction via Resonator-Induced Phase in Superconducting Qubits
Deng, X. B., Zheng, W., Liao, X., Zhou, H., Ge, Y., Zhao, J., Lan, D., Tan, X., Zhang, Y., Li, S., et al. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.020801 · Cited by 36
Classifying One-Dimensional Quantum States Prepared by a Single Round of Measurements
Sahay, R., & Verresen, R. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010329 · Cited by 38
Qutrit and qubit circuits for three-flavor collective neutrino oscillations
Turro, F., Chernyshev, I. A., Bhaskar, R., & Illa, M. (2025) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.111.043038 · Cited by 40
Nonequilibrium quantum Monte Carlo algorithm for stabilizer Rényi entropy in spin systems
Liu, Z., & Clark, B. K. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.085144 · Cited by 37
Efficient quantum simulation of QCD jets on the light front
Qian, W., Li, M., Salgado, C. A., & Kreshchuk, M. (2025) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.111.096001 · Cited by 29
Stabilizer Tensor Networks with Magic State Injection
Nakhl, A. C., Harper, B., West, M. T., Dowling, N., Sevior, M. E., Quella, T., & Usman, M. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.190602 · Cited by 45
Accessible coherence in open quantum system dynamics
Díaz, M. G., Desef, B., Rosati, M., Egloff, D., Calsamiglia, J., Smirne, A., Skotiniotis, M., & Huelga, S. F. (2020) · Quantum · doi:10.22331/q-2020-04-02-249 · Cited by 20
Semi-device-independent quantum money
Horodecki, K., & Stankiewicz, M. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab6872 · Cited by 24
Xu, L., Lee, J. T., & Freericks, J. K. (2020) · Modern Physics Letters B · doi:10.1142/s0217984920400497 · Cited by 26
Enabling Pulse-Level Programming, Compilation, and Execution in XACC
Nguyen, T., & McCaskey, A. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3057166 · Cited by 18
Scalable characterization of localizable entanglement in noisy topological quantum codes
Amaro, D., Müller, M., & Pal, A. K. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab84b3 · Cited by 25
Correlations for computation and computation for correlations
Demirel, B., Weng, W., Thalacker, C., Hoban, M., & Barz, S. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00354-2 · Cited by 20
High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder
Gao, N., Wilson, M., Vandal, T., Vinci, W., Nemani, R., & Rieffel, E. G. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403138 · Cited by 22
Process tomography of robust dynamical decoupling with superconducting qubits
Souza, A. M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03176-z · Cited by 18
Efficient qubit routing for a globally connected trapped ion quantum computer
Herbert, S. (2020) · Sussex Research Online (University of Sussex) · Cited by 16
Shirakawa, T., Seki, K., & Yunoki, S. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013004 · Cited by 18
A variational quantum algorithm for Hamiltonian diagonalization
Zeng, J., Cao, C., Zhang, C., Xu, P., & Zeng, B. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac11a7 · Cited by 24
Efficient two-electron ansatz for benchmarking quantum chemistry on a quantum computer
Smart, S. E., & Mazziotti, D. A. (2020) · University of Chicago · doi:10.6082/2cxwm-y5012 · Cited by 16
Resource prioritization and balancing for the quantum internet
Gyöngyösi, L., & Imre, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-78960-5 · Cited by 19
Variational quantum solver employing the PDS energy functional
Peng, B., & Kowalski, K. (2021) · Quantum · doi:10.22331/q-2021-06-10-473 · Cited by 18
Relevance of Near-Term Quantum Computing in the Cloud: A Humanities Perspective
Barzen, J., Leymann, F., Falkenthal, M., Vietz, D., Weder, B., & Wild, K. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-72369-9_2 · Cited by 21
Quantum maximum mean discrepancy GAN
Huang, Y., Lei, H., Li, X., & Yang, G. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.091 · Cited by 19
Quantum amplitude-amplification operators
Kwon, H., & Bae, J. (2021) · Physical Review A · doi:10.1103/physreva.104.062438 · Cited by 26
Convergence of a Reconstructed Density Matrix to a Pure State Using the Maximal Entropy Approach
Gupta, R., Levine, R. D., & Kais, S. (2021) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.1c05884 · Cited by 17
Integrated quantum polariton interferometry
Nigro, D., D’Ambrosio, V., Sanvitto, D., & Gerace, D. (2022) · Communications Physics · doi:10.1038/s42005-022-00810-9 · Cited by 19
Stober, S. T., Harwood, S. M., Trenev, D., Barkoutsos, P. K., Gujarati, T. P., & Mostame, S. (2022) · Physical Review A · doi:10.1103/physreva.105.012425 · Cited by 18
Quantum algorithm for gravitational-wave matched filtering
Gao, S., Hayes, F. J., Croke, S., Messenger, C., & Veitch, J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023006 · Cited by 23
How Parallel Circuit Execution Can Be Useful for NISQ Computing?
Niu, S., & Todri‐Sanial, A. (2022) · Design, Automation, and Test in Europe · doi:10.23919/date54114.2022.9774512 · Cited by 30
Quantum algorithms for the generalized eigenvalue problem
Liang, J., Shen, S., Li, M., & Fei, S.-M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03370-z · Cited by 20
Hierarchical qubit maps and hierarchically implemented quantum error correction
Klco, N., & Savage, M. J. (2021) · Physical Review A · doi:10.1103/physreva.104.062425 · Cited by 26
Design of strongly nonlinear graphene nanoelectromechanical systems in quantum regime
Lee, J., LaHaye, M., & Feng, P. X. ‐. (2022) · Applied Physics Letters · doi:10.1063/5.0069561 · Cited by 15
qopt: An Experiment-Oriented Software Package for Qubit Simulation and Quantum Optimal Control
Teske, J. D., Cerfontaine, P., & Bluhm, H. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.034036 · Cited by 20
Non-equilibrium dynamics of a dissipative two-site Hubbard model simulated on IBM quantum computers
Tornow, S., Gehrke, W., & Helmbrecht, U. (2022) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac6bd0 · Cited by 26
Improved quantum computing with higher-order Trotter decomposition
Yang, X., Nie, X., Ji, Y., Xin, T., Lu, D., & Li, J. (2022) · Physical Review A · doi:10.1103/physreva.106.042401 · Cited by 19
Numerical gate synthesis for quantum heuristics on bosonic quantum processors
Özgüler, A. B., & Venturelli, D. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.900612 · Cited by 20
Optimizing counterdiabaticity by variational quantum circuits
Sun, D., Chandarana, P., Xin, Z., & Chen, X. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0282 · Cited by 20
Variational approach to the quantum separability problem
Consiglio, M., Apollaro, T. J. G., & Wieśniak, M. (2022) · Physical Review A · doi:10.1103/physreva.106.062413 · Cited by 23
Approximate Quantum Circuit Reconstruction
Chen, D., Baheri, B., Chaudhary, V., Guan, Q., Xie, N., & Xu, S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00073 · Cited by 24
Irtija, N., Plusquellic, J., Tsiropoulou, E. E., Goldberg, J., Lobser, D., & Stick, D. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3238670 · Cited by 22
Seven useful questions in density functional theory
Crisostomo, S., Pederson, R. D., Kozlowski, J., Kalita, B., Cancio, A. C., Datchev, K. R., Wasserman, A., Song, S., & Burke, K. (2023) · Letters in Mathematical Physics · doi:10.1007/s11005-023-01665-z · Cited by 19
Classically optimized variational quantum eigensolver with applications to topological phases
Okada, K. N., Osaki, K., Mitarai, K., & Fujii, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043217 · Cited by 30
Torggler, V., Aumann, P., Ritsch, H., & Lechner, W. (2019) · Quantum · doi:10.22331/q-2019-06-03-149 · Cited by 36
Loss-tolerant teleportation on large stabilizer states
Morley-Short, S., Gimeno-Segovia, M., Rudolph, T., & Cable, H. V. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aaf6c4 · Cited by 22
Quantum humanities: a vision for quantum computing in digital humanities
Barzen, J., & Leymann, F. (2019) · SICS Software-Intensive Cyber-Physical Systems · doi:10.1007/s00450-019-00419-4 · Cited by 21
Quantum phase transition with inhomogeneous driving in the Lechner-Hauke-Zoller model
Hartmann, A., & Lechner, W. (2019) · Physical Review A · doi:10.1103/physreva.100.032110 · Cited by 19
Concurrency in DD-based Quantum Circuit Simulation
Hillmich, S., Zulehner, A., & Wille, R. (2020) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac47756.2020.9045711 · Cited by 22
Certified variational quantum algorithms for eigenstate preparation
Kardashin, A., Uvarov, A., Yudin, D. I., & Biamonte, J. (2020) · Physical Review A · doi:10.1103/physreva.102.052610 · Cited by 18
Portfolio Asset Identification Using Graph Algorithms on a Quantum AnnealerPreprint
Kalra, A., Qureshi, F., & Tisi, M. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3333537 · Cited by 17
Quantum Computing for Healthcare: A ReviewPreprint
Rasool, R. U., Ahmad, H. F., Rafique, W., Qayyum, A., Qadir, J., & Anwar, Z. (2023) · doi:10.36227/techrxiv.17198702 · Cited by 20
Multi-particle quantum walks on 3D integrated photonic chip
Zhou, W.-H., Wang, X.-W., Ren, R.-J., Fu, Y.-X., Chang, Y.-J., Xu, X.-Y., Tang, H., & Jin, X.-M. (2024) · Light: Science & Applications · doi:10.1038/s41377-024-01627-7 · Cited by 16
Yang, C.-H. H., Qi, J., Chen, S. Y.-C., Chen, P.-Y., Siniscalchi, S. M., Ma, X., & Lee, C.-H. (2021) · ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp39728.2021.9413453 · Cited by 158
A Hybrid Quantum-Classical Generative Adversarial Network for Near-Term Quantum Processors
Boyle, A. O., & Nikandish, G. (2024) · IEEE Access · doi:10.1109/access.2024.3433383 · Cited by 27
Assessing the potential of quantum computing in agriculture
Pook, T., Vandenplas, J., Boschero, J. C., Aguilera, E., Leijnse, K., Chauhan, A., Bouzembrak, Y., Knapen, R., & Aldridge, M. N. (2025) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2025.110332 · Cited by 27
Meyer, J., Reches, Y., Rozenman, G. G., Oz, Y., Suchowski, H., & Arie, A. (2025) · Optics Letters · doi:10.1364/ol.557649 · Cited by 22
Pauli path simulations of noisy quantum circuits beyond average case
González-García, G., Cirac, J. I., & Trivedi, R. (2025) · Quantum · doi:10.22331/q-2025-05-05-1730 · Cited by 58
Efficient Formal Verification of Quantum Error Correcting Programs
Huang, Q., Zhou, L., Fang, W. S., Zhao, M., & Ying, M. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3729293 · Cited by 36
Choi, D.-J., Phark, S., Heinrich, A. J., & Lorente, N. (2025) · Nanoscale Advances · doi:10.1039/d5na00316d · Cited by 18
Neural Projected Quantum Dynamics: a systematic study
Gravina, L., Savona, V., & Vicentini, F. (2025) · Quantum · doi:10.22331/q-2025-07-22-1803 · Cited by 45
Distributed Quantum Computing: Applications and Challenges
Boschero, J. C., Neumann, N. M. P., van der Schoot, W., Sijpesteijn, T., & Wezeman, R. S. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-92602-0_6 · Cited by 18
Islam, M., Hasan, M. J., & Mahdy, M. R. C. (2025) · PLoS ONE · doi:10.1371/journal.pone.0331870 · Cited by 21
Theory of Noise-Scaled Stability Bounds and Entanglement Rate Maximization in the Quantum Internet
Gyöngyösi, L., & Imre, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-58200-6 · Cited by 17
Fault-Tolerant Coding for Quantum Communication
Christandl, M., & Müller‐Hermes, A. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3169438 · Cited by 28
Impacts of noise and structure on quantum information encoded in a quantum memory
Otten, M., Kapoor, K., Özgüler, A. B., Holland, E. T., Kowalkowski, J., Alexeev, Y., & Lyon, A. L. (2021) · Physical Review A · doi:10.1103/physreva.104.012605 · Cited by 24
Quantum algorithm for MUSIC-based DOA estimation in hybrid MIMO systems
Meng, F., Li, Z., Yu, X., & Zhang, Z. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac44dd · Cited by 16
Quantum gradient descent algorithms for nonequilibrium steady states and linear algebraic systems
Liang, J., Wei, S.-J., & Fei, S.-M. (2022) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1844-7 · Cited by 17
Truger, F., Beisel, M., Barzen, J., Leymann, F., & Yussupov, V. (2022) · Electronics · doi:10.3390/electronics11071033 · Cited by 17
Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
Steinberg, M., Feld, S., Almudéver, C. G., Marthaler, M., & Reiner, J.-M. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3160015 · Cited by 24
Hong, C.-L., Tsai, T., Chou, J., Chen, P.-J., Tsai, P.-K., Chen, Y.-C., Kuo, E.-J., Srolovitz, D. J., Hu, A., Cheng, Y., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020360 · Cited by 24
Variational convolutional neural networks classifiers
Huang, F., Tan, X., Huang, R., & Xu, Q. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.128067 · Cited by 21
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.