Related papers: Loop Feynman integration on a quantum computer
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…
The area of quantum circuit simulation has attracted a lot of attention in recent years. However, due to the exponentially increasing computational costs, assessing and validating these models on large datasets poses significant obstacles.…
It has previously been established that the logarithmic-depth approximate quantum Fourier transform (AQFT) provides a suitable replacement for the regular QFT in many quantum algorithms. Since the AQFT is less accurate by definition,…
There are important algorithms built upon a mixture of basic techniques described; for example, the Fast Fourier Transform (FFT) employs both Divide-and-Conquer and Transform-and-Conquer techniques. In this article, the evolution of a…
We discuss a progress in calculation of Feynman integrals which has been done with help of the Differential Equation Method and demonstrate the results for a class of two-point two-loop diagrams.
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
We show that recent experiments in hybrid qubit-oscillator devices that measure the phase-space characteristic function of the oscillator via the qubit can be seen through the lens of functional calculus and path integrals, drawing a clear…
Quantum evolution is crucial for the understanding of complex quantum systems. However, current implementations of time evolution on quantum photonic platforms are limited by both low photon generation efficiency and high propagation loss,…
For the calculation of multi-loop Feynman integrals, a novel numerical method, the Direct Computation Method (DCM) is developed. It is a combination of a numerical integration and a series extrapolation. In principle, DCM can handle…
An efficient continuous-time path-integral Quantum Monte Carlo algorithm for the lattice polaron is presented. It is based on Feynman's integration of phonons and subsequent simulation of the resulting single-particle self-interacting…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…
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.…
We present a new program package for calculating one-loop Feynman integrals, based on a new method avoiding Feynman parametrization and the contraction due to Passarino and Veltman. The package is calculating one-, two- and three-point…
We present new results on FeynOnium, an ongoing project to develop a general purpose software toolkit for semi-automatic symbolic calculations in nonrelativistic Effective Field Theories (EFTs). Building upon FeynCalc, an existing…
We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector…
New algebraic approach to analytical calculations of D-dimensional integrals for multi-loop Feynman diagrams is proposed. We show that the known analytical methods of evaluation of multi-loop Feynman integrals, such as integration by parts…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
We present a new implementation of quantum computation that treats quantum computers as a special type of Bayesian Network called a QuDot Net. QuDot Nets allow for the efficient representation of some qubit systems. Single qubit quantum…
Combinatorial optimization problems on graphs have broad applications in science and engineering. The Quantum Approximate Optimization Algorithm (QAOA) is a method to solve these problems on a quantum computer by applying multiple rounds of…