Related papers: An Improved Gaussian Approximation for Quantum Fie…
With the significant advancement in quantum computation in the past couple of decades, the exploration of machine-learning subroutines using quantum strategies has become increasingly popular. Gaussian process regression is a widely used…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
This work investigates in detail the performance and advantages of a new quantum Monte Carlo integrator, dubbed Quantum Fourier Iterative Amplitude Estimation (QFIAE), to numerically evaluate for the first time loop Feynman integrals in a…
This tutorial paper introduces quantum approaches to Monte Carlo computation with applications in computational finance. We outline the basics of quantum computing using Grover's algorithm for unstructured search to build intuition. We then…
An overview is presented on the current status of main mathematical computation methods for the multi-loop corrections to single scale observables in quantum field theory and the associated mathematical number and function spaces and…
We consider generating functionals for computing correlators in quantum field theories with random potentials. Examples of such theories include condensed matter systems with quenched disorder (e.g. spin glass) or cosmological systems in…
The notion of classicality of quantum evolution of light is an object of both conceptual and practical importance. The main goal of this work is to derive the exact conditions for the classicality of quantum Gaussian evolution, i.e. the…
We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching…
We introduce new rounding methods to improve the accuracy of finite precision quantum arithmetic. These quantum rounding methods are applicable when multiple samples are being taken from a quantum program. We show how to use multiple…
We present near-term quantum algorithms for auxiliary-field quantum Monte Carlo (AFQMC), viewed as imaginary-time projection for ground-state calculation as an ensemble of one-body propagators driven by stochastic fields $\Omega$. Starting…
In a previous paper a new approach has been introduced for computing, recursively and numerically, one-loop tensor integrals. Here we describe a few modifications of the original method that allow a more efficient numerical implementation…
The main idea of this work is that the quantum-classical isomorphism is a suitable framework for a generalization of the notion of detailed balance. The quantum-classical isomorphism is used in order to develop a Monte Carlo simulation with…
In this project we initiate an investigation of the applicability of Quasi-Monte Carlo methods to lattice field theories in order to improve the asymptotic error behavior of observables for such theories. In most cases the error of an…
The quantization of the Hamiltonian for a scalar field is performed in the framework of Quantum Reduced Loop Gravity. We outline how the regularization can be performed by using the analogous tools adopted in full Loop Quantum Gravity and…
We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules.…
We outline two alternative schemes to perform numerical calculations in quantum field theory. In principle, both of these approaches are better suited to study phase structure than conventional Monte Carlo. The first method, Source…
We introduce an approach for calculating the quantum loop corrections in the $\phi^4$ theory. Differential regularization and background-field method are essential tools and are used to calculate the effective action of the theory to…
Monte Carlo techniques with importance sampling have been extensively applied to lattice gauge theory in the Lagrangian formulation. Unfortunately, it is extremely difficult to compute the excited states using the conventional Monte Carlo…
We propose quantum algorithms that provide provable speedups for Markov Chain Monte Carlo (MCMC) methods commonly used for sampling from probability distributions of the form $\pi \propto e^{-f}$, where $f$ is a potential function. Our…
We present the current status of the application of our approach of exact amplitude-based resummation in quantum field theory to two areas of investigation: precision QCD calculations of all three of us as needed for LHC physics and the…