Related papers: Quantum Algorithms for Fermionic Quantum Field The…
We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in…
A class of fermionic quantum field theories with interactions is shown to be equivalent to probabilistic cellular automata, namely cellular automata with a probability distribution for the initial states. Probabilistic cellular automata on…
Scattering processes are fundamental for understanding the structure of matter, yet simulating their real-time dynamics remains challenging for classical computers. Quantum computing and quantum-inspired methods offer a promising avenue for…
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of…
Noisy intermediate-scale quantum (NISQ) computers could solve quantum-mechanical simulation problems that are beyond the capabilities of classical computers. However, NISQ devices experience significant errors which, if not corrected, can…
A new application of quantum field theory is developed that gives a description of the internal dynamics of dressed elementary particles and predicts their masses. The fermionic and bosonic quantum fields are treated as interdependent…
In these proceedings, we review recent advances in applying quantum computing to lattice field theory. Quantum computing offers the prospect to simulate lattice field theories in parameter regimes that are largely inaccessible with the…
Achieving quantum advantage in efficiently estimating collective properties of quantum many-body systems remains a fundamental goal in quantum computing. While the quantum gradient estimation (QGE) algorithm has been shown to achieve doubly…
This paper summarizes a research program that has been underway for a decade. The objective is to find a fast and accurate scheme for solving quantum problems which does not involve a Monte Carlo algorithm. We use an alternative strategy…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
Future quantum computers may serve as a tool to access non-perturbative real-time correlation functions. In this talk, we discuss the prospects of using these to study Compton scattering for arbitrary kinematics. The restriction to a…
In this first paper we begin the application of variational methods to renormalisable asymptotically free field theories, using the Gross-Neveu model as a laboratory. This variational method has been shown to lead to a numerically…
In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant quantum computers. We propose a quantum algorithm for studying these collisions by looking at a class of observables…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
In this paper, we give quantum algorithms for two fundamental computation problems: solving polynomial systems over finite fields and optimization where the arguments of the objective function and constraints take values from a finite field…
Quantum simulation of Lattice Gauge Theories has been proposed and used as a method to overcome theoretical difficulties in dealing with the non-perturbative nature of such models. In this work we focus on two important bottlenecks that…
By employing special solutions of the Hamilton-Jacobi equation and tools from lattice theories, we suggest an approach to convert classical theories to quantum theories for mechanics and field theories. Some nontrivial results are obtained…
We present our recent studies on thermal field theories using quantum algorithms. We first delve into the representation of quantum fields via qubits on general digital quantum computers alongside the quantum algorithms employed to evaluate…
Much progress has been made in the field of quantum computing using continuous variables over the last couple of years. This includes the generation of extremely large entangled cluster states (10,000 modes, in fact) as well as a fault…
We present methods to constrain fermionic condensates on the level of the path integral, which grant access to the quantum effective potential in the infinite volume limit. In the case of a spontaneously broken symmetry, this potential…