2024/04/04 by Selomit Ramírez-Uribe, Ramírez-Uribe, Selomit, Andrés E. Rentería-Olivo +3 · 3 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #High Energy Physics - Phenomenology (hep-ph) #High Energy Physics - Theory (hep-th) #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2404.03544
openalex publication_date 2024/04/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Quantum algorithms are a promising framework for unfolding the causal configurations of multiloop Feynman diagrams, which is equivalent to querying the directed acyclic graph (DAG) configurations of undirected graphs in graph theory. In this paper, we present a quantum algorithm for querying in both types of applications, using a systematic and sparing logic in the design of an oracle operator. The construction of the quantum oracle is based exclusively on multicontrolled Toffoli (MCX) gates and quantum NOT (Pauli-X) gates. The efficiency of the algorithm is evaluated by comparison with a quantum algorithm based on binary clauses. Furthermore, we analyse the impact of traspilation and introduce an appropriate metric to assess the complexity of the algorithm, the quantum circuit area. We explicitly analyse three-, four- and five-eloop topologies, which have not previously been explored due to their higher complexity and the current limitations of quantum simulators.