Related papers: An Improved Gaussian Approximation for Quantum Fie…
The technique of one-loop calculations for the processes involving Reggeized quarks is described in the framework of gauge invariant effective field theory for the Multi-Regge limit of QCD, which has been introduced by Lipatov and…
Efficient quantum Monte Carlo update schemes called directed loops have recently been proposed, which improve the efficiency of simulations of quantum lattice models. We propose to generalize the detailed balance equations at the local…
We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used…
Gaussian Process Regression is a well-known machine learning technique for which several quantum algorithms have been proposed. We show here that in a wide range of scenarios these algorithms show no exponential speedup. We achieve this by…
Hamiltonian simulation is one of the most promising paths toward quantum advantage. Most prior approaches to Hamiltonian simulation circuit synthesis focus on local rewrite rules and low-level optimizations, and give limited attention to…
We develop a worldline approach to quantum gravity in D=4. Using the background field method we consider the covariantly gauge fixed Einstein-Hilbert action with cosmological constant, and find a worldline representation of the differential…
Recently, Syljuasen and Sandvik proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a…
We outline, test, and apply a new scheme for nonpertubative analyses of quantized field systems in contact with dynamical gravity. While gravity is treated classically in the present paper, the approach lends itself for a generalization to…
We introduce the group field theory formalism for quantum gravity, mainly from the point of view of loop quantum gravity, stressing its promising aspects. We outline the foundations of the formalism, survey recent results and offer a…
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of…
Quantum algorithms present a quadratically improved complexity over classical ones for certain sampling tasks. For instance, the Quantum Amplitude Estimation (QAE) algorithm promises to speedup the estimation of the mean of certain…
In quantum algorithms discovered so far for simulating scattering processes in quantum field theories, state preparation is the slowest step. We present a new algorithm for preparing particle states to use in simulation of Fermionic Quantum…
We give a new quantum circuit approximation of quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary…
In this study, we give an extension of Montanaro's arXiv/archive:1504.06987 quantum Monte Carlo method, tailored for computing expected values of random variables that exhibit infinite variance. This addresses a challenge in analyzing…
Quantum gauge theories with finite-dimensional representation spaces are constructed that can have canonical gauge field theories as singular limits. They describe nature as a recursive quantum assembly by iterating Fermi-Dirac…
We present a new non-local updating scheme for quantum Monte Carlo simulations, which conserves particle number and other symmetries. It allows exact symmetry projection and direct evaluation of the equal-time Green's function and other…
In this work we introduce a general scheme for measurement based quantum computation in continuous variables. Our approach does not necessarily rely on the use of ancillary cluster states to achieve its aim, but rather on the detection of a…
A new method of approximation scheme with potential application to a general interacting quantum system is presented. The method is non-perturbative, self- consistent, systematically improvable and uniformly applicable for arbitrary…
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…
This paper introduces quantum computing methods for Monte Carlo simulations in power systems which are expected to be exponentially faster than their classical computing counterparts. Monte Carlo simulations is a fundamental method, widely…