Related papers: An Efficient Cluster Algorithm for CP(N-1) Models
In this paper we discuss a family of models of particle and energy diffusion on a one-dimensional lattice, related to those studied previously in [Sasamoto-Wadati], [Barraquand-Corwin] and [Povolotsky] in the context of KPZ universality…
We explore a new way to simulate quantum field theory, without introducing a spatial lattice. As a pilot study we apply this method to the 3d \lambda \phi^4 model. The regularisation consists of a fuzzy sphere with radius R for the two…
We present a novel algorithm that allows one to obtain temperature dependent properties of quantum lattice models in the thermodynamic limit from exact diagonalization of small clusters. Our Numerical Linked Cluster (NLC) approach provides…
We present and compare new types of algorithms for lattice QCD with staggered fermions in the limit of infinite gauge coupling. These algorithms are formulated on a discrete spatial lattice but with continuous Euclidean time. They make use…
We propose a cluster simulation algorithm for statistical ensembles with fixed order parameter. We use the tethered ensemble, which features Helmholtz's effective potential rather than Gibbs's free energy, and in which canonical averages…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
We propose a generalization of the supersymmetric representation of spins with symplectic symmetry, generalizing the rotation group of the spin from SU(2) to SP(N). As a test application of this new representation, we consider two toy…
We present an algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of…
Experiments in coherent nuclear and electron magnetic resonance,and quantum computing in general correspond to control of quantum mechanical systems, guiding them from initial to final target states by unitary transformations. The control…
In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step which by default has a $\mathcal O(N^2)$ complexity (where $N$ is the number of particles). Existing improvements in the literature…
Topological matter is a popular topic in both condensed matter and cold atom research. In the past decades, a variety of models have been identified with fascinating topological features. Some, but not all, of the models can be found in…
The spin-dependent operators for heavy quarkonium hybrids have been recently obtained in a nonrelativistic effective field theory approach up to next-to-leading order in the heavy-quark mass expansion. In the effective field theory for…
We present a data-efficient framework for constructing general classical spin Hamiltonians by combining the spin-cluster expansion (SCE) with fully self-consistent noncollinear spin density functional theory (DFT). The key idea is to fit…
We propose a method of simulating efficiently many-body interacting fermion lattice models in trapped ions, including highly nonlinear interactions in arbitrary spatial dimensions and for arbitrarily distant couplings. We map products of…
This paper summarizes a research program that has been underway for a decade. The objective is to find a fast and accurate scheme for solving quantum problems which does not involve a Monte Carlo algorithm. We use an alternative strategy…
We investigate the real-time dynamics of U(1) and SU(N) gauge theories coupled to fermions on a lattice. While real-time lattice gauge theory is not amenable to standard importance sampling techniques, for a large class of time-dependent…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…
Lattice spin models are useful for studying critical phenomena and allow the extraction of equilibrium and dynamical properties. Simulations of such systems are usually based on Monte Carlo (MC) techniques, and the main difficulty is often…
Clustering high-dimensional datasets is hard because interpoint distances become less informative in high-dimensional spaces. We present a clustering algorithm that performs nonlinear dimensionality reduction and clustering jointly. The…