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 3,501–3,600 of 8,640
Integration of IoT and Quantum Computing: Revolutionizing Manufacturing
Sonavane, A. S., & Aylani, A. (2024) · Advances in computer and electrical engineering book series · doi:10.4018/979-8-3693-3940-4.ch016 · Cited by 8
Photonic counterdiabatic quantum optimization algorithm
Chandarana, P., Paul, K., de Andoin, M. G., Ban, Y., Sanz, M., & Chen, X. (2024) · Communications Physics · doi:10.1038/s42005-024-01807-2 · Cited by 16
Timescales in many-body fast-neutrino-flavor conversion
Bhaskar, R., Roggero, A., & Savage, M. J. (2024) · Physical Review C · doi:10.1103/physrevc.110.045801 · Cited by 18
Loglisci, C. A. A. M. D., Malerba, D., & Pascazio, S. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00196-7 · Cited by 9
Rao, X. (2024) · Abu Dhabi International Petroleum Exhibition & Conference (ADIPEC) · doi:10.2118/221850-ms · Cited by 12
Photonic quantum generative adversarial networks for classical data
Sedrakyan, T., & Salavrakos, A. (2024) · Optica Quantum · doi:10.1364/opticaq.530346 · Cited by 19
Gradients and frequency profiles of quantum re-uploading models
Barthe, A., & Pérez-Salinas, A. (2024) · Quantum · doi:10.22331/q-2024-11-14-1523 · Cited by 40
Jiang, J., & Wang, Y. (2024) · Mathematics · doi:10.3390/math13010090 · Cited by 10
Programmable Quantum Simulations on a Trapped-Ion Quantum Computer with a Global Drive
Shapira, Y., Markov, J., Akerman, N., Stern, A., & Ozeri, R. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.010602 · Cited by 24
Quantum Algorithms for the Physical Layer: Potential Applications to Physical Layer Security
Matsumine, T., Ochiai, H., & Shikata, J. (2025) · IEEE Access · doi:10.1109/access.2025.3528443 · Cited by 14
Iovane, G., & Amatore, R. (2025) · Applied Sciences · doi:10.3390/app15020759 · Cited by 13
QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architectures
Yin, K., Zhang, H., Fang, X., Shi, Y., Humble, T. S., Li, A., & Ding, Y. (2025) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3669940.3707236 · Cited by 24
Optimizing Quantum Circuits, Fast and Slow
Xu, A., Molavi, A., Tannu, S., & Albarghouthi, A. (2025) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3669940.3707240 · Cited by 30
Kuno, Y., Orito, T., & Ichinose, I. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.064111 · Cited by 22
Quantum Decryption using Shor’s Algorithm
Mishra, S., Agarwal, O., & Patel, S. K. (2024) · IEEE Pune Section International Conference (PuneCon) · doi:10.1109/punecon63413.2024.10895777 · Cited by 8
Quantum error mitigation in quantum annealing
Raymond, J., Amin, M. H. S., King, A. D., Harris, R., Bernoudy, W., Berkley, A. J., Boothby, K., Smirnov, A. Y., Altomare, F., Babcock, M. C., et al. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00977-3 · Cited by 36
Chained continuous quantum federated learning framework
Gurung, D., & Pokhrel, S. R. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107800 · Cited by 16
Noise-adapted qudit codes for amplitude-damping noise
Dutta, S., Biswas, D., & Mandayam, P. (2025) · Physical Review A · doi:10.1103/physreva.111.032438 · Cited by 18
Detect anomalous quartic gauge couplings at muon colliders with quantum kernel k-means
Zhang, S., Chen, K.-X., & Yang, J.-C. (2025) · The European Physical Journal C · doi:10.1140/epjc/s10052-025-14069-1 · Cited by 8
Mullinax, J. W., Anastasiou, P. G., Larson, J. M., Economou, S. E., & Tubman, N. M. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00150 · Cited by 19
Qudit Shadow Estimation Based on the Clifford Group and the Power of a Single Magic Gate
Mao, C., Yi, C., & Zhu, H. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.160801 · Cited by 23
An Innovative Algorithm for Attacking Symmetric Ciphers Using D-Wave Quantum Annealing
Pei, Z., Hong, C., Xia, F., & Wang, C. (2025) · Tsinghua Science & Technology · doi:10.26599/tst.2024.9010231 · Cited by 12
Circuit-Efficient Qubit Excitation-Based Variational Quantum Eigensolver
Sun, Z., Li, X., Liu, J., Li, Z., & Yang, J. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00119 · Cited by 16
QryptGen: a quantum GAN-based image encryption key generator using chaotic data distributions
Ahn, G., & Hong, S. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04750-5 · Cited by 11
Liu, Y., Kaneko, K., Baba, K., Koyama, J., Kimura, K., & Takeda, N. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3571484 · Cited by 23
Random pulse sequences for qubit noise spectroscopy
Huang, K. H., Farfurnik, D., Seif, A., Hafezi, M., & Liu, Y.-K. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.054090 · Cited by 15
Optimal Trace-Distance Bounds for Free-Fermionic States: Testing and Improved Tomography
Bittel, L., Mele, A. A., Eisert, J., & Leone, L. (2025) · PRX Quantum · doi:10.1103/pzx6-nkfb · Cited by 70
Song, B., Liu, T., Meng, F., Yang, W., & Lu, W. (2025) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2025.3577781 · Cited by 10
Menéses, E. L., Cáceres-Tello, J., Galán-Hernández, J. J., & Catalán, L. L. (2025) · Computers · doi:10.3390/computers14060235 · Cited by 15
Variational Quantum Algorithms in the era of Early Fault Tolerance
Dangwal, S., Vittal, S., Seifert, L. M., Chong, F. T., & Ravi, G. S. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731112 · Cited by 20
Parameter-efficient Quantum Denoising Diffusion Probabilistic Models with temporal encoding
Zhang, X., & Chen, C. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107981 · Cited by 16
Srivastava, A. K., Sharma, S., Hussain, S., Ghosh, S., & Sharma, N. (2025) · International Conference on Communication, Security and Artificial Intelligence (ICCSAI) · doi:10.1109/iccsai64074.2025.11064720 · Cited by 15
Use of hybrid quantum-classical algorithms for enhancing biomarker classification
Astuti, A., Shih, P.-K., Lee, S., Mekala, V. R., Wijaya, E. B., & Ng, K. (2025) · PLoS ONE · doi:10.1371/journal.pone.0327928 · Cited by 14
Quantum annealing feature selection on light-weight medical image datasets
Nau, M. A., Nutricati, L. A., Camino, B., Warburton, P. A., & Maier, A. (2025) · Scientific Reports · doi:10.1038/s41598-025-14611-x · Cited by 17
NeuroQ: Quantum-Inspired Brain Emulation
Vallverdú, J., & Rius, G. (2025) · Biomimetics · doi:10.3390/biomimetics10080516 · Cited by 9
Quantum-computer-based verification of quantum thermodynamic uncertainty relation
Ishida, N., & Hasegawa, Y. (2025) · Physical review. E · doi:10.1103/9xpz-62cw · Cited by 15
In the Shadow of the Hadamard Test: Using the Garbage State for Good and Further Modifications
Faehrmann, P. K., Eisert, J., & Kueng, R. (2025) · Physical Review Letters · doi:10.1103/cqjw-kl8s · Cited by 19
Quantum and quantum-inspired computing in civil engineering
Ploennigs, J., Smarsly, K., Berger, M., Dragos, K., & Kliesch, M. (2025) · Advanced Engineering Informatics · doi:10.1016/j.aei.2025.103960 · Cited by 13
Toward Variational Quantum Algorithms for Generalized Linear and Nonlinear Transport Phenomena
Bengoechea, S., Over, P., Jaksch, D., & Rung, T. (2025) · AIAA Journal · doi:10.2514/1.j065582 · Cited by 16
QCPINN: quantum-classical physics-informed neural networks for solving PDEs
Farea, A., Khan, S., & Çelebi, M. S. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ae1c91 · Cited by 41
Variational Quantum Computing for Quantum Simulation: Principles, Implementations, and Challenges
Galvão, L. Q., de Souza, A. B. M., Moret, M. A., & Cruz, C. (2025) · Brazilian Journal of Physics · doi:10.1007/s13538-025-01946-z · Cited by 11
Arora, N., & Kumar, P. (2025) · Communications of the ACM · doi:10.1145/3745782 · Cited by 33
Verma, S., Mitra, A., Wang, Q., D’Cunha, R., Jangid, B., Hennefarth, M. R., Agarawal, V., Otis, L., Haldar, S., Hermes, M. R., et al. (2026) · Chemical Reviews · doi:10.1021/acs.chemrev.5c00486 · Cited by 24
Asymmetric Quantum Multicast Network Coding: Asymmetric Optimal Cloning over Quantum Networks
Hirota, Y., & Owari, M. (2022) · Applied Sciences · doi:10.3390/app12126163 · Cited by 7
A novel approach for emulating quantum computers on classical platforms
Xin, T. (2019) · Quantum Engineering · doi:10.1002/que2.18 · Cited by 8
A quantum procedure for map generation
Wootton, J. R. (2020) · IEEE Conference on Games (CoG) · doi:10.1109/cog47356.2020.9231571 · Cited by 14
Sample-efficient benchmarking of multiphoton interference on a boson sampler in the sparse regime
Renema, J. J., Wang, H., Qin, J., You, X., Lu, C., & Pan, J.-W. (2021) · Physical Review A · doi:10.1103/physreva.103.023722 · Cited by 10
Adversarial learning in quantum artificial intelligence
Shen, P.-X., Jiang, W.-J., Li, W., Lu, Z., & Deng, D.-L. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210789 · Cited by 10
Post-processing optimization for continuous-variable quantum key distribution
Gyöngyösi, L. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.08.023 · Cited by 8
Noise-Aware Quantum Amplitude Estimation
Herbert, S., Williams, I., Guichard, R., & Ng, D. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3476929 · Cited by 26
Divide-and-conquer verification method for noisy intermediate-scale quantum computation
Takeuchi, Y., Takahashi, Y., Morimae, T., & Tani, S. (2022) · Quantum · doi:10.22331/q-2022-07-07-758 · Cited by 11
Coarse-grained intermolecular interactions on quantum processors
Anderson, L. W., Kiffner, M., Barkoutsos, P. K., Tavernelli, I., Crain, J. N., & Jaksch, D. (2022) · Physical Review A · doi:10.1103/physreva.105.062409 · Cited by 11
Analytical and experimental study of center-line miscalibrations in Mølmer-Sørensen gates
Martínez-García, F., Gerster, L., Vodola, D., Hrmo, P., Monz, T., Schindler, P., & Müller, M. (2022) · Physical Review A · doi:10.1103/physreva.105.032437 · Cited by 15
Improving quantum genetic optimization through granular computing
Acampora, G., & Vitiello, A. (2022) · Granular Computing · doi:10.1007/s41066-022-00348-9 · Cited by 8
Robust quantum classifiers via NISQ adversarial learning
Banchi, L. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00359-1 · Cited by 8
Cryogenic Controller for Electrostatically Controlled Quantum Dots in 22-nm Quantum SoC
Staszewski, R. B., Esmailiyan, A., Wang, H., Koskin, E., Giounanlis, P., Wu, X., Kozioł, A. E., Sokolov, A., Bashir, I., Asker, M., et al. (2022) · IEEE Open Journal of the Solid-State Circuits Society · doi:10.1109/ojsscs.2022.3213528 · Cited by 10
Virtual quantum error detection
Tsubouchi, K., Suzuki, Y., Tokunaga, Y., Yoshioka, N., & Endo, S. (2023) · Physical Review A · doi:10.1103/physreva.108.042426 · Cited by 17
Quantum approximate optimization algorithm applied to the binary perceptron
Torta, P., Mbeng, G. B., Baldassi, C., Zecchina, R., & Santoro, G. E. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.094202 · Cited by 20
Quantum generative adversarial imitation learning
Xiao, T., Huang, J., Li, H., Fan, J., & Zeng, G. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acc605 · Cited by 12
Material-Inherent Noise Sources in Quantum Information Architecture
Yang, H., & Kim, N. Y. (2023) · Materials · doi:10.3390/ma16072561 · Cited by 12
Multi-class classification based on quantum state discrimination
Giuntini, R., Arango, A. C. G., Freytes, H., Holik, F., & Sergioli, G. (2023) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2023.03.012 · Cited by 11
Symmetry-adapted encodings for qubit number reduction by point-group and other Boolean symmetries
Picozzi, D., & Tennyson, J. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acd86c · Cited by 21
Experimental quantum natural gradient optimization in photonics
Wang, Y., Xue, S., Wang, Y., Ding, J., Shi, W., Wang, D., Liu, Y., Liu, Y., Fu, X., Huang, G.-Y., et al. (2023) · Optics Letters · doi:10.1364/ol.494560 · Cited by 10
Variational quantum non-orthogonal optimization
Bermejo, P., & Orús, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-37068-2 · Cited by 13
SLIQ: Quantum Image Similarity Networks on Noisy Quantum Computers
Silver, D., Patel, T., Ranjan, A., Gandhi, H., Cutler, W., & Tiwari, D. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i8.26175 · Cited by 14
Cross-platform verification in quantum networks
Knörzer, J., Malz, D., & Cirac, J. I. (2023) · Physical Review A · doi:10.1103/physreva.107.062424 · Cited by 17
Mitigating quantum errors via truncated Neumann series
Wang, K., Chen, Y.-A., & Wang, X. (2023) · Science China Information Sciences · doi:10.1007/s11432-023-3786-1 · Cited by 15
Computation of Green's function by local variational quantum compilation
Kanasugi, S., Tsutsui, S., Nakagawa, Y. O., Maruyama, K., Oshima, H., & Sato, S. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033070 · Cited by 17
VQNE: Variational Quantum Network Embedding with Application to Network Alignment
Ye, X., Yan, G., & Yan, J. (2023) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3580305.3599542 · Cited by 14
Resonant direct cnot in remote double quantum dot spin qubits
McMillan, S. R., & Burkard, G. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.125414 · Cited by 8
Prakash, P. M. (2023) · Optical and Quantum Electronics · doi:10.1007/s11082-023-05347-x · Cited by 8
RetractedEffective and Efficient Qubit Mapper
Fu, H., Zhu, M., Wu, J., Xie, W., Su, Z., & Li, X. (2023) · doi:10.1109/iccad57390.2023.10323857 · Cited by 11
DISQ: Dynamic Iteration Skipping for Variational Quantum Algorithms
Zhang, J., Wang, H., Ravi, G. S., Chong, F. T., Han, S., Mueller, F., & Chen, Y. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00120 · Cited by 15
SnCQA: A hardware-efficient equivariant quantum convolutional circuit architecture
Zheng, H., Kang, C., Ravi, G. S., Wang, H., Setia, K., Chong, F. T., & Liu, J. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00034 · Cited by 25
Persisting quantum effects in the anisotropic Rabi model at thermal equilibrium
Xu, H.-G., Montenegro, V., Xianlong, G., Jin, J., & Neto, G. D. D. M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013001 · Cited by 11
Progress of Gate‐Defined Semiconductor Spin Qubit: Host Materials and Device Geometries
Liu, Y., Guan, S., Luo, J., & Li, S. (2024) · Advanced Functional Materials · doi:10.1002/adfm.202304725 · Cited by 13
Okada, K. N., Nishi, H., Kosugi, T., & Matsushita, Y. (2024) · Scientific Reports · doi:10.1038/s41598-023-50406-8 · Cited by 15
The duality game: a quantum algorithm for body dynamics modeling
Nguyen, P.-N. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04223-7 · Cited by 12
Implementation of Database Search with Quantum Computing: Grover's Algorithm vs Linear Search
Khurana, S., & Nene, M. J. (2023) · International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE) · doi:10.1109/aikiie60097.2023.10389962 · Cited by 14
Solving Logistic-Oriented Bin Packing Problems Through a Hybrid Quantum-Classical Approach
Romero, S. V., Osaba, E., Villar-Rodríguez, E., & Asla, A. (2023) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc57777.2023.10422581 · Cited by 9
Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
Banks, R. J., Browne, D. E., & Warburton, P. A. (2024) · Quantum · doi:10.22331/q-2024-02-13-1253 · Cited by 13
Avoiding barren plateaus in the variational determination of geometric entanglement
Zambrano, L., Muñoz-Moller, A. D., Muñoz, M., Pereira, L., & Delgado, A. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad2a16 · Cited by 14
Iterative method to improve the precision of the quantum-phase-estimation algorithm
Li, J. (2024) · Physical Review A · doi:10.1103/physreva.109.032606 · Cited by 12
Cutting a Wire with Non-Maximally Entangled States
Bechtold, M., Barzen, J., Leymann, F., & Mandl, A. (2024) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw63119.2024.00185 · Cited by 15
Training quantum Boltzmann machines with the β-variational quantum eigensolver
Huijgen, O., Coopmans, L., Najafi, P., Benedetti, M., & Kappen, H. J. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad370f · Cited by 21
Generating Universal Adversarial Perturbations for Quantum Classifiers
Anil, G., Vinod, V., & Narayan, A. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i10.28963 · Cited by 17
Universal Control of Symmetric States Using Spin Squeezing
Gutman, N., Gorlach, A. A., Tziperman, O., Ruimy, R., & Kaminer, I. E. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.153601 · Cited by 19
FragQC: An efficient quantum error reduction technique using quantum circuit fragmentation
Basu, S., Das, A., Saha, A., Chakrabarti, A., & Sur‐Kolay, S. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112085 · Cited by 20
Sajadimanesh, S., & Atoofian, E. (2024) · Physical Review A · doi:10.1103/physreva.109.052601 · Cited by 8
A quantum computing concept for 1-D elastic wave simulation with exponential speedup
Schade, M., Bösch, C., Hapla, V., & Fichtner, A. (2024) · Geophysical Journal International · doi:10.1093/gji/ggae160 · Cited by 22
An RNN–policy gradient approach for quantum architecture search
Wang, G., Wang, B.-H., & Fei, S.-M. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04393-y · Cited by 13
Classical shadow tomography with mutually unbiased bases
Wang, Y., & Cui, W. (2024) · Physical Review A · doi:10.1103/physreva.109.062406 · Cited by 17
A Thorough Study of State Leakage Mitigation in Quantum Computing with One-Time Pad
Xu, C., Sikora, J., & Szefer, J. M. (2024) · IEEE International Symposium on Hardware Oriented Security and Trust (HOST) · doi:10.1109/host55342.2024.10545386 · Cited by 13
Wide-Band Unambiguous Quantum Sensing via Geodesic Evolution
Zeng, K., Yu, X., Plenio, M. B., & Wang, Z. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.250801 · Cited by 18
Quantum Computation of Conical Intersections on a Programmable Superconducting Quantum Processor
Zhao, S., Tang, D., Xiao, X., Wang, R., Sun, Q., Chen, Z., Cai, X., Li, Z., Yu, H., & Fang, W. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c01314 · Cited by 14
Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
Gong, W., Zhou, S., & Li, T. (2024) · Quantum · doi:10.22331/q-2024-07-15-1409 · Cited by 26
Macaluso, A. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00856-7 · Cited by 16
Quantum error cancellation in photonic systems: Undoing photon losses
Taylor, A., Bressanini, G., Kwon, H., & Kim, M. S. (2024) · Physical Review A · doi:10.1103/physreva.110.022622 · Cited by 11
Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
Ikeda, T. N., Kono, H., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033285 · Cited by 18
Experimental demonstration of quantum continual learning with superconducting qubits
Zhang, C., Lu, Z., Zhao, L., Xu, S., Li, W., Wang, K., Chen, J., Wu, Y., Jin, F., Zhu, X., et al. (2026) · npj Quantum Information · doi:10.1038/s41534-025-01174-y · Cited by 17
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.