Tootfinder

Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations
Salvador A. Ochoa-Oregon, Juan P. Uribe-Ram\'irez, Roger J. Hern\'andez-Pinto, Selomit Ram\'irez-Uribe, Germ\'an Rodrigo
https://arxiv.org/abs/2508.04019

Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations
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 algorith…