Related papers: Spin chain simulations with a meron cluster algori…
As a fundamental type of topological spin textures in two-dimensional (2D) magnets, a magnetic meron carries half-integer topological charge and forms a pair with its antithesis to keep the stability in materials. However, it is challenging…
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…
Efficient simulation of quantum computers is essential for the development and validation of near-term quantum devices and the research on quantum algorithms. Up to date, two main approaches to simulation were in use, based on either full…
We demonstrate that the ``worm'' algorithm allows very effective and precise quantum Monte Carlo (QMC) simulations of spin systems in a magnetic field, and its auto-correlation time is rather insensitive to the value of H at low…
From celestial mechanics to quantum theory of atoms and molecules, perturbation theory has played a central role in natural sciences. Particularly in quantum mechanics, the amount of information needed for specifying the state of a…
A review of the Loop Algorithm, its generalizations, and its relation to some other Monte Carlo techniques is given. The loop algorithm is a Quantum Monte Carlo procedure which employs nonlocal changes of worldline configurations,…
Topologically ordered phase has emerged as one of most exciting concepts that not only broadens our understanding of phases of matter, but also has been found to have potential application in fault-tolerant quantum computation. The direct…
An effective spin concept is introduced to examine the mathematical and physical analogy between phase coherent charge transport in mesoscopic systems and quantum operations on spin based qubits. When coupled with the Bloch sphere concept,…
The study of quantum circuit simulation using classical computers is a key research topic that helps define the boundary of verifiable quantum advantage, solve quantum many-body problems, and inform development of quantum hardware and…
Classical simulation is essential in quantum algorithm development and quantum device verification. With the increasing complexity and diversity of quantum circuit structures, existing classical simulation algorithms need to be improved and…
In this paper, we show that an effective spin Hamiltonian with various types of couplings can be engineered using quantum simulators in atomic-molecular-optical laboratories, dubbed the \emph{XY}-Gamma model. We analytically solve the…
The main objective of quantum simulation is an in-depth understanding of many-body physics. It is important for fundamental issues (quantum phase transitions, transport, . . . ) and for the development of innovative materials. Analytic…
Classical simulations of high-temperature nuclear spin dynamics in solids are known to accurately predict relaxation for spin 1/2 lattices with a large number of interacting neighbors. Once the number of interacting neighbors becomes four…
Motivated by the numerical simulation of systems which display quantum phase transitions, we present a novel application of the meron-cluster algorithm to simulate the quantum antiferromagnetic Heisenberg model coupled to an external…
Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several…
Spin chains can be used to describe a wide range of platforms for quantum computation and quantum information. They enable the understanding, demonstration, and modeling of numerous useful phenomena, such as high fidelity transfer of…
Quantum simulation elucidates properties of quantum many-body systems by mapping its Hamiltonian to a better-controlled system. Being less stringent than a universal quantum computer, noisy small- and intermediate-scale quantum simulators…
We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
The linked cell list algorithm is an essential part of molecular simulation software, both molecular dynamics and Monte Carlo. Though it scales linearly with the number of particles, there has been a constant interest in increasing its…
We study quantum correlations and complexity of simulation, characterized by quantum mutual information and entanglement entropy in operator space respectively, for thermal states in critical, non-critical and quantum chaotic spin chains. A…