Related papers: Quantum algorithms for classical lattice models
The optimal use of quantum and classical computational techniques together is important to address problems that cannot be easily solved by quantum computations alone. This is the case of the ground state problem for quantum many-body…
We propose Monte Carlo methods to estimate the partition function of the two-dimensional Ising model in the presence of an external magnetic field. The estimation is done in the dual of the Forney factor graph representing the model. The…
Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its…
The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation…
We develop an efficient algorithm for a spatially inhomogeneous matrix-valued quantum Boltzmann equation derived from the Hubbard model. The distribution functions are $2 \times 2$ matrix-valued to accommodate the spin degree of freedom,…
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…
The partition function of the q-state Potts model with random ferromagnetic couplings in the large-q limit is generally dominated by the contribution of a single diagram of the high temperature expansion. Computing this dominant diagram…
Gate-based universal quantum computers form a rapidly evolving field of quantum computing hardware technology. In previous work, we presented a quantum algorithm for lattice protein folding on a cubic lattice, tailored for quantum…
New algorithm of the finite lattice method is presented to generate the high-temperature expansion series of the Ising model. It enables us to obtain much longer series in three dimensions when compared not only to the previous algorithm of…
We investigate quantum inspired algorithms to compute physical observables of quantum many-body systems at finite energies. They are based on the quantum algorithms proposed in [Lu et al. PRX Quantum 2, 020321 (2021)], which use the quantum…
The partition function of the two-dimensional Ising model on a square lattice with nearest-neighbour interactions and periodic boundary conditions is investigated. Kaufman [Phys. Rev. 76, 1232--1243 (1949)] gave a solution for this function…
Numerical studies of lattice quantum field theories are conducted in finite spatial volumes, typically with cubic symmetry in the spatial coordinates. Motivated by these studies, this work presents a general algorithm to construct…
Lattice field theory, along with its algorithmic and hardware ecosystems, has been at the forefront of computational particle and nuclear physics. It continues to deliver impressive results on the hadronic spectrum, structure, decays, and…
The computational complexity of simulating the dynamics of physical quantum systems is a central question at the interface of quantum physics and computer science. In this work, we address this question for the simulation of exponentially…
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of…
We introduce an algorithm based on Generalized Dual Method (GDM) to efficiently study the dynamics of a particle in quasiperiodic environments without the need to use periodic approximations or to save the information of the vertices that…
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
Building on hybrid quantum lattice gas algorithm, we revisit the possibilities of this quantum lattice model. By deriving a correction to the predicted viscosity, we provide analytical and numerical results that refine original formulation.…
The canonical partition function of a system of rotators (classical X-Y spins) on a lattice, coupled by terms decaying as the inverse of their distance to the power alpha, is analytically computed. It is also shown how to compute a…
We propose a quantum algorithm for the linear advection-diffusion equation (ADE) Lattice-Boltzmann method (LBM) that leverages dynamic circuits. Dynamic quantum circuits allow for an optimized collision-operator quantum algorithm,…