Related papers: New algorithm for classical gauge theory simulatio…
Like [1], we present an algorithm to compute the simulation of a query pattern in a graph of labeled nodes and unlabeled edges. However, our algorithm works on a compressed graph grammar, instead of on the original graph. The speed-up of…
We present a pedagogical introduction to a quantum computing algorithm for the simulation of classical fluids, based on the Carleman linearization of a second-quantized version of lattice kinetic theory. Prospects and limitations for the…
We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error…
A major driver of quantum-simulator technology is the prospect of probing high-energy phenomena in synthetic quantum matter setups at a high level of control and tunability. Here, we propose an experimentally feasible realization of a…
State-of-the-art algorithms in lattice gauge theory typically rely heavily on detailed balance, which is an instrumental tool to prove the correct convergence of the Markov Chain Monte Carlo Algorithm. In this work, we investigate an…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
In Gaussian graphical models, the likelihood equations must typically be solved iteratively. We investigate two algorithms: A version of iterative proportional scaling which avoids inversion of large matrices, and an algorithm based on…
This work concerns a study of the quantum mechanical extension of the work of Horwitz et al. [1] on the stability of classical Hamiltonian systems by geometrical methods. Simulations are carried out for several important examples, these…
We review existing classical simulation methods for performing fermionic Gaussian operations and develop new methods to address the gap by adhering to the fundamental theoretical framework established by Bravyi [Quantum Info. Comput. 5, 216…
We present a general strategy to simulate a D+1-dimensional quantum system using a D-dimensional one. We analyze in detail a feasible implementation of our scheme using optical lattice technology. The simplest non-trivial realization of a…
Quantum advantage in computation refers to the existence of computational tasks that can be performed efficiently on a quantum computer but cannot be efficiently simulated on any classical computer. Identifying the precise boundary of…
We present results of numerical simulations for pure U(1) gauge theory in a non-commutative space. The theory is mapped onto a dimensionally reduced matrix model, which renders its numerical treatment feasible. New data on large lattices…
The aim of this paper is to introduce and analyze a new gauge symmetry that appears in complex holomorphic systems. This symmetry allow us to project the system, using different gauge conditions, to several real systems which are connect by…
We present conditions for the efficient simulation of a broad class of optical quantum circuits on a classical machine: this class includes unitary transformations, amplification, noise, and measurements. Various proposed schemes for…
We have continued our systematic investigations of the numerical simulations of lattice gauge theories in the dual formulation. These include: i) a more practical implementation of the quasi-local updating technique, ii) a thorough…
We develop diffusion models for lattice gauge theories which build on the concept of stochastic quantization. This framework is applied to $U(1)$ gauge theory in $1+1$ dimensions. We show that a model trained at one small inverse coupling…
In theories with topological sectors, such as lattice QCD and four-dimensional SU(N) gauge theories with periodic boundary conditions, conventional update algorithms suffer from topological freezing due to large action barriers separating…
We propose an implementation of a two-dimensional $\mathbb{Z}_2$ lattice gauge theory model on a shallow quantum circuit, involving a number of single and two-qubits gates comparable to what can be achieved with present-day and near-future…
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based…
Classical search algorithms have long underpinned modern artificial intelligence. In this work, we tackle the challenge of inference-time control in diffusion models -- adapting generated outputs to meet diverse test-time objectives --…