The DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Quantum Computing for High-Energy Physics: State of the Art and Challenges
Open accessAbstract
Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage—namely, a significant (in some cases exponential) speedup of numerical simulations. The rapid development of hardware devices with various realizations of qubits enables the execution of small-scale but representative applications on quantum computers. In particular, the high-energy physics community plays a pivotal role in accessing the power of quantum computing, since the field is a driving source for challenging computational problems. This concerns, on the theoretical side, the exploration of models that are very hard or even impossible to address with classical techniques and, on the experimental side, the enormous data challenge of newly emerging experiments, such as the upgrade of the Large Hadron Collider. In this Roadmap paper, led by CERN, DESY, and IBM, we provide the status of high-energy physics quantum computations and give examples of theoretical and experimental target benchmark applications, which can be addressed in the near future. Having in mind hardware with about 100 qubits capable of executing several thousand two-qubit gates, where possible, we also provide resource estimates for the examples given using error-mitigated quantum computing. The ultimate declared goal of this task force is therefore to trigger further research in the high-energy physics community to develop interesting use cases for demonstrations on near-term quantum computers. Published by the American Physical Society 2024
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
A 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
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“Among decomposition methods, product formulas represent the simplest and most widely adopted paradigm [69, 78, 259].”
BackgroundMethodHardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Self-citationGeorgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932 · cited 1×
“Another pillar of quantum information science and technology is analog quantum simulators [37, 89, 90] which allow direct experimental access to various quantum many-body phenomena.”
Background
Cited by
Barren plateaus in variational quantum computing
Larocca, M., Thanasilp, S., Wang, S., Sharma, K., Biamonte, J., Coles, P. J., Cincio, L., McClean, J. R., Holmes, Z., & Cerezo, M. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00813-9 · Cited by 257
Self-citationProvable bounds for noise-free expectation values computed from noisy samples
Barron, S. V., Egger, D. J., Pelofske, E., Bärtschi, A., Eidenbenz, S., Lehmkuehler, M., & Woerner, S. (2024) · Nature Computational Science · doi:10.1038/s43588-024-00709-1 · Cited by 25
Self-citation
Metadata
- Authors
- Di Meglio, A., Jansen, K., Tavernelli, I., Alexandrou, C., Arunachalam, S., Bauer, C. W., Borras, K., Carrazza, S., Crippa, A., Croft, V., de Putter, R., Delgado, A., Dunjko, V., Egger, D. J., Fernández-Combarro, E., Fuchs, E., Funcke, L., González-Cuadra, D., Grossi, M., Halimeh, J. C., Holmes, Z., Kühn, S., Lacroix, D., Lewis, R., Lucchesi, D., Martinez, M. L., Meloni, F., Mezzacapo, A., Montangero, S., Nagano, L., Pascuzzi, V. R., Radescu, V., Ortega, E. R., Roggero, A., Schuhmacher, J., Seixas, J., Silvi, P., Spentzouris, P., Tacchino, F., Temme, K., Terashi, K., Tura, J., Tüysüz, C., Vallecorsa, S., Wiese, U.-J., Yoo, S., & Zhang, J.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2024-08-05
- Volume
- 5
- Issue
- 3
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W4401331420
- Cited by
- 215
- References
- 72
- FWCI
- 31.70
- Type
- journal article
- Language
- en
- Open access
- gold
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.
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum Computing for High-Energy Physics: State of the Art and Challenges. https://app.cochat.ai/papers/10.1103/prxquantum.5.037001
- The paper
- Di Meglio, A., Jansen, K., Tavernelli, I., Alexandrou, C., Arunachalam, S., Bauer, C. W., Borras, K., Carrazza, S., Crippa, A., Croft, V., de Putter, R., Delgado, A., Dunjko, V., Egger, D. J., Fernández-Combarro, E., Fuchs, E., Funcke, L., González-Cuadra, D., Grossi, M., . . . Zhang, J. (2024). Quantum Computing for High-Energy Physics: State of the Art and Challenges. PRX Quantum. https://doi.org/10.1103/prxquantum.5.037001
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.