Related papers: Worm-algorithm-type Simulation of Quantum Transver…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
The full design of relevant systems for quantum applications, ranging from quantum simulation to sensing, is presented using a combination of atomistic methods. A prototypical system features a two-dimensional ordered distribution of spins…
The competition between non-commuting projective measurements in discrete quantum circuits can give rise to entanglement transitions. It separates a regime where initially stored quantum information survives the time evolution from a regime…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
We apply the generalized Wigner function formalism to detect and characterize a range of quantum phase transitions in several cyclic, finite-length, spin-$\frac{1}{2}$ one-dimensional spin-chain models, viz., the Ising and anisotropic $XY$…
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…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
We present quantum simulation experiments of Ising-like spins on Platonic graphs, which are performed with two-dimensional arrays of Rydberg atoms and quantum-wire couplings. The quantum wires are used to couple otherwise uncoupled…
While the 3d Ising model has defied analytic solution, various numerical methods like Monte Carlo, MCRG and series expansion have provided precise information about the phase transition. Using Monte Carlo simulation that employs the Wolff…
We study the dynamical simulation of open quantum spin chain with nearest neighboring coupling, where each spin in the chain is associated with a harmonic bath. This is an extension of our previous work [G. Wang and Z. Cai, J. Chem. Theory…
A systematic study of both classical and quantum geometric frustrated Ising models with a competing ordering mechanism is reported in this paper. The ordering comes in the classical case from a coupling of 2D layers and in the quantum model…
We present an exact simulation of a one-dimensional transverse Ising spin chain with a quantum computer. We construct an efficient quantum circuit that diagonalizes the Ising Hamiltonian and allows to obtain all eigenstates of the model by…
The utility of near-term quantum computers and simulators is likely to rely upon software-hardware co-design, with error-aware algorithms and protocols optimized for the platforms they are run on. Here, we show how knowledge of noise in a…
The theory of spin models intersects with condensed matter physics, complex systems, graph theory, combinatorial optimization, computational complexity and neural networks. Many ensuing applications rely on the fact that complicated spin…
The trapped ion quantum simulator has demonstrated qualitative properties of different physical models for up to tens of ions. In particular, a linear ion chain naturally hosts long-range Ising interactions under the laser driving, which…
Progress in describing thermodynamic phase transitions in quantum systems is obtained by noticing that the Gibbs operator $e^{-\beta H}$ for a two-dimensional (2D) lattice system with a Hamiltonian $H$ can be represented by a…
In recent years, analog quantum simulators have reached unprecedented quality, both in qubit numbers and coherence times. Most of these simulators natively implement Ising-type Hamiltonians, which limits the class of models that can be…
We introduce a variational implementation of cluster perturbation theory (CPT) to address the dynamics of spin systems driven out of equilibrium. We benchmark the method with the quantum Ising model subject to a sudden quench of 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.…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…