Related papers: Tackling Feynman integrals with quantum minimizati…
By exploiting the invariance of the molecular Hamiltonian by a unitary transformation of the orbitals it is possible to significantly shorter the depth of the variational circuit in the Variational Quantum Eigensolver (VQE) algorithm by…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit…
We present a new method for numerically computing generic multi-loop Feynman integrals. The method relies on an iterative application of Feynman's trick for combining two propagators. Each application of Feynman's trick introduces a…
This work proposes a hybrid framework combining classical computers with quantum annealers for structural optimisation. At each optimisation iteration of an iterative process, two minimisation problems are formulated one for the underlying…
This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
Many multi-loop calculations make use of integration by parts relations to reduce the large number of complicated Feynman integrals that arise in such calculations to a simpler basis of master integrals. Recently, Gluza, Kajda, and Kosower…
We present a first numerical implementation of the Loop-Tree Duality (LTD) method for the direct numerical computation of multi-leg one-loop Feynman integrals. We discuss in detail the singular structure of the dual integrands and define a…
We analyse the singular behaviour of one-loop integrals and scattering amplitudes in the framework of the loop--tree duality approach. We show that there is a partial cancellation of singularities at the loop integrand level among the…
We extend the Worldline Monte Carlo approach to computationally simulating the Feynman path integral of non-relativistic multi-particle quantum-mechanical systems. We show how to generate an arbitrary number of worldlines distributed…
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…
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…
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…
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However,…
Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. These task-oriented algorithms work in a hybrid loop combining a quantum processor and classical optimization. Using a specific…
Fault Trees represent an essential tool in the reliability and risk assessment of engineering systems. By decomposing the structure of the system into Boolean function, Fault Trees allow the quantitative and qualitative analysis of the…
We review the recent developments of the Loop-Tree Duality method, focussing our discussion on the first numerical implementation and its use in the direct numerical computation of multi-leg Feynman integrals. Non-trivial examples are…
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…
Quantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one…