A sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free, which substantially outperforms the existing optimization algorithms and converges to a solution almost independent of the initial choice of the parameters.Expand

The ALPS libraries provide a powerful framework for programmers to develop their own applications, which, for instance, greatly simplify the steps of porting a serial code onto a parallel, distributed memory machine.Expand

We propose a new tensor renormalization group algorithm, Anisotropic Tensor Renormalization Group (ATRG), for lattice models in arbitrary dimensions. The proposed method shares the same versatility… Expand

A general strategy to extend quantum cluster algorithms for S = 1 / 2 spin systems, such as the loop algorithm, to those with an arbitrary size of spins, by introducing additional graphs for the boundary part and giving the labeling probability explicitly.Expand

An order parameter to characterize valence-bond-solid states in quantum spin chains is proposed, given by the ground-state expectation value of a unitary operator appearing in the Lieb-Schultz-Mattis argument, and it is shown that the order parameter changes the sign according to the number of valence bonds at the boundary for periodic systems.Expand

A singularity on the negative-fugacity axis of the hard-core lattice gas is investigated in terms of numerical diagonalization of large-scale transfer matrices. For the hard-square lattice gas, the… Expand

A bounce-free worm algorithm for generic quantum spin models is formulated and it is demonstrated that the autocorrelation time of the Potts model becomes more than 6 times shorter than that by the conventional Metropolis algorithm.Expand

To examine the validity of the scenario of the deconfined critical phenomena, we carry out a quantum Monte Carlo simulation for the SU($N$) generalization of the Heisenberg model with four-body and… Expand