Work

Quantum querying based on multicontrolled Toffoli gates for causal Feynman loop configurations and directed acyclic graphs

Year: 2026

Type: article

Abstract: 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 analyze the impact of traspilation and introduce an appropriate metric to assess the complexity of the algorithm, the quantum circuit area. We explicitly analyze three-, four- and five-eloop topologies, which have not previously been explored due to their higher complexity and the current limitations of quantum simulators.

Source: Physical review. D/Physical review. D.

DOI: 10.1103/b6jg-p8mr

Authors: Selomit Ramírez-Uribe, Andrés E. Rentería-Olivo, Germán Rodrigo

Institutions: Consejo Superior de Investigaciones Científicas, Universitat de València, Universidad Autónoma de Sinaloa, Instituto de Física Corpuscular

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid