Related papers: Gibbs state sampling via cluster expansions
Quantum computing offers potential solutions for finding ground states in condensed-matter physics and chemistry. However, achieving effective ground state preparation is also computationally hard for arbitrary Hamiltonians. It is necessary…
We show how to obtain perfect samples from a quantum Gibbs state on a quantum computer. To do so, we adapt one of the `Coupling from the Past'-algorithms proposed by Propp and Wilson. The algorithm has a probabilistic run-time and produces…
Approximate Bayesian computation methods are useful for generative models with intractable likelihoods. These methods are however sensitive to the dimension of the parameter space, requiring exponentially increasing resources as this…
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…
We present a general protocol for estimating $M$ observables from only $\mathcal{O}(\log (M)/\varepsilon^2)$ copies of a Gibbs state whose Hamiltonian is accessible. The protocol uses single-copy, nonadaptive measurements and uses a total…
Advances in techniques for thermal sampling in classical and quantum systems would deepen understanding of the underlying physics. Unfortunately, one often has to rely solely on inexact numerical simulation, due to the intractability of…
In this paper we describe how MAP inference can be used to sample efficiently from Gibbs distributions. Specifically, we provide means for drawing either approximate or unbiased samples from Gibbs' distributions by introducing low…
We present an algorithm that prepares thermal Gibbs states of one dimensional quantum systems on a quantum computer without any memory overhead, and in a time significantly shorter than other known alternatives. Specifically, the time…
A measurement-based quantum computer could consist of a local-gapped Hamiltonian system, whose thermal states --at sufficiently low temperature-- are universal resources for the computation. Initialization of the computer would correspond…
We present a robust method, based only on measurements, to produce superconducting cluster states. The measurement of the current of a few parallel Josephson-junction qubits realizes a novel type of quantum-state selector. Using this…
The mean field approximation results in the mixed spin 1/2 Ising model and spin 1 Blume-Capel model, in the hexagonal nanowire system, are obtained from the Bogoliubov inequality. The Gibbs free energy, magnetization and critical frontiers…
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…
Gibbs sampling is fundamental to a wide range of computer algorithms. Such algorithms are set to be replaced by physics based processors$-$be it quantum or stochastic annealing devices$-$which embed problem instances and evolve a physical…
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…
The experimental realisation of large scale many-body systems has seen immense progress in recent years, rendering full tomography tools for state identification inefficient, especially for continuous systems. In order to work with these…
Efficient representation of quantum many-body states on classical computers is a problem of enormous practical interest. An ideal representation of a quantum state combines a succinct characterization informed by the system's structure and…
I investigate the extent to which the description of quantum systems by Gibbs states can be justified purely on the basis of tomographic data, without recourse to theoretical concepts such as infinite ensembles, environments, information,…
Classical simulations of quantum systems are notoriously difficult computational problems, with conventional state vector and tensor network methods restricted to quantum systems that feature only a small number of qudits. The recently…
We develop a general perturbative theory of finite-coupling quantum thermometry up to second order in probe-sample interaction. By assumption, the probe and sample are in thermal equilibrium, so the probe is described by the mean-force…
Calculating the physical properties of quantum thermal states is a difficult problem for classical computers, rendering it intractable for most quantum many-body systems. A quantum computer, by contrast, would make many of these…