Related papers: Cluster Monte Carlo Algorithm for the Quantum Roto…
Nanoscale physics and dynamical mean field theory have both generated increased interest in complex quantum impurity problems and so have focused attention on the need for flexible quantum impurity solvers. Here we demonstrate that the…
We consider a new formulation of the stochastic coupled cluster method in terms of the similarity transformed Hamiltonian. We show that improvement in the granularity with which the wavefunction is represented results in a reduction in the…
We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient…
Generalized rules for building and flipping clusters in the quantum Monte Carlo loop algorithm are presented for the XXZ-model in a uniform magnetic field along the Z-axis. As is demonstrated for the Heisenberg antiferromagnet it is…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Motivated by recent developments in conformal field theory (CFT), we devise a Quantum Monte Carlo (QMC) method to calculate the moments of the partially transposed reduced density matrix at finite temperature. These are used to construct…
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…
We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path integral representation of the partition function. The code can deal with…
A cluster Monte Carlo algorithm for the Ashkin-Teller (AT) model is constructed according to the guidelines of a general scheme for such algorithms. Its dynamical behaviour is tested for the square lattice AT model. We perform simulations…
We study the correlations of classical hardcore dimer models doped with monomers by Monte Carlo simulation. We introduce an efficient cluster algorithm, which is applicable in any dimension, for different lattices and arbitrary doping. We…
We perform quantum Monte Carlo simulations of the itinerant-localized periodic Kondo-Heisenberg model for the underdoped cuprates to calculate the associated spin correlation functions. The strong electron correlations are shown to play a…
Computing the ground-state properties of quantum many-body systems is a promising application of near-term quantum hardware with a potential impact in many fields. The conventional algorithm quantum phase estimation uses deep circuits and…
We propose and study a novel efficient algorithm for clustering and classification tasks based on the famous MBO scheme. On the one hand, inspired by Jacobs et al. [J. Comp. Phys. 2018], we introduce constraints on the size of clusters…
This paper considers clustered multi-task compressive sensing, a hierarchical model that solves multiple compressive sensing tasks by finding clusters of tasks that leverage shared information to mutually improve signal reconstruction. The…
We study a generalized clock model on the simple cubic lattice. The parameter of the model can be tuned such that the amplitude of the leading correction to scaling vanishes. In the main part of the study we simulate the model with $Z_8$…
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates…
Cluster Perturbation Theory (CPT) is a technique for computing the spectral function of fermionic models with local interactions. By combining the solution of the model on a finite cluster with perturbation theory on intra-cluster hoppings,…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
By precisely writing down the matrix element of the local Boltzmann operator, we have proposed a new path integral formulation for quantum field theory and developed a corresponding Monte Carlo algorithm. With current formula, the…