Related papers: New algorithm for classical gauge theory simulatio…
Cold atoms have become a powerful platform for quantum-simulating lattice gauge theories in higher spatial dimensions. However, such realizations have been restricted to the lowest possible truncations of the gauge field, which limit the…
A method of constructing a canonical gauge invariant quantum formulation for a non-gauge classical theory depending on a set of parameters is advanced and then applied to the theory of closed bosonic string interacting with massive…
State-space smoothing has found many applications in science and engineering. Under linear and Gaussian assumptions, smoothed estimates can be obtained using efficient recursions, for example Rauch-Tung-Striebel and Mayne-Fraser algorithms.…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
We present an algorithm to simulate two-dimensional quantum lattice systems in the thermodynamic limit. Our approach builds on the {\em projected entangled-pair state} algorithm for finite lattice systems [F. Verstraete and J.I. Cirac,…
Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e…
In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dimensional basis. In particular, we show that the…
Classical tensor network and hybrid quantum-classical algorithms are promising candidates for the investigation of real-time properties of lattice gauge theories. We develop here a novel framework which enforces gauge symmetry via a…
We extend to larger unification groups an earlier study exploring the possibility of unification of gauge symmetries in theories with dynamical symmetry breaking. Based on our results, we comment on the outlook for models that seek to…
I discuss a new approach to constructing lattices for gauge theories with extended supersymmetry. The lattice theories themselves respect certain supersymmetries, which in many cases allows the target theory to be obtained in the continuum…
Gauge theories appear broadly in physics, ranging from the standard model of particle physics to long-wavelength descriptions of topological systems in condensed matter. However, systems with sign problems are largely inaccessible to…
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this…
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…
I review recent research and advances in algorithms for solvers and gauge generation, with an emphasis on practical algorithms for four dimensional simulations. Particular consideration is given to advances in multigrid solvers, fourier…
It is well known in quantum optics that any process involving the preparation of a multimode gaussian state, followed by a gaussian operation and gaussian measurements, can be efficiently simulated by classical computers. Here, we provide…
A novel development is given of the theory of Gaussian quadrature, not relying on the theory of orthogonal polynomials. A method is given for computing the nodes and weights that is manifestly independent of choice of basis in the space of…
The many-body problem is ubiquitous in the theoretical description of physical phenomena, ranging from the behavior of elementary particles to the physics of electrons in solids. Most of our understanding of many-body systems comes from…
Computational physics is an important tool for analysing, verifying, and -- at times -- replacing physical experiments. Nevertheless, simulating quantum systems and analysing quantum data has so far resisted an efficient classical treatment…
We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A…