© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2309.12739 · European Physical Society Conference on High Energy Physics (EPS-HEP)

Tackling Feynman integrals with quantum minimization algorithms

Germán F. R. Sborlini

Published Jan 31, 2024• 0 citations

Abstract

One of the most severe bottlenecks to reach high-precision predictions in QFT is the calculation of multiloop multileg Feynman integrals. Several new strategies have been proposed in the last years, allowing impressive results with deep implications in particle physics. Still, the efficiency of such techniques starts to drastically decrease when including many loops and legs. In this talk, we explore the implementation of quantum algorithms to optimize the integrands of scattering amplitudes. We rely on the manifestly causal loop-tree duality, which translates the loop into phase-space integrals and avoids the spurious singularities due to non-causal effects. Then, we built a Hamiltonian codifying causal-compatible contributions and minimize it using a Variational Quantum Eigensolver. Our very promising results point towards a potential speed-up for achieving a more numerically-stable representation of Feynman integrals by using quantum computers.

DOI: 10.22323/1.449.0501

Related papers

From Feynman integrals to quantum algorithms: the Loop-Tree Duality connection

Germán F. R. Sborlini

In the context of high-energy particle physics, a reliable theory-experiment confrontation requires precise theoretical predictions. This translates into accessing higher-perturbative orders, and when we pursue this objective, we inevitably face the presence of complicated multi-loop Feynman integrals. There are serious bottlenecks to compute them with classical tools: the time to explore novel technologies has arrived. In this work, we study the implementation of quantum algorithms to optimize the integrands of scattering amplitudes. Our approach relies on the manifestly causal Loop-Tree Duality (LTD), which re-casts the loop integrand into phase-space integrals and avoids spurious non-physical singularities. Then, we codify this information in such a way that a quantum computer can understand the problem, and build Hamiltonians whose ground state are directly related to the causal representation. Promising results for generic families of multi-loop topologies are presented.

arXiv:2409.07252•International Conference on High Energy Physics (ICHEP)•Dec 17, 2024•1 citation

Geometrical causality: casting Feynman integrals into quantum algorithms

Germán F. R. Sborlini

The calculation of higher-order corrections in Quantum Field Theories is a challenging task. In particular, dealing with multiloop and multileg Feynman amplitudes leads to severe bottlenecks and a very fast scaling of the computational resources required to perform the calculation. With the purpose of overcoming these limitations, we discuss efficient strategies based on the Loop-Tree Duality, its manifestly causal representation and the underlying geometrical interpretation. In concrete, we exploit the geometrical causal selection rules to define a Hamiltonian whose ground-state is directly related to the terms contributing to the causal representation. In this way, the problem can be translated into a minimization one and implemented in a quantum computer to search for a potential speed-up.

arXiv:2305.08550•Suplemento de la Revista Mexicana de Física•Sep 18, 2023•1 citation

From Causal Representation of Multiloop Scattering Amplitudes to Quantum Computing

Selomit Ramírez-Uribe

An overview of a quantum algorithm application for the identification of causal singular configurations of multiloop Feynman diagrams is presented. The quantum algorithm is implemented in two different quantum simulators, the output obtained is directly translated to causal thresholds needed for the causal representation in the loop-tree duality.

arXiv:2201.04381•Jan 12, 2022•0 citations

Quantum algorithm for querying causality of multiloop scattering amplitudes

Selomit Ramírez-Uribe

The first application of a quantum algorithm to Feynman loop integrals is reviewed. The connection between quantum computing and perturbative quantum field theory is feasible due to fact that the two on-shell states of a Feynman propagator are naturally encoded in a qubit. The particular problem to be addressed is the identification of the causal singular configurations of multiloop Feynman diagrams. The identification of such configurations is carried out through the implementation of a modified Grover's quantum algorithm for querying multiple solutions over unstructured datasets.

International Conference on High Energy Physics (ICHEP)•Nov 7, 2022•0 citations

Grover's Quantum Search Algorithm of Causal Multiloop Feynman Integrals

Andrés E. Rentería-Olivo

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.

arXiv:2211.14359•Nov 25, 2022•0 citations

Understanding IR singularities in the Loop-Tree Duality

Germán Rodrigo, Leandro Cieri, Prasanna K. Dhani +11 more

One of the main advantages of the Loop-Tree Duality representation of scattering amplitudes is that it makes the origin of infrared and threshold singularities particularly transparent. This talk reviews recent progress in describing how singularities emerge and cancel at the level of scattering and vacuum amplitudes, discusses a novel strategy to efficiently construct finite integrals, and presents a complementary perspective based on encoding the underlying causal and singular structure in terms of qubits and quantum circuits.

hep-phCross-listedarXiv:2609.00869•Sep 2, 2026

One of the most severe bottlenecks to reach high-precision predictions in QFT is the calculation of multiloop multileg Feynman integrals. Several new strategies have been proposed in the last years, allowing impressive results with deep implications in particle physics. Still, the efficiency of such techniques starts to drastically decrease when including many loops and legs. In this talk, we explore the implementation of quantum algorithms to optimize the integrands of scattering amplitudes. We rely on the manifestly causal loop-tree duality, which translates the loop into phase-space integrals and avoids the spurious singularities due to non-causal effects. Then, we built a Hamiltonian codifying causal-compatible contributions and minimize it using a Variational Quantum Eigensolver. Our very promising results point towards a potential speed-up for achieving a more numerically-stable representation of Feynman integrals by using quantum computers.

In the context of high-energy particle physics, a reliable theory-experiment confrontation requires precise theoretical predictions. This translates into accessing higher-perturbative orders, and when we pursue this objective, we inevitably face the presence of complicated multi-loop Feynman integrals. There are serious bottlenecks to compute them with classical tools: the time to explore novel technologies has arrived. In this work, we study the implementation of quantum algorithms to optimize the integrands of scattering amplitudes. Our approach relies on the manifestly causal Loop-Tree Duality (LTD), which re-casts the loop integrand into phase-space integrals and avoids spurious non-physical singularities. Then, we codify this information in such a way that a quantum computer can understand the problem, and build Hamiltonians whose ground state are directly related to the causal representation. Promising results for generic families of multi-loop topologies are presented.

The calculation of higher-order corrections in Quantum Field Theories is a challenging task. In particular, dealing with multiloop and multileg Feynman amplitudes leads to severe bottlenecks and a very fast scaling of the computational resources required to perform the calculation. With the purpose of overcoming these limitations, we discuss efficient strategies based on the Loop-Tree Duality, its manifestly causal representation and the underlying geometrical interpretation. In concrete, we exploit the geometrical causal selection rules to define a Hamiltonian whose ground-state is directly related to the terms contributing to the causal representation. In this way, the problem can be translated into a minimization one and implemented in a quantum computer to search for a potential speed-up.

The first application of a quantum algorithm to Feynman loop integrals is reviewed. The connection between quantum computing and perturbative quantum field theory is feasible due to fact that the two on-shell states of a Feynman propagator are naturally encoded in a qubit. The particular problem to be addressed is the identification of the causal singular configurations of multiloop Feynman diagrams. The identification of such configurations is carried out through the implementation of a modified Grover's quantum algorithm for querying multiple solutions over unstructured datasets.

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.

One of the main advantages of the Loop-Tree Duality representation of scattering amplitudes is that it makes the origin of infrared and threshold singularities particularly transparent. This talk reviews recent progress in describing how singularities emerge and cancel at the level of scattering and vacuum amplitudes, discusses a novel strategy to efficiently construct finite integrals, and presents a complementary perspective based on encoding the underlying causal and singular structure in terms of qubits and quantum circuits.