Related papers: Classical Simulation of High Temperature Quantum I…
The scaling of the transition temperature into an ordered phase close to a quantum critical point as well as the order parameter fluctuations inside the quantum critical region provide valuable information about universal properties of the…
We consider quantum-to-classical mapping for an arbitrary system of interacting spins at finite temperatures. We prove that, in the large-$S$ limit, the asymptotic form of the partition function coincides with that of a classical model for…
Quantum annealers are emerging as programmable, dynamical experimental platforms for probing strongly correlated spin systems. Yet key thermal assumptions, chiefly a Gibbs-distributed output ensemble, remain unverified in the large-scale…
Solving finite-temperature properties of quantum many-body systems is generally challenging to classical computers due to their high computational complexities. In this article, we present experiments to demonstrate a hybrid…
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 develop a novel approach to phase transitions in quantum spin models based on a relation to their classical counterparts. Explicitly, we show that whenever chessboard estimates can be used to prove a phase transition in the classical…
We present quantitative predictions for quantum simulator experiments on Ising models from trapped ions to Rydberg chains and show how the thermalization, and thus decoherence times, can be controlled by considering common, independent, and…
We propose a Monte Carlo algorithm designed to simulate quantum as well as classical systems at equilibrium, bridging the algorithmic gap between quantum and classical thermal simulation algorithms. The method is based on a novel…
We present a hybrid quantum-classical algorithm to simulate thermal states of a classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one…
The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout…
By combining conventional finite-temperature many-body perturbation theory with cluster expansions, we develop a systematic method to carry out high order arbitrary temperature perturbative calculations on the computer. The method is well…
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. The idea is tested by the two models, the transverse Ising model and the traveling salesman…
We present an algorithm to approximate partition functions of 3-body classical Ising models on two-dimensional lattices of arbitrary genus, in the real-temperature regime. Even though our algorithm is purely classical, it is designed by…
Long-range quantum systems, in which the interactions decay as $1/r^{\alpha}$, are of increasing interest due to the variety of experimental set-ups in which they naturally appear. Motivated by this, we study fundamental properties of…
We face the problem of detecting and featuring footprints of quantum criticality in the finite-temperature behavior of quantum many-body systems. Our strategy is that of comparing the phase diagram of a system displaying a T=0 quantum phase…
Simulating thermal-equilibrium properties at finite temperature is crucial for studying quantum many-body systems. Quantum computers are expected to enable us to simulate large systems at finite temperatures, overcoming challenges faced by…
Quantum annealing provides a powerful platform for simulating magnetic materials and realizing statistical physics models, presenting a compelling alternative to classical Monte Carlo methods. We demonstrate that quantum annealers can…
A new computational method for finite-temperature properties of strongly correlated electrons is proposed by extending the variational Monte Carlo method originally developed for the ground state. The method is based on the path integral in…
The development of novel quantum many-body computational algorithms relies on robust benchmarking. However, generating such benchmarks is often hindered by the massive computational resources required for exact diagonalization or quantum…
A scheme for measuring complex temperature partition functions of Ising models is introduced. In the context of ordered qubit registers this scheme finds a natural translation in terms of global operations, and single particle measurements…