Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on High Energy Physics (ICHEP)

Grover's quantum search algorithm of causal multiloop Feynman integrals.

Andrés E. Rentería-Olivo

Published Nov 22, 2022• 0 citations
Publisher

Abstract

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.

DOI
10.22323/1.414.1205

Related papers

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

Quantum algorithm for Feynman loop integrals

Selomit Ramírez-Uribe, Andrés E. Rentería-Olivo, Germán Rodrigo A +2 more

Abstract 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.

arXiv:2105.08703•Journal of High Energy Physics•May 16, 2022•29 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.

arXiv:2211.05487•Nov 10, 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

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

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
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.
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.
Abstract 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.
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.
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.
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.