Related papers: New algorithm for classical gauge theory simulatio…
We propose the implementation of Galileo group symmetry operations or, in general, linear coordinate transformations, in a quantum simulator. With an appropriate encoding, unitary gates applied to our quantum system give rise to Galilean…
A new type of algorithms is presented that combine the advantages of quantum and classical ones. Those combined advantages along with aspects of Geometric Algebra that open possibilities unavailable to both of these computations are…
Quantum simulations of High Energy Physics, and especially of gauge theories, is an emerging and exciting direction in quantum simulations. However, simulations of such theories, compared to simulations of condensed matter physics, must…
Hamiltonian simulation is a promising application for quantum computers to achieve a quantum advantage. We present classical algorithms based on tensor network methods to optimize quantum circuits for this task. We show that, compared to…
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…
This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…
For two non-communicating parties, quantum theory can give rise to probability distributions of outcomes that no local classical model can reproduce without communication. However, in the case of two-dimensional systems ($d=2$), it is known…
Topological invariants of a dataset, such as the number of holes that survive from one length scale to another (persistent Betti numbers) can be used to analyze and classify data in machine learning applications. We present an improved…
Despite the numerous successful applications of lattice QCD in nuclear and particle theory, fundamental algorithmic challenges remain. Among those, relevant for numerical studies of QCD on a space-time torus, is topological freezing--a form…
Simulating large scale lattice dynamics directly is computationally demanding due to the high complexity involved, yet such simulations are crucial for understanding the mechanical and thermal properties of many physical systems. In this…
Recent advances in quantum technologies have enabled quantum simulation of gauge theories -- some of the most fundamental frameworks of nature -- in regimes far from equilibrium, where classical computation is severely limited. These…
A strong analog classical simulation of general quantum evolution is proposed, which serves as a novel scheme in quantum computation and simulation. The scheme employs the approach of geometric quantum mechanics and quantum informational…
This study presents a novel quantum algorithm for lattice gas automata simulation with a single time step, demonstrating logarithmic complexity in terms of $CX$ gates. The algorithm is composed of three main steps: collision, mapping, and…
This paper addresses the problem of scalable optimization for L1-regularized conditional Gaussian graphical models. Conditional Gaussian graphical models generalize the well-known Gaussian graphical models to conditional distributions to…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
Recent demonstrations of unexcised black holes traversing across computational grids represent a significant advance in numerical relativity. Stable and accurate simulations of multiple orbits, and their radiated waves, result. This…
We investigate non-equilibrium quantum spin systems via an exact mapping to stochastic differential equations. This description is invariant under a shift in the mean of the Gaussian noise. We show that one can extend the simulation time…
The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…
A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power series expansion of the density…
We present a quantum-inspired classical algorithm that can be used for graph-theoretical problems, such as finding the densest $k$-subgraph and finding the maximum weight clique, which are proposed as applications of a Gaussian boson…