Related papers: Grover's Quantum Search Algorithm of Causal Multil…
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…
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…
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…
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…
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…
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…
A general outlook is presented on the study of multiloop topologies appearing for the first time at four loops. A unified description and representation of this family is provided, the so-called N$^4$MLT universal topology. Based on the…
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…
This paper describes a quantum algorithm for proof search in sequent calculus of a subset of Linear Logic using the Grover Search Algorithm. We briefly overview the Grover Search Algorithm and Linear Logic, show the detailed steps of the…
Multi-loop scattering amplitudes constitute a serious bottleneck in current high-energy physics computations. Obtaining new integrand level representations with smooth behaviour is crucial for solving this issue, and surpassing the…
In this review, we discuss recent developments concerning efficient calculations of multi-loop multi-leg scattering amplitudes. Inspired by the remarkable properties of the Loop-Tree Duality (LTD), we explain how to reconstruct an integrand…
The loop-tree duality (LTD) has become a novelty alternative to bootstrap the numerical evaluation of multi-loop scattering amplitudes. It has indeed been found that Feynman integrands, after the application of LTD, display a representation…
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…
The Loop-Tree Duality (LTD) is a novel perturbative method in QFT that establishes a relation between loop-level and tree-level scattering amplitudes. This is achieved by directly applying the Residue Theorem to the loop-energy-integration.…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover's algorithm, has aroused a…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…