Pith. sign in

REVIEW 5 minor 46 references

Quantum computing matches the quantum nature of colliders and could become a full event generator at high perturbative orders once hardware scales.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

T0 review · grok-4.5

2026-07-10 11:57 UTC pith:ZXN3GKON

load-bearing objection A short, honest literature map of QC-for-QCD with no new results; useful orientation, not a research advance.

arxiv 2607.08169 v1 pith:ZXN3GKON submitted 2026-07-09 hep-ph hep-exhep-thquant-ph

Overview of Applications of Quantum Computing in QCD

classification hep-ph hep-exhep-thquant-ph
keywords quantum computingQCDcollider physicsevent generationparton showersscattering amplitudesNISQquantum machine learning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

High-luminosity collider runs will leave theory as the bottleneck: experimental uncertainties on key Higgs couplings are projected near 1.5 percent while theoretical QCD uncertainties still sit at a few percent. Because particle interactions are quantum, classical simulation of event generation, parton showers, amplitudes, and multi-dimensional integrals carries intrinsic inefficiencies. This overview surveys the growing set of quantum algorithms that attack those bottlenecks, stressing that any real advantage must use superposition, entanglement, and interference together. Near-term devices remain noisy, so present work is limited to hybrid methods and small benchmarks; the long-term objective is a fully quantum event generator that reaches high perturbative orders once error-corrected logical qubits become available.

Core claim

Collider physics is a natural domain for quantum computing because the LHC and future machines are themselves quantum systems. Quantum algorithms can therefore target the computational bottlenecks of event generation, parton showers, scattering amplitudes, loop and phase-space integration, and experimental optimization, potentially overcoming the classical scaling that currently limits precision QCD predictions.

What carries the argument

The integrated use of the three quantum principles (superposition, entanglement, and interference) inside hybrid quantum-classical algorithms for collider subproblems; without all three, no genuine computational advantage over classical methods is expected.

Load-bearing premise

That the quantum character of field-theory processes will convert into a practical speed-up or accuracy gain for the listed collider tasks once roughly fifty to one hundred logical qubits exist, rather than being erased by encoding cost, noise, or the efficiency of classical Monte Carlo.

What would settle it

A controlled head-to-head comparison, on the same multi-loop or multi-leg QCD integral or parton-shower ensemble, showing that a fault-tolerant quantum circuit with O(50-100) logical qubits fails to reduce wall-clock cost or variance below the best classical Monte-Carlo or neural-network baseline by a clear factor.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • A quantum event generator that reaches high perturbative orders could close the precision gap between HL-LHC measurements and theory for Higgs and other couplings.
  • Near-term hybrid quantum-classical methods can already test whether interference and entanglement improve specific sampling or jet-clustering subroutines.
  • Quantum-inspired classical algorithms may appear as by-products even before fault-tolerant hardware arrives.
  • Optimization and anomaly-detection tasks in experimental analysis become natural targets for quantum annealers and variational circuits.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If quantum sampling of multi-loop vacuum diagrams succeeds, it may re-open families of integrals that classical Monte Carlo currently abandons as too expensive.
  • Encoding of colour and spin degrees of freedom is likely to dominate qubit overhead; progress on that encoding will set the real timeline more than raw qubit count.
  • The same variational quantum circuits used for jet physics could transfer to medium-modified jets in heavy-ion collisions with only modest re-training.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. This manuscript is a concise overview of quantum-computing applications in collider physics and QCD. It frames the HL-LHC precision gap as a computational bottleneck, argues that high-energy colliders are intrinsically quantum systems, distinguishes the NISQ era from the anticipated fault-tolerant regime, and surveys recent quantum algorithms for parton densities, parton showers, helicity amplitudes, colour algebra, multiloop causal configurations, numerical integration, loops and decay rates, jet physics, track reconstruction, anomaly detection, and related tasks. The central claim is that quantum approaches may offer advantages for subproblems whose complexity grows rapidly or where correlations are central, while classical methods remain more effective in practice today; a fully-fledged quantum event generator at high perturbative orders is presented as an appealing long-term objective once hardware capacity improves.

Significance. As a short, up-to-date literature survey the paper is useful for the hep-ph community. It correctly maps a rapidly expanding set of proposals (refs. 6–48) onto the standard collider-physics workflow, explicitly hedges claims of advantage against NISQ limitations, and articulates a coherent long-term vision (quantum event generation) without overstating present-day performance. The distinction between quantum utility, quantum-inspired classical methods, and genuine quantum advantage is pedagogically valuable. No new algorithms, scaling theorems, or quantitative benchmarks are claimed, so the contribution is organizational and expository rather than technical; within that scope it is timely and well-referenced.

minor comments (5)
  1. Section 1: the sentence on Run 3 concluding on 29 June 2026 appears to project a future date; if the manuscript is intended for publication before that date the wording should be adjusted for tense consistency.
  2. Section 2: the claim that CERN is “the place where the Bell inequalities were born” is historically imprecise (Bell’s paper was written while he was at CERN, but the inequalities themselves predate that affiliation); a brief clarification or softer phrasing would avoid pedantic objections.
  3. Section 4: the long list of applications would benefit from a short table or bullet grouping (e.g., “perturbative amplitudes / showers / reconstruction / ML”) so that readers can more quickly locate the references of interest.
  4. Throughout: a few typographical inconsistencies remain (e.g., “F rontier”, “F ault-T olerant”, “untractable”); a light copy-edit pass would improve polish.
  5. References: several arXiv identifiers appear without final journal citations even when the papers have already been published; updating those entries would increase archival value.

Circularity Check

0 steps flagged

No significant circularity: literature overview with no derivation chain that reduces predictions to inputs by construction.

full rationale

This manuscript is a concise survey of quantum-computing applications in collider physics and QCD. It does not claim a first-principles derivation, a uniqueness theorem, a fitted scaling law, or a quantitative performance prediction that is then re-presented as independent output. The central statements (QC is a promising framework for event generation, parton showers, amplitudes, integration and optimization; a fully-fledged quantum event generator is an appealing long-term goal once hardware improves) are explicitly hedged by NISQ limitations and by the observation that classical methods remain more effective in practice. Author self-citations appear among the surveyed references, but they function as ordinary literature pointers rather than load-bearing premises that close a logical loop. There are no equations that redefine a fitted parameter as a prediction, no uniqueness result imported solely from the same authors to forbid alternatives, and no renaming of a known empirical pattern presented as a new unification. Consequently the derivation chain is empty of circular steps; the paper is self-contained as an overview against the external literature it cites.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

As a review the manuscript inherits standard domain premises of quantum computing and collider phenomenology; it introduces no fitted free parameters and no new physical entities. Load-bearing background assumptions are the usual NISQ/FTQC hardware roadmap and the claim that QM principles can yield asymptotic advantage for certain HEP subproblems.

axioms (3)
  • domain assumption Nature is quantum and therefore quantum simulation can in principle be more faithful/efficient than classical simulation for QFT processes (Feynman’s argument).
    Invoked in §2 to motivate QC for collider physics; standard but not rigorously proven for the concrete HEP workloads listed.
  • domain assumption NISQ devices remain noisy with short coherence times; fault-tolerant logical qubits at useful scale are still years away.
    Stated in §3; underpins the paper’s caution that current work is limited to benchmarks and hybrid methods.
  • domain assumption Quantum algorithms must exploit superposition, entanglement and interference together to obtain advantage over classical methods.
    Emphasized in §2; used to filter which HEP applications are considered promising.

pith-pipeline@v1.1.0-grok45 · 10271 in / 1935 out tokens · 22953 ms · 2026-07-10T11:57:35.634339+00:00 · methodology

0 comments
read the original abstract

Quantum computing has emerged as a promising framework for addressing computationally demanding problems in collider physics. In recent years, a growing number of quantum algorithms have been proposed for applications ranging from event generation and parton shower simulation to the evaluation of scattering amplitudes, loop and phase-space integration, and optimization problems relevant to experimental analysis. We provide a concise overview of the main ideas behind these developments, with emphasis on the potential advantages of quantum approaches in comparison with classical methods, as well as on the current limitations imposed by noisy intermediate-scale quantum hardware.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

46 extracted references · 46 canonical work pages · 39 internal anchors

  1. [1]

    Higgs Physics at the HL-LHC and HE-LHC

    M. Cepeda et al.,CERN Yellow Rep. Monogr.7(2019) 221–584, [1902.00134]

  2. [2]

    R. P. Feynman,Int. J. Theor. Phys.21(1982) 467–488. 3.FCCcollaboration, M. Benedikt et al.,Eur. Phys. J. C85(2025) 1468, [2505.00272]

  3. [3]

    J. S. Bell,Physics Physique Fizika1(1964) 195–200

  4. [4]

    Quantum Computing in the NISQ era and beyond

    J. Preskill,Quantum2(2018) 79, [1801.00862]

  5. [5]

    Determining the proton content with a quantum computer

    A. P´ erez-Salinas, J. Cruz-Mart´ ınez, A. A. Alhajri and S. Carrazza,Phys. Rev. D103 (2021) 034027, [2011.13934]

  6. [6]

    Z.-B. Kang, N. Moran, P. Nguyen and W. Qian,JHEP09(2025) 176, [2501.09738]

  7. [7]

    C. W. Bauer, W. A. de Jong, B. Nachman and D. Provasoli,Phys. Rev. Lett.126 (2021) 062001, [1904.03196]

  8. [8]

    Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers

    K. Bepari, S. Malik, M. Spannowsky and S. Williams,Phys. Rev. D103(2021) 076020, [2010.00046]

  9. [9]

    Quantum walk approach to simulating parton showers

    K. Bepari, S. Malik, M. Spannowsky and S. Williams,Phys. Rev. D106(2022) 056002, [2109.13975]

  10. [10]

    Physics inspired quantum algorithm for QCD splitting functions

    G. Rouxinol, Y. Haddad, C. T¨ uys¨ uz, S. Vallecorsa and M. Grossi,2605.06789

  11. [11]

    J. J. Mart´ ınez de Lejarza, H.-Y. Wu, O. Kyriienko, G. Rodrigo and M. Grossi,Commun. Phys.8(2025) 448, [2503.16073]

  12. [12]

    A quantum algorithm for the n-gluon MHV scattering amplitude

    E. Bashore, S. Moretti and T. Vitos,SciPost Phys.20(2026) 114, [2507.14252]

  13. [13]

    Haddad, K

    Y. Haddad, K. Xu, V. Croft, J. C. Halimeh and M. Grossi,2602.21311

  14. [14]

    H. A. Chawdhry and M. Pellen,SciPost Phys.15(2023) 205, [2303.04818]

  15. [15]

    H. A. Chawdhry, M. Pellen and S. Williams,2507.07194

  16. [16]

    Quantum algorithm for Feynman loop integrals

    S. Ram´ ırez-Uribe, A. E. Renter´ ıa-Olivo, G. Rodrigo, G. F. R. Sborlini and L. Vale Silva, JHEP05(2022) 100, [2105.08703]

  17. [17]

    Variational quantum eigensolver for causal loop Feynman diagrams and directed acyclic graphs

    G. Clementeet al.,Phys. Rev. D108(2023) 096035, [2210.13240]

  18. [18]
  19. [19]

    S. A. Ochoa-Oregon, J. P. Uribe-Ram´ ırez, R. J. Hern´ andez-Pinto, S. Ram´ ırez-Uribe and G. Rodrigo,Commun. Phys.(2026) , [2508.04019]

  20. [20]
  21. [21]

    Quantum integration of elementary particle processes

    G. Agliardi, M. Grossi, M. Pellen and E. Prati,Phys. Lett. B832(2022) 137228, [2201.01547]

  22. [22]

    J. M. Cruz-Mart´ ınez, M. Robbiati and S. Carrazza,Quantum Sci. Technol.9(2024) 035053, [2308.05657]

  23. [23]

    J. J. Mart´ ınez de Lejarza, M. Grossi, L. Cieri and G. Rodrigo,2305.01686. DOI

  24. [24]

    Unlocking Multidimensional Integration with Quantum Adaptive Importance Sampling

    K. Pyretzidis, J. J. Mart´ ınez de Lejarza and G. Rodrigo,Commun. Phys.(2026) , [2506.19965]

  25. [25]

    A general approach to quantum integration of cross sections in high-energy physics

    I. Williams and M. Pellen,Quantum Sci. Technol.10(2025) 045017, [2502.14647]

  26. [26]

    J. J. Mart´ ınez de Lejarza, L. Cieri, M. Grossi, S. Vallecorsa and G. Rodrigo,Phys. Rev. D110(2024) 074031, [2401.03023]

  27. [27]

    Rewording Theoretical Predictions at Colliders with Vacuum Amplitudes

    S. Ram´ ırez-Uribe, P. K. Dhani, G. F. R. Sborlini and G. Rodrigo,Phys. Rev. Lett. 133(2024) 211901, [2404.05491]. 29.LTDcollaboration, S. Ram´ ırez-Uribeet al.,JHEP01(2025) 103, [2404.05492]

  28. [28]

    J. J. Mart´ ınez de Lejarza, D. F. Renter´ ıa-Estrada, M. Grossi and G. Rodrigo,Quantum Sci. Technol.10(2025) 025026, [2409.12236]

  29. [29]

    A. Y. Wei, P. Naik, A. W. Harrow and J. Thaler,Phys. Rev. D101(2020) 094015, [1908.08949]

  30. [30]

    Adiabatic Quantum Algorithm for Multijet Clustering in High Energy Physics

    D. Pires, Y. Omar and J. Seixas,Phys. Lett. B843(2023) 138000, [2012.14514]

  31. [31]

    Quantum-inspired Machine Learning on high-energy physics data

    T. Felser et al.,npj Quantum Inf.7(2021) 111, [2004.13747]

  32. [32]

    J. J. Mart´ ınez de Lejarza, L. Cieri and G. Rodrigo,Phys. Rev. D106(2022) 036021, [2204.06496]

  33. [33]

    Quantum Annealing for Jet Clustering with Thrust

    A. Delgado and J. Thaler,Phys. Rev. D106(2022) 094016, [2205.02814]

  34. [34]

    Quantum-annealing-inspired algorithms for multijet clustering

    H. Okawa, X.-Z. Tao, Q.-G. Zeng and M.-H. Yung,Phys. Lett. B864(2025) 139393, [2410.14233]

  35. [35]

    A quantum strategy to compute the jet quenching parameter $\hat{q}$

    J. Barata and C. A. Salgado,Eur. Phys. J. C81(2021) 862, [2104.04661]

  36. [36]

    Quantum simulation of in-medium QCD jets: momentum broadening, gluon production, and entropy growth

    J. Barata, X. Du, M. Li, W. Qian and C. A. Salgado,Phys. Rev. D108(2023) 056023, [2307.01792]

  37. [37]
  38. [38]

    Quantum speedup for track reconstruction in particle accelerators

    D. Magano et al.,Phys. Rev. D105(2022) 076012, [2104.11583]

  39. [39]

    Reconstructing charged particle track segments with a quantum-enhanced support vector machine

    P. Duckett, G. Facini, M. Jastrzebski, S. Malik, T. Scanlon and S. Rettie,Phys. Rev. D109(2024) 052002, [2212.07279]

  40. [40]

    Nicotra et al.,JINST18(2023) P11028, [2308.00619]

    D. Nicotra et al.,JINST18(2023) P11028, [2308.00619]

  41. [41]

    Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders

    H. Okawa, Q.-G. Zeng, X.-Z. Tao and M.-H. Yung,Comput. Softw. Big Sci.8(2024) 16, [2402.14718]

  42. [42]

    Chiotopoulos et al.,2601.07766

    X. Chiotopoulos et al.,2601.07766

  43. [43]

    V. S. Ngairangbam, M. Spannowsky and M. Takeuchi,Phys. Rev. D105(2022) 095004, [2112.04958]

  44. [44]

    Quantum anomaly detection in the latent space of proton collision events at the LHC

    V. Belis et al.,Commun. Phys.7(2024) 334, [2301.10780]

  45. [45]

    Unravelling physics beyond the standard model with classical and quantum anomaly detection

    J. Schuhmacher et al.,Mach. Learn. Sci. Tech.4(2023) 045031, [2301.10787]

  46. [46]

    M. C. Lai˜ no, V. Chobanova and M. Lucio Mart´ ınez,2510.14001