Related papers: Low Depth Quantum Circuits for Ising Models
Studying the zeroes of partition functions in the space of complex control parameters allows to understand formally how critical behavior of a many-body system can arise in the thermodynamic limit despite various no-go theorems for finite…
We consider the use of quantum noise to characterize many-body states of spin systems realized with ultracold atomic systems. These systems offer a wealth of experimental techniques for realizing strongly interacting many-body states in a…
We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D…
We consider generalized quantum Ising models, including those which could describe disordered materials or quantum annealers, and we prove that for all temperatures above a system-size independent threshold the path integral Monte Carlo…
Measurements allow efficient preparation of interesting quantum many-body states with long-range entanglement, conditioned on additional transformations based on measurement outcomes. Here, we demonstrate that the so-called conformal…
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…
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that…
Measuring quantum observables by grouping terms that can be rotated to sums of only products of Pauli $\hat z$ operators (Ising form) is proven to be efficient in near term quantum computing algorithms. This approach requires extra unitary…
We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the…
We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…
We evaluate using programmable superconducting flux qubit D-Wave quantum annealers to approximate the partition function of Ising models. We propose the use of two distinct quantum annealer sampling methods: chains of Monte Carlo-like…
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 contribute to the mathematical theory of the design of low temperature Ising machines, a type of experimental probabilistic computing device implementing the Ising model. Encoding the output of a function in the ground state of a…
There is no an accepted exact partition function (PF) for the two-dimensional (2D) Ising model with a non-zero external magnetic field to our knowledge. Here we infer an empirical PF for such an Ising model. We compare the PFs for two…
While the ability to measure low temperatures accurately in quantum systems is important in a wide range of experiments, the possibilities and the fundamental limits of quantum thermometry are not yet fully understood theoretically. Here we…
The quantum antiferromagnetic spin-1/2 Ising model on a triangular lattice and analogous fully frustrated Ising model on a square lattice with quantum fluctuations induced by the application of the transverse magnetic field are studied at…
Critical phenomena at finite temperature underpin a broad range of physical systems, yet their study remains challenging due to computational bottlenecks near phase transitions. Quantum annealers have attracted significant interest as a…
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum…
We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being non-universal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses.…
Experimental advances in condensed matter physics and material science have enabled ready access to atomic-resolution images, with resolution of modern tools often sufficient to extract minute details of symmetry-breaking distortions such…