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 101–200 of 8,640
Subspace-search variational quantum eigensolver for excited states
Nakanishi, K. M., Mitarai, K., & Fujii, K. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033062 · Cited by 337
Repeated quantum error detection in a surface code
Andersen, C. K., Remm, A., Lazar, S., Krinner, S., Lacroix, N., Norris, G. J., Gabureac, M., Eichler, C., & Wallraff, A. (2020) · Nature Physics · doi:10.1038/s41567-020-0920-y · Cited by 337
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Guerreschi, G. G., & Matsuura, A. Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-43176-9 · Cited by 337
Ground-state energy estimation of the water molecule on a trapped-ion quantum computer
Nam, Y., Chen, J.-S., Pisenti, N. C., Wright, K., Delaney, C., Maslov, D., Brown, K. R., Allen, S., Amini, J. M., Apisdorf, J., et al. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0259-3 · Cited by 345
Robust data encodings for quantum classifiers
LaRose, R., & Coyle, B. (2020) · Physical Review A · doi:10.1103/physreva.102.032420 · Cited by 326
Observation of topological phenomena in a programmable lattice of 1,800 qubits
King, A. D., Carrasquilla, J., Raymond, J., Ozfidan, I., Andriyash, E., Berkley, A., Reis, M., Lanting, T., Harris, R., Altomare, F., et al. (2018) · Nature · doi:10.1038/s41586-018-0410-x · Cited by 323
Strawberry Fields: A Software Platform for Photonic Quantum Computing
Killoran, N., Izaac, J., Quesada, N., Bergholm, V., Amy, M., & Weedbrook, C. (2019) · Quantum · doi:10.22331/q-2019-03-11-129 · Cited by 323
Quantum Simulation for High-Energy Physics
Bauer, C. W., Davoudi, Z., Balantekin, A. B., Bhattacharya, T., Carena, M., de Jong, W. A., Draper, P., El-Khadra, A., Gemelke, N., Hanada, M., et al. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.027001 · Cited by 326
Self-citationExpressive power of parametrized quantum circuits
Du, Y., Hsieh, M.-H., Liu, T., & Tao, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033125 · Cited by 318
Hierarchical quantum classifiers
Grant, E., Benedetti, M., Cao, S., Hallam, A., Lockhart, J., Stojevic, V., Green, A. G., & Severini, S. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0116-9 · Cited by 318
Reconstructing quantum states with generative models
Carrasquilla, J., Torlai, G., Melko, R. G., & Aolita, L. (2019) · Nature Machine Intelligence · doi:10.1038/s42256-019-0028-1 · Cited by 317
Scalable integrated single-photon source
Uppu, R., Pedersen, F. T., Wang, Y., Olesen, C. T., Papon, C., Zhou, X., Midolo, L., Scholz, S., Wieck, A. D., Ludwig, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.abc8268 · Cited by 309
Tannu, S. S., & Qureshi, M. K. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304007 · Cited by 306
“However, there exists a class of applications highlighted by Preskill [25] that can still be viable with such Noisy and Intermediate-Scale Quantum (NISQ) computing.”
BackgroundMethodCMOS-based cryogenic control of silicon quantum circuits
Xue, X., Patra, B., van Dijk, J. P. G., Samkharadze, N., Subramanian, S., Corna, A., Paquelet Wuetz, B., Jeon, C., Sheikh, F., Juarez-Hernandez, E., et al. (2021) · Nature · doi:10.1038/s41586-021-03469-4 · Cited by 306
Performance and structure of single-mode bosonic codes
Albert, V. V., Noh, K., Duivenvoorden, K., Young, D. J., Brierley, R. T., Reinhold, P., Vuillot, C., Li, L., Shen, C., Girvin, S. M., et al. (2018) · Physical Review A · doi:10.1103/physreva.97.032346 · Cited by 305
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
“As a main application of our simulation algorithms we envision verification of noisy intermediatesize quantum circuits [49] in the regime when a brute-force classical simulation may be impractical [3, 35, 44].”
MethodScalable Probes of Measurement-Induced Criticality
Gullans, M. J., & Huse, D. A. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.070606 · Cited by 292
Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
Foxen, B., Neill, C., Dunsworth, A., Roushan, P., Chiaro, B., Megrant, A., Kelly, J., Chen, Z., Satzinger, K., Barends, R., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.120504 · Cited by 293
Mixed-State Entanglement from Local Randomized Measurements
Elben, A., Kueng, R., Huang, H.-Y. (., van Bijnen, R., Kokail, C., Dalmonte, M., Calabrese, P., Kraus, B., Preskill, J., Zoller, P., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.200501 · Cited by 292
Self-citationHybrid quantum-classical convolutional neural networks
Liu, J., Lim, K. H., Wood, K. L., Huang, W., Guo, C., & Huang, H.-L. (2021) · Science China Physics, Mechanics & Astronomy · doi:10.1007/s11433-021-1734-3 · Cited by 289
On the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics · doi:10.1038/s41567-018-0318-2 · Cited by 287
Hybrid integration methods for on-chip quantum photonics
Kim, J.-H., Aghaeimeibodi, S., Carolan, J., Englund, D., & Waks, E. (2020) · Optica · doi:10.1364/optica.384118 · Cited by 272
“While quantum simulators and noisy intermediate-scale quantum processors are now becoming feasible [6,201], it is necessary to perform heuristic benchmarking on various problem classes.”
BackgroundDifferentiable learning of quantum circuit Born machines
Liu, J.-G., & Wang, L. (2018) · Physical Review A · doi:10.1103/physreva.98.062324 · Cited by 279
Simulating quantum many-body dynamics on a current digital quantum computer
Smith, A., Kim, M. S., Pollmann, F., & Knolle, J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0217-0 · Cited by 278
Experimental Quantum Generative Adversarial Networks for Image Generation
Huang, H.-L., Du, Y., Gong, M., Zhao, Y., Wu, Y., Wang, C., Li, S., Liang, F., Lin, J., Xu, Y., et al. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.024051 · Cited by 277
Hierarchical quantum classifiers
Grant, E., Benedetti, M., Cao, S., Hallam, A., Lockhart, J., Stojevic, V, Green, A. G., & Simone Severini, B. (2018) · UCL Discovery (University College London) · Cited by 296
Simulating Large Quantum Circuits on a Small Quantum Computer
Peng, T., Harrow, A. W., Ozols, M., & Wu, X. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.150504 · Cited by 267
Colloquium : Quantum batteries
Campaioli, F., Gherardini, S., Quach, J. Q., Polini, M., & Andolina, G. M. (2024) · Reviews of Modern Physics · doi:10.1103/revmodphys.96.031001 · Cited by 268
Gard, B. T., Zhu, L., Barron, G. S., Mayhall, N. J., Economou, S. E., & Barnes, E. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0240-1 · Cited by 266
Neural-Network Approach to Dissipative Quantum Many-Body Dynamics
Hartmann, M. J., & Carleo, G. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.250502 · Cited by 263
Realization of High-Fidelity CZ and ZZ -Free iSWAP Gates with a Tunable Coupler
Sung, Y., Ding, L., Braumüller, J., Vepsäläinen, A., Kannan, B., Kjaergaard, M., Greene, A., Samach, G. O., McNally, C., Kim, D., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.021058 · Cited by 262
Progress in quantum teleportation
Hu, X.-M., Guo, Y., Liu, B.-H., Li, C.-F., & Guo, G.-C. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00588-x · Cited by 261
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator
Pagano, G., Bapat, A., Becker, P., Collins, K. S., De, A., Hess, P. W., Kaplan, H. B., Kyprianidis, A., Tan, W. L., Baldwin, C., et al. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2006373117 · Cited by 262
Variational Quantum Linear Solver
Bravo-Prieto, C., LaRose, R., Cerezo, M., Subasi, Y., Cincio, L., & Coles, P. J. (2023) · Quantum · doi:10.22331/q-2023-11-22-1188 · Cited by 260
Superconducting nanowire single-photon detectors for quantum information
You, L. (2020) · Nanophotonics · doi:10.1515/nanoph-2020-0186 · Cited by 257
Quantum computing enhanced computational catalysis
von Burg, V., Low, G. H., Häner, T., Steiger, D. S., Reiher, M., Roetteler, M., & Troyer, M. (2020) · arXiv · doi:10.48550/arxiv.2007.14460 · Cited by 258
Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers
Huggins, W. J., McClean, J. R., Rubin, N. C., Jiang, Z., Wiebe, N., Whaley, K. B., & Babbush, R. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00341-7 · Cited by 256
Distributed quantum computing: A survey
Caleffi, M., Amoretti, M., Ferrari, D., Illiano, J., Manzalini, A., & Cacciapuoti, A. S. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110672 · Cited by 256
What Limits the Simulation of Quantum Computers?
Zhou, Y., Stoudenmire, E. M., & Waintal, X. (2020) · Physical Review X · doi:10.1103/physrevx.10.041038 · Cited by 254
“[4, 2, 2, 4] [3, 2, 2, 5] [4, 4, 4] [3, 4, 5] [26] [1, 24, 3] [4, 24] [3, 23, 3] [4, 2, 2, 4] [5, 2, 5] f = 98.”
BackgroundSU(2) non-Abelian gauge field theory in one dimension on digital quantum computers
Klco, N., Savage, M. J., & Stryker, J. R. (2020) · Physical Review D · doi:10.1103/physrevd.101.074512 · Cited by 251
Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
Murali, P., Mckay, D. C., Martonosi, M., & Javadi-Abhari, A. (2020) · Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3373376.3378477 · Cited by 253
Quantum computing enhanced computational catalysis
von Burg, V., Low, G. H., Häner, T., Steiger, D. S., Reiher, M., Roetteler, M., & Troyer, M. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033055 · Cited by 252
Information-Theoretic Bounds on Quantum Advantage in Machine Learning
Huang, H.-Y., Kueng, R., & Preskill, J. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.190505 · Cited by 250
Self-citationLow-cost error mitigation by symmetry verification
Bonet-Monroig, X., Sagastizabal, R., Singh, M., & O'Brien, T. E. (2018) · Physical Review A · doi:10.1103/physreva.98.062339 · Cited by 250
Quantum Computer Systems for Scientific Discovery
Alexeev, Y., Bacon, D., Brown, K. R., Calderbank, R., Carr, L. D., Chong, F. T., DeMarco, B., Englund, D., Farhi, E., Fefferman, B., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.017001 · Cited by 248
Self-citationCMOS-based cryogenic control of silicon quantum circuits
Xue, X., Patra, B., van Dijk, J. P. G., Samkharadze, N., Subramanian, S., Corna, A., Wuetz, B. P., Jeon, C., Sheikh, F., Juarez-Hernandez, E., et al. (2020) · RePEc: Research Papers in Economics · Cited by 248
Error-Mitigated Digital Quantum Simulation
McArdle, S., Yuan, X., & Benjamin, S. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.180501 · Cited by 245
Amplitude estimation without phase estimation
Suzuki, Y., Uno, S., Raymond, R., Tanaka, T., Onodera, T., & Yamamoto, N. (2020) · Quantum Information Processing · doi:10.1007/s11128-019-2565-2 · Cited by 241
Systematic literature review: Quantum machine learning and its applications
Peral-García, D., Cruz-Benito, J., & García-Peñalvo, F. J. (2024) · Computer Science Review · doi:10.1016/j.cosrev.2024.100619 · Cited by 246
Zhang, Z., & Zhuang, Q. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd4c3 · Cited by 243
Entanglement Phase Transitions in Measurement-Only Dynamics
Ippoliti, M., Gullans, M. J., Gopalakrishnan, S., Huse, D. A., & Khemani, V. (2021) · Physical Review X · doi:10.1103/physrevx.11.011030 · Cited by 243
Quantum Computer Systems for Scientific Discovery
Alexeev, Y., Bacon, D., Brown, K. R., Calderbank, R., Carr, L. D., Chong, F. T., DeMarco, B., Englund, D., Farhi, E., Fefferman, B., et al. (2021) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.6082/h7fqg-6vt65 · Cited by 240
Self-citationQuantum computing for healthcare: a review
Ur Rasool, R., Ahmad, H. F., Rafique, W., Qayyum, A., Qadir, J., & Anwar, Z. (2023) · Future Internet · doi:10.3390/fi15030094 · Cited by 242
Digital zero noise extrapolation for quantum error mitigation
Giurgica-Tiron, T., Hindy, Y., LaRose, R., Mari, A., & Zeng, W. J. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00045 · Cited by 241
“As quantum hardware becomes available in the noisy intermediate-scale quantum computing (NISQ) era [1], it is inevitable that today’s quantum programmer must deal with errors.”
BackgroundDigital zero noise extrapolation for quantum error mitigation
Giurgica-Tiron, T., Hindy, Y., LaRose, R., Mari, A., & Zeng, W. J. (2020) · arXiv · doi:10.48550/arxiv.2005.10921 · Cited by 241
Magnard, P., Storz, S., Kurpiers, P., Schär, J., Marxer, F., Lütolf, J., Walter, T., Besse, J.-C., Gabureac, M., Reuer, K., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.260502 · Cited by 237
Variational Quantum Simulation of General Processes
Endo, S., Sun, J., Li, Y., Benjamin, S. C., & Yuan, X. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.010501 · Cited by 237
Simulation methods for open quantum many-body systems
Weimer, H., Kshetrimayum, A., & Orús, R. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.015008 · Cited by 232
Exploring Entanglement and Optimization within the Hamiltonian Variational Ansatz
Wiersema, R., Zhou, C., de Sereville, Y., Carrasquilla, J. F., Kim, Y. B., & Yuen, H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020319 · Cited by 235
Engineered dissipation for quantum information science
Harrington, P. M., Mueller, E. J., & Murch, K. W. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00494-8 · Cited by 232
Limitations of optimization algorithms on noisy quantum devices
Franca, D. S., & Garcia-Patron, R. (2020) · arXiv · doi:10.48550/arxiv.2009.05532 · Cited by 234
Quantum Long Short-Term Memory
Chen, S. Y.-C., Yoo, S., & Fang, Y.-L. L. (2022) · ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp43922.2022.9747369 · Cited by 233
The prospects of quantum computing in computational molecular biology
Outeiral, C., Strahm, M., Shi, J., Morris, G. M., Benjamin, S. C., & Deane, C. M. (2021) · WIREs Computational Molecular Science · doi:10.1002/wcms.1481 · Cited by 232
Commercial applications of quantum computing
Bova, F., Goldfarb, A., & Melko, R. G. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00091-1 · Cited by 230
Quantum machine learning beyond kernel methods
Jerbi, S., Fiderer, L. J., Poulsen Nautrup, H., Kübler, J. M., Briegel, H. J., & Dunjko, V. (2023) · Nature Communications · doi:10.1038/s41467-023-36159-y · Cited by 229
Variational Quantum Monte Carlo Method with a Neural-Network Ansatz for Open Quantum Systems
Nagy, A., & Savona, V. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.250501 · Cited by 227
Limitations of optimization algorithms on noisy quantum devices
Stilck França, D., & García-Patrón, R. (2021) · Nature Physics · doi:10.1038/s41567-021-01356-3 · Cited by 232
Quantum variational algorithms are swamped with traps
Anschuetz, E. R., & Kiani, B. T. (2022) · Nature Communications · doi:10.1038/s41467-022-35364-5 · Cited by 226
A quantum deep convolutional neural network for image recognition
Li, Y., Zhou, R.-G., Xu, R., Luo, J., & Hu, W. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab9f93 · Cited by 225
“Particularly, in the context of noisy intermediate scale quantum (NISQ) devices [14], several interesting contributions toward quantum deep learning have been proposed using the quantum annealers [15, 16] or variational quantum circuits [17–20].”
BackgroundThe bitter truth about gate-based quantum algorithms in the NISQ era
Leymann, F., & Barzen, J. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abae7d · Cited by 224
“Being noisy and of intermediate scale coined the term noisy intermediate scale quantum (NISQ) computers [54].”
BackgroundVQE method: a short survey and recent developments
Fedorov, D. A., Peng, B., Govind, N., & Alexeev, Y. (2022) · Materials Theory · doi:10.1186/s41313-021-00032-6 · Cited by 224
“These ideas look attractive in theory, but in reality there are severe limitations in the computational capabilities of the currently available small quantum devices, which are often referred to as NISQ (noisy intermediate-scale quantum) devices [2].”
BackgroundSimulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S. B., Browne, D. E., Calpin, P., Campbell, E. T., Gosset, D., & Howard, M. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 224
Exact parameterization of fermionic wave functions via unitary coupled cluster theory
Evangelista, F. A., Chan, G. K.-L., & Scuseria, G. E. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5133059 · Cited by 220
Stochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Wilde, F., Meyer, J., Schuld, M., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Quantum · doi:10.22331/q-2020-08-31-314 · Cited by 219
Training of quantum circuits on a hybrid quantum computer
Zhu, D., Linke, N. M., Benedetti, M., Landsman, K. A., Nguyen, N. H., Alderete, C. H., Perdomo-Ortiz, A., Korda, N., Garfoot, A., Brecque, C., et al. (2019) · Science Advances · doi:10.1126/sciadv.aaw9918 · Cited by 215
Quantum Computing for High-Energy Physics: State of the Art and Challenges
Di Meglio, A., Jansen, K., Tavernelli, I., Alexandrou, C., Arunachalam, S., Bauer, C. W., Borras, K., Carrazza, S., Crippa, A., Croft, V., et al. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.037001 · Cited by 215
Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
Larocca, M., Czarnik, P., Sharma, K., Muraleedharan, G., Coles, P. J., & Cerezo, M. (2022) · Quantum · doi:10.22331/q-2022-09-29-824 · Cited by 214
“However, despite recent tremendous progress in quantum technologies, present-day quantum devices (known as Noisy Intermediate-Scale Quantum (NISQ) devices) are constrained by the limited number of qubits, connectivity, and by the presence of quantum noise [5].”
BackgroundSafavi-Naeini, A. H., Van Thourhout, D., Baets, R., & Van Laer, R. (2019) · Optica · doi:10.1364/optica.6.000213 · Cited by 213
A cryogenic CMOS chip for generating control signals for multiple qubits
Pauka, S. J., Das, K., Kalra, R., Moini, A., Yang, Y., Trainer, M., Bousquet, A., Cantaloube, C., Dick, N., Gardner, G. C., et al. (2021) · Nature Electronics · doi:10.1038/s41928-020-00528-y · Cited by 209
Quantum optical neural networks
Steinbrecher, G. R., Olson, J. P., Englund, D., & Carolan, J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0174-7 · Cited by 209
Machine Learning: Quantum vs Classical
Khan, T. M., & Robles-Kelly, A. (2020) · IEEE Access · doi:10.1109/access.2020.3041719 · Cited by 211
Quantum-dot-based deterministic photon–emitter interfaces for scalable photonic quantum technology
Uppu, R., Midolo, L., Zhou, X., Carolan, J., & Lodahl, P. (2021) · Nature Nanotechnology · doi:10.1038/s41565-021-00965-6 · Cited by 209
Demonstration of Fidelity Improvement Using Dynamical Decoupling with Superconducting Qubits
Pokharel, B., Anand, N., Fortman, B., & Lidar, D. A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.220502 · Cited by 209
Detecting crosstalk errors in quantum information processors
Sarovar, M., Proctor, T., Rudinger, K., Young, K., Nielsen, E., & Blume-Kohout, R. (2020) · Quantum · doi:10.22331/q-2020-09-11-321 · Cited by 209
Control and readout of a superconducting qubit using a photonic link
Lecocq, F., Quinlan, F., Cicak, K., Aumentado, J., Diddams, S. A., & Teufel, J. D. (2021) · Nature · doi:10.1038/s41586-021-03268-x · Cited by 208
Bosonic quantum error correction codes in superconducting quantum circuits
Cai, W., Ma, Y., Wang, W., Zou, C.-L., & Sun, L. (2021) · Fundamental Research · doi:10.1016/j.fmre.2020.12.006 · Cited by 207
Harnessing the Power of the Second Quantum Revolution
Deutsch, I. H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020101 · Cited by 207
“Error-mitigation schemes might reduce the detrimental effects of J -chaos [124] but one should be cautious about the implication for a quantum advantage in this case, since the solutions that are amenable to error suppression may also be easier to solve classically [73].”
BackgroundMethodMapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
Wille, R., Burgholzer, L., & Zulehner, A. (2019) · Proceedings of the 56th Annual Design Automation Conference 2019 · doi:10.1145/3316781.3317859 · Cited by 207
“They are aiming to utilize quantum computers for applications such as quantum chemistry, optimization, machine learning, cryptography, quantum simulation, or solving systems of linear equations [16].”
BackgroundSkyrmion Qubits: A New Class of Quantum Logic Elements Based on Nanoscale Magnetization
Psaroudaki, C., & Panagopoulos, C. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.067201 · Cited by 205
Quantum Technologies Need a Quantum Energy Initiative
Auffèves, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020101 · Cited by 203
Challenges and Opportunities of Near-Term Quantum Computing Systems
Corcoles, A. D., Kandala, A., Javadi-Abhari, A., McClure, D. T., Cross, A. W., Temme, K., Nation, P. D., Steffen, M., & Gambetta, J. M. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954005 · Cited by 203
“Such devices have been referred to as “noisy intermediate-scale quantum” (NISQ) [25] systems, i.e., non-fault-tolerant devices comprising tens or hundreds of qubits.”
MethodVirtual Distillation for Quantum Error Mitigation
Huggins, W. J., McArdle, S., O’Brien, T. E., Lee, J., Rubin, N. C., Boixo, S., Whaley, K. B., Babbush, R., & McClean, J. R. (2021) · Physical Review X · doi:10.1103/physrevx.11.041036 · Cited by 205
QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits
Wang, H., Ding, Y., Gu, J., Lin, Y., Pan, D. Z., Chong, F. T., & Han, S. (2022) · 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00057 · Cited by 198
Quantum simulations of materials on near-term quantum computers
Ma, H., Govoni, M., & Galli, G. (2020) · npj Computational Materials · doi:10.1038/s41524-020-00353-z · Cited by 197
Noise resilience of variational quantum compiling
Sharma, K., Khatri, S., Cerezo, M., & Coles, P. J. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab784c · Cited by 196
High-Fidelity, High-Scalability Two-Qubit Gate Scheme for Superconducting Qubits
Xu, Y., Chu, J., Yuan, J., Qiu, J., Zhou, Y., Zhang, L., Tan, X., Yu, Y., Liu, S., Li, J., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.240503 · Cited by 196
“We take advantage of this effect to measure the spectrum of the coupler [1].”
BackgroundStochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Sweke, R., Meyer, J. J., Meyer, J. J., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-28427 · Cited by 194
Colloquium : Quantum and classical discrete time crystals
Zaletel, M. P., Lukin, M., Monroe, C., Nayak, C., Wilczek, F., & Yao, N. Y. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.031001 · Cited by 191
Quantum agents in the Gym: a variational quantum algorithm for deep Q-learning
Skolik, A., Jerbi, S., & Dunjko, V. (2022) · Quantum · doi:10.22331/q-2022-05-24-720 · Cited by 191
Near-ideal spontaneous photon sources in silicon quantum photonics
Paesani, S., Borghi, M., Signorini, S., Maïnos, A., Pavesi, L., & Laing, A. (2020) · Nature Communications · doi:10.1038/s41467-020-16187-8 · Cited by 192
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.