arXiv subjects

Andrés E. Rentería-Olivo

Publications and source records attributed to Andrés E. Rentería-Olivo.

6 recordsLinked to original sources

arXiv2025

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

Quantum algorithms are a promising framework for unfolding the causal configurations of multiloop Feynman diagrams, which is equivalent to querying the \textit{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 \emph{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.

quant-ph↗

arXiv2024

Vacuum amplitudes and time-like causal unitary in the loop-tree duality

We present the first proof-of-concept application to decay processes at higher perturbative orders of LTD causal unitary, a novel methodology that exploits the causal properties of vacuum amplitudes in the loop-tree duality (LTD) and is directly well-defined in the four physical dimensions of the space-time. The generation of loop- and tree-level contributions to the differential decay rates from a kernel multiloop vacuum amplitude is shown in detail, and explicit expressions are presented for selected processes that are suitable for a lightweight understanding of the method. Specifically, we provide a clear physical interpretation of the local cancellation of soft, collinear and threshold singularities, and of the local renormalisation of ultraviolet singularities. The presentation is illustrated with numerical results that showcase the advantages of the method.

hep-ph↗

arXiv2023

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

We present a variational quantum eigensolver (VQE) algorithm for the efficient bootstrapping of the causal representation of multiloop Feynman diagrams in the Loop-Tree Duality (LTD) or, equivalently, the selection of acyclic configurations in directed graphs. A loop Hamiltonian based on the adjacency matrix describing a multiloop topology, and whose different energy levels correspond to the number of cycles, is minimized by VQE to identify the causal or acyclic configurations. The algorithm has been adapted to select multiple degenerated minima and thus achieves higher detection rates. A performance comparison with a Grover's based algorithm is discussed in detail. The VQE approach requires, in general, fewer qubits and shorter circuits for its implementation, albeit with lesser success rates.

hep-ph↗

arXiv2022

Grover's Quantum Search Algorithm of Causal Multiloop Feynman Integrals

A proof-of-concept application of a quantum algorithm to multiloop Feynman integrals in the Loop-Tree Duality (LTD) framework is applied to a representative four-loop topology. Bootstrapping causality in the LTD formalism, is a suitable problem to address with quantum computers given the straightforward possibility to encode the two on-shell states of a propagator on the two states of a qubit. A modification of Grover's quantum search algorithm is developed and the quantum algorithm is successfully implemented on IBM Quantum and QUTE simulators.

quant-ph↗

arXiv2022

Quantum algorithm for Feynman loop integrals

We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal singular configurations of multiloop Feynman diagrams. To identify such configurations, we exploit Grover's algorithm for querying multiple solutions over unstructured datasets, which presents a quadratic speed-up over classical algorithms when the number of solutions is much smaller than the number of possible configurations. A suitable modification is introduced to deal with topologies in which the number of causal states to be identified is nearly half of the total number of states. The output of the quantum algorithm in \emph{IBM Quantum} and \emph{QUTE Testbed} simulators is used to bootstrap the causal representation in the loop-tree duality of representative multiloop topologies. The algorithm may also find application and interest in graph theory to solve problems involving directed acyclic graphs.

hep-ph↗

arXiv2021

Four-loop scattering amplitudes journey into the forest

We present an overview of the analysis of the multiloop topologies that appear for the first time at four loops and the assembly of them in a general expression, the N$^4$MLT universal topology. Based on the fact that the Loop-Tree Duality enables to open any scattering amplitude in terms of convolutions of known subtopologies, we go through the dual representation of the universal N$^4$MLT topology and the manifestly causal representation. Additionally, we expose the application of a quantum algorithm as an alternative methodology to identify the causal singular configurations of multiloop Feynman diagrams.

hep-ph↗