Related papers: Tackling Feynman integrals with quantum minimizati…
The numerical unitarity approach has been important for obtaining reliable QCD predictions for the LHC. Here I discuss the extension of the approach beyond the leading quantum corrections for computing multi-loop amplitudes. The numerical…
We discuss briefly the first numerical implementation of the Loop-Tree Duality (LTD) method. We apply the LTD method in order to calculate ultraviolet and infrared finite multi-leg one-loop Feynman integrals. We attack scalar and tensor…
We describe three algorithms for computer-aided symbolic multi-loop calculations that facilitated some recent novel results. First, we discuss an algorithm to derive the canonical form of an arbitrary Feynman integral in order to facilitate…
Providing an optimal path to a quantum annealing algorithm is key to finding good approximate solutions to computationally hard optimization problems. Reinforcement is one of the strategies that can be used to circumvent the exponentially…
Higher orders in perturbation theory require the calculation of Feynman integrals at multiple loops. We report on an approach to systematically solve Feynman integrals by means of symbolic summation and discuss the underlying algorithms.…
We present a new algorithm for integration-by-parts (IBP) reduction of Feynman integrals with high powers of numerators or propagators, a demanding computational step in evaluating multi-loop scattering amplitudes. The algorithm allows us…
Quantum optimization algorithms offer a promising route to finding the ground states of target Hamiltonians on near-term quantum devices. None the less, it remains necessary to limit the evolution time and circuit depth as much as possible,…
Numerical evaluations of Feynman integrals often proceed via a deformation of the integration contour into the complex plane. While valid contours are easy to construct, the numerical precision for a multi-loop integral can depend…
In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework…
This paper discusses the compilation, optimization, and error mitigation of quantum algorithms, essential steps to execute real-world quantum algorithms. Quantum algorithms running on a hybrid platform with QPU and CPU/GPU take advantage of…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the Filtering Variational Quantum…
We derive a duality relation between one-loop integrals and phase-space integrals emerging from them through single cuts. The duality relation is realized by a modification of the customary +i0 prescription of the Feynman propagators. The…
We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best local Hamiltonian for which the state outperforms separable…
We discuss the duality theorem, which provides a relation between loop integrals and phase space integrals. We rederive the duality relation for the one-loop case and extend it to two and higher-order loops. We explicitly show its…
Understanding the cancellation of ultraviolet and infrared singularities in perturbative quantum field theory is of central importance for the development and automation of various theoretical tools that make accurate predictions for…
We relate a $l$-loop Feynman integral to a sum of phase space integrals, where the integrands are determined by the spanning trees of the original $l$-loop graph. Causality requires that the propagators of the trees have a modified…
The perturbative approach to quantum field theories has made it possible to obtain incredibly accurate theoretical predictions in high-energy physics. Although various techniques have been developed to boost the efficiency of these…
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization…
This PhD thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP). As the Standard Model (SM) leaves key questions unanswered and no signs of new physics have emerged since the…