A concise literature overview of quantum algorithms for QCD and collider tasks, stressing possible advantages over classical methods and NISQ hardware limits.
Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Quantum algorithms provide a promising framework in high-energy physics, in particular, for unraveling the causal configurations of multiloop Feynman diagrams by identifying Feynman propagators with qubits, a challenge analogous to querying directed acyclic graphs in graph theory. In this paper, we present the Minimum Clique-optimised quantum Algorithm (MCA), an automated quantum algorithm designed to efficiently query the causal structures within the Loop-Tree Duality. The MCA quantum algorithm is optimised by exploiting graph theory techniques, specifically, by analogy with the Minimum Clique Partition problem. The evaluation of the MCA quantum algorithm is exhibited by analysing the transpiled quantum circuit depth and quantum circuit area.
fields
hep-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Overview of Applications of Quantum Computing in QCD
A concise literature overview of quantum algorithms for QCD and collider tasks, stressing possible advantages over classical methods and NISQ hardware limits.