Related papers: Quantum cluster algorithm for frustrated Ising mod…
Employing the self-learning quantum Monte Carlo algorithm, we investigate the frustrated transverse-field triangle-lattice Ising model coupled to a Fermi surface. Without fermions, the spin degrees of freedom undergoes a second-order…
We study the $J_1$-$J_2$ Ising model on the honeycomb lattice, considering ferromagnetic interactions between first neighbors ($J_1$) and antiferromagnetic interactions between second neighbors ($J_2$). Our analysis is based on the…
Quantum computers are an ideal platform to study the ground state properties of strongly correlated systems due to the limitation of classical computing techniques particularly for systems exhibiting quantum phase transitions. While the…
We present a new approach to clustering, based on the physical properties of an inhomogeneous ferromagnet. No assumption is made regarding the underlying distribution of the data. We assign a Potts spin to each data point and introduce an…
I present a cluster Monte Carlo algorithm that gives direct access to the interface free energy of Ising models. The basic idea is to simulate an ensemble that consists of both configurations with periodic and with antiperiodic boundary…
Using a specially designed Monte Carlo algorithm with directed loops, we investigate the triangular lattice Ising antiferromagnet with coupling beyond nearest neighbour. We show that the first-order transition from the stripe state to the…
An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…
We investigate quantum phase transitions in the transverse field Ising chain with algebraically decaying long-range (LR) antiferromagnetic interactions using the variational Monte Carlo method with the restricted Boltzmann machine employed…
Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte-Carlo method and takes advantage of quantum superposition for random number…
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,…
We report on recent results for strongly frustrated quantum $J_1$-$J_2$ antiferromagnets in dimensionality d=1,2,3 obtained by the coupled cluster method (CCM). We demonstrate that the CCM in high orders of approximation allows us to…
We study the $S = 1$ triangular lattice Ising antiferromagnet by Monte Carlo simulations. Frustrations between a major antiferromagnetic third-neighbor interaction $J_3$ and a minor ferromagnetic nearest-neighbor interaction $J_1$ cause…
Using extensive classical and quantum Monte Carlo simulations, we investigate the ground-state phase diagram of the fully frustrated transverse field Ising model on the square lattice. We show that pure columnar order develops in the…
We propose a new quantum Monte Carlo algorithm which realizes a relaxation intrinsic to the original quantum system. The Monte Carlo dynamics satisfies the dynamic scaling relation $\tau\sim \xi^z$ and is independent of the Trotter number.…
We use superconducting qubit quantum annealing devices to determine the ground state of Ising models with algebraically decaying competing long-range interactions in the thermodynamic limit. This is enabled by a unit-cell-based optimization…
A simple ``brute-force'' parallelisation procedure for the computational implementation of high-order coupled cluster method (CCM) calculations is presented here. This approach is investigated and illustrated by an application of high-order…
We study the ground-state phase diagram of an unfrustrated antiferromagnetic Ising chain with longitudinal and transverse fields in the full range of interactions: from all-to-all to nearest-neighbors. First, we solve the model analytically…
Typical fermion algorithms require the computation (or sampling) of the fermion determinant. We focus instead on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration…
We propose a computational methodology based on a hierarchical cluster growth process to solve spin-3/2 Ising models efficiently. The method circumvents the exponential complexity (\(4^{N}\)) of the canonical ensemble partition function by…
Using a cluster-flipping Monte Carlo algorithm combined with a generalization of the histogram reweighting scheme of Ferrenberg and Swendsen, we have studied the equilibrium properties of the thermal random-field Ising model on a cubic…