Related papers: From Feynman integrals to quantum algorithms: the …
A perturbative approach to quantum field theory involves the computation of loop integrals, as soon as one goes beyond the leading term in the perturbative expansion. First I review standard techniques for the computation of loop integrals.…
Multi-loop Feynman integrals are key objects for the high-order correction computations in high energy phenomenology. These integrals with multiple scales, may have complicated symbol structures. We show that the dual conformal symmetry…
In the present review we provide an extensive analysis of the intertwinement between Feynman integrals and cohomology theories in the light of the recent developments. Feynman integrals enter in several perturbative methods for solving non…
We present recent developments on the topic of the integrand reduction of scattering amplitudes. Integrand-level methods allow to express an amplitude as a linear combination of Master Integrals, by performing operations on the…
A primary objective of quantum computation is to efficiently simulate quantum physics. Scientifically and technologically important quantum Hamiltonians include those with spin-$s$, vibrational, photonic, and other bosonic degrees of…
Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
Randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings. While the algorithmic complexities of…
In this thesis, we study the three-loop QCD form factors. After an introduction and a discussion of the physics motivation, we generate the quark form factor using Qgraf. We then show how to bring the Feynman integrals into a unique form by…
Canonical Feynman integrals are of great interest in the study of scattering amplitudes at the multi-loop level. We propose to construct $d\log$-form integrals of the hypergeometric type, treat them as a representation of Feynman integrals,…
We consider Feynman integrals with algebraic leading singularities and total differentials in $\epsilon\,\mathrm{d}\ln$ form. We show for the first time that it is possible to evaluate integrals with singularities involving unrationalizable…
We introduce a new framework for perturbatively computing equilibrium thermodynamic properties of cosmological phase transitions to high loop orders, using the full four-dimensional resummed thermal effective potential and avoiding the…
Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as finance, engineering, logistics, and operations research. It…
We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solutions which are significantly worse than random. This enables…
In modern quantum field theory, one of the most important tasks is the calculation of loop integrals. Loop integrals appear when evaluating the Feynman diagrams with one or more loops by integrating over the internal momenta. Even though…
The so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm. Given the name of a special ENTRANCE vertex, a quantum walk can find…
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present here a near-optimal, robust, and end-to-end quantum…
We present a new algorithm to construct a purely four dimensional representation of higher-order perturbative corrections to physical cross-sections at next-to-leading order (NLO). The algorithm is based on the loop-tree duality (LTD), and…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…