Andrés Ernesto Rentería-Olivo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Andrés Ernesto Rentería-Olivo has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Germán Rodrigo
Instituto de Fisica Corpuscular
8 shared publications - Selomit Ramírez-Uribe
Universidad Autónoma de Sinaloa
8 shared publications - German Fabricio Roberto Sborlini
Universidad de Salamanca
7 shared publications - Luiz Vale Silva
Departamento de Matemáticas, Física y Ciencias Tecnológicas, Universidad Cardenal Herrera-CEU, CEU Universities
4 shared publications - Roger Jose Hernandez-Pinto
Universidad Autónoma de Sinaloa
3 shared publications - William Javier Torres Bobadilla
University of Liverpool
3 shared publications
Latest Publications
- Open Access
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review D
- Vol. 114 (7)
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 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.
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review D
- Vol. 114 (7)
Open AccessQuantum 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 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.
- Open Access
- 21 January 2025
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2025 (1) , 1-24
Vacuum amplitudes and time-like causal unitary in the loop-tree duality
A bstract: We present the first proof-of-concept application to decay processes at higher perturbative orders of loop-tree duality (LTD) causal unitary, a novel methodology that exploits the causal properties of vacuum amplitudes in the 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.
- 21 January 2025
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2025 (1) , 1-24
Open AccessVacuum amplitudes and time-like causal unitary in the loop-tree duality
A bstract: We present the first proof-of-concept application to decay processes at higher perturbative orders of loop-tree duality (LTD) causal unitary, a novel methodology that exploits the causal properties of vacuum amplitudes in the 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.
- Open Access
- 29 November 2023
- Published by American Physical Society (APS) in Physical Review D
- Vol. 108 (9) , 096035
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 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.
- 29 November 2023
- Published by American Physical Society (APS) in Physical Review D
- Vol. 108 (9) , 096035
Open AccessVariational 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 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.
- Open Access
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.
Open AccessVariational 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.
- Open Access
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.
Open AccessGrover'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.
- Open Access
- 22 November 2022
- Published by Sissa Medialab Srl
- Vol. 414, 1205
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. Causality obtained through 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 for querying multiple solutions over the unstructured set of solutions generated after the application of the LTD. The quantum algorithm is successfully implemented on IBM Quantum and QUTE simulators.
- 22 November 2022
- Published by Sissa Medialab Srl
- Vol. 414, 1205
Open AccessGrover'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. Causality obtained through 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 for querying multiple solutions over the unstructured set of solutions generated after the application of the LTD. The quantum algorithm is successfully implemented on IBM Quantum and QUTE simulators.
- Open Access
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.
Open AccessQuantum 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.
- Open Access
- 16 May 2022
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2022 (5) , 1-32
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 IBM Quantum and 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.
- 16 May 2022
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2022 (5) , 1-32
Open AccessQuantum 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 IBM Quantum and 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.
- Open Access
A Stroll through the Loop-Tree Duality
The Loop-Tree Duality (LTD) theorem is an innovative technique to deal with multi-loop scattering amplitudes, leading to integrand-level representations over a Euclidean space. In this article, we review the last developments concerning this framework, focusing on the manifestly causal representation of multi-loop Feynman integrals and scattering amplitudes, and the definition of dual local counter-terms to cancel infrared singularities.
Open AccessA Stroll through the Loop-Tree Duality
The Loop-Tree Duality (LTD) theorem is an innovative technique to deal with multi-loop scattering amplitudes, leading to integrand-level representations over a Euclidean space. In this article, we review the last developments concerning this framework, focusing on the manifestly causal representation of multi-loop Feynman integrals and scattering amplitudes, and the definition of dual local counter-terms to cancel infrared singularities.
- Open Access
- 28 May 2020
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 124 (21) , 211602
Open Loop Amplitudes and Causality to All Orders and Powers from the Loop-Tree Duality
Multiloop scattering amplitudes describing the quantum fluctuations at high-energy scattering processes are the main bottleneck in perturbative quantum field theory. The loop-tree duality is a novel method aimed at overcoming this bottleneck by opening the loop amplitudes into trees and combining them at integrand level with the real-emission matrix elements. In this Letter, we generalize the loop-tree duality to all orders in the perturbative expansion by using the complex Lorentz-covariant prescription of the original one-loop formulation. We introduce a series of mutiloop topologies with arbitrary internal configurations and derive very compact and factorizable expressions of their open-to-trees representation in the loop-tree duality formalism. Furthermore, these expressions are entirely independent at integrand level of the initial assignments of momentum flows in the Feynman representation and remarkably free of noncausal singularities. These properties, that we conjecture to hold to other topologies at all orders, provide integrand representations of scattering amplitudes that exhibit manifest causal singular structures and better numerical stability than in other representations.
- 28 May 2020
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 124 (21) , 211602
Open AccessOpen Loop Amplitudes and Causality to All Orders and Powers from the Loop-Tree Duality
Multiloop scattering amplitudes describing the quantum fluctuations at high-energy scattering processes are the main bottleneck in perturbative quantum field theory. The loop-tree duality is a novel method aimed at overcoming this bottleneck by opening the loop amplitudes into trees and combining them at integrand level with the real-emission matrix elements. In this Letter, we generalize the loop-tree duality to all orders in the perturbative expansion by using the complex Lorentz-covariant prescription of the original one-loop formulation. We introduce a series of mutiloop topologies with arbitrary internal configurations and derive very compact and factorizable expressions of their open-to-trees representation in the loop-tree duality formalism. Furthermore, these expressions are entirely independent at integrand level of the initial assignments of momentum flows in the Feynman representation and remarkably free of noncausal singularities. These properties, that we conjecture to hold to other topologies at all orders, provide integrand representations of scattering amplitudes that exhibit manifest causal singular structures and better numerical stability than in other representations.