Related papers: A cluster algorithm for Potts models with fixed sp…
The two-dimensional Potts Model with seven states under external field is studied using a cluster algorithm. Cluster size distribution and the fluctuations in the average cluster size provide helpful information on the order of phase…
The exact quantum dynamics of the reduced density matrix of two coupled spin qubits in a quantum Heisenberg XY spin star environment in the thermodynamic limit at arbitrarily finite temperatures is obtained using a novel operator technique.…
Cluster states are an essential component in one-way quantum computation protocols. We present two schemes to generate addressable continuous-variable cluster states from quadrature squeezed cylindrically polarized modes. By including…
In this paper a new framework has been applied to the design of controllers which encompasses nonlinearity, hysteresis and arbitrary density functions of forward models and inverse controllers. Using mixture density networks, the…
We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on…
The derivation of entropy for cluster methods is reformulated by constructing the probability of a given particle (spin) configuration as a self-consistent product of cluster configuration probabilities. This approach gives an insight into…
Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a…
We theoretically consider coherence times for spins in two quantum computer architectures, where the qubit is the spin of an electron bound to a P donor impurity in Si or within a GaAs quantum dot. We show that low temperature decoherence…
We optimize matrix-product state-based algorithms for simulating quantum circuits with finite fidelity, specifically the time-evolving block decimation (TEBD) and the density-matrix renormalization group (DMRG) algorithms, by exploiting the…
In 1986, Swendsen and Wang proposed a replica Monte Carlo algorithm for spin glasses [Phys. Rev. Lett. 57 (1986) 2607]. Two important ingredients are present, (1) the use of a collection of systems (replicas) at different of temperatures,…
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
Recently, Syljuasen and Sandvik proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a…
Spin-glass systems are universal models for representing many-body phenomena in statistical physics and computer science. High quality solutions of NP-hard combinatorial optimization problems can be encoded into low energy states of…
A recent work [1] proposed a type of cluster entangled coherent states and its generation. Here we present an alternative experimental arrangement for its generation in bimodal QED cavities. The scheme employs a single two-level atom that…
The existence of a quantum spin liquid (QSL) in which quantum fluctuations of spins are sufficiently strong to preclude spin ordering down to zero temperature was originally proposed theoretically more than 40 years ago, but its…
A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings…
The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners have enjoyed remarkable success in applying heuristics like…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concurrently. The algorithm uses circulating tokens that collect…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…