Related papers: A Worm Algorithm for the Lattice CP(N-1) Model
The lattice simulations of $QC_2D$ with two flavors of staggered fermions and non-zero quark chemical potential $\mu_q$ have been performed. Dependencies of the Polyakov loop, chiral condensate and baryon number density on $\mu_q$ were…
Quantum lattice models with large local Hilbert spaces emerge across various fields in quantum many-body physics. Problems such as the interplay between fermions and phonons, the BCS-BEC crossover of interacting bosons, or decoherence in…
The topological vacuum structure of the two-dimensional $~CP^{n-1}~$ model for $~n = 3,5,7~$ is studied on the lattice. In particular we investigate the small-volume limit on the torus as well as on the sphere and compare with continuum…
We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D…
A detailed derivation of a two dimensional (2D) low energy effective model for spinless fermions on a square lattice with local interactions is given. This derivation utilizes a particular continuum limit that is justified by physical…
We report on coding and performance of our polynomial hybrid Monte Carlo program on the Earth Simulator. At present the entire program achieves 25--40% efficiency. An analysis of overheads shows that a tuning of inter-node communications is…
One of the ultimate missions of lattice QCD is to simulate atomic nuclei from the first principle of the strong interaction. This is an extremely hard task for the current computational technology, but might be reachable in coming quantum…
In this paper, we study the 3D $N_{\rm f}$-flavor CP$^1$ model (a set of $N_{\rm f}$ CP$^1$ variables) coupled with a dynamical compact U(1) gauge field by means of Monte-Carlo simulations. This model is relevant to 2D $s=1/2$ quantum spin…
This is a pedagogical review of the lattice study of finite density QCD, which is intended to provide the minimum necessary contents, so that the paper may be used as the first reading for a newcomer to the field and also for those working…
The search for new physics requires a joint experimental and theoretical effort. Lattice QCD is already an essential tool for obtaining precise model-free theoretical predictions of the hadronic processes underlying many key experimental…
We present a method for simulating relativistic and nonrelativistic scalar field theories at finite density, with matter transforming in the fundamental representation of the global symmetry group O(N). The method avoids the problem of…
In this paper we explore the practical use of the corner transfer matrix and its higher-dimensional generalization, the corner tensor, to develop tensor network algorithms for the classical simulation of quantum lattice systems of infinite…
We present our latest study of Lambda-Nucleon (LN) interaction by using lattice QCD, following up on our report at LATTICE 2008. We have calculated not only the scattering lengths but also the central and tensor potentials, which are…
The topological susceptibility of $2d$ $\mathrm{CP}^{N-1}$ models is expected, based on perturbative computations, to develop a divergence in the limit $N \to 2$, where these models reduce to the well-known non-linear $\mathrm{O}(3)$…
Based on the tensor network state representation, we develop a nonlinear dynamic theory coined as network contractor dynamics (NCD) to explore the thermodynamic properties of two-dimensional quantum lattice models. By invoking the rank-$1$…
We give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n poly(n) space. Our algorithm builds on the lattice point…
It is argued that QCD might solve the strong CP problem on its own. To test this idea, a lattice simulation suggests itself. In view of the difficulty of such a calculation we have, as a first step, investigated the problem in the $CP^3$…
We study the O(N) loop model on the Honeycomb lattice with real value $N \geq 1$ by means of a cluster algorithm. The formulation of the algorithm is based on the equivalence of the O(N) loop model and the low-temperature graphical…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
We present the ground state extension of the efficient quantum Monte Carlo algorithm for lattice fermions of arXiv:1411.0683. Based on continuous-time expansion of imaginary-time projection operator, the algorithm is free of systematic…