Related papers: Quantum Gibbs sampling through the detectability l…
We show that thermal states of local Hamiltonians are separable above a constant temperature. Specifically, for a local Hamiltonian $H$ on a graph with degree $\mathfrak{d}$, its Gibbs state at inverse temperature $\beta$, denoted by $\rho…
We provide a systematic framework for constructing generic models of nonequilibrium quantum dynamics with a target stationary (mixed) state. Our framework identifies (almost) all combinations of Hamiltonian and dissipative dynamics that…
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state…
Generalized Gibbs ensembles have been used as powerful tools to describe the steady state of integrable many-particle quantum systems after a sudden change of the Hamiltonian. Here we demonstrate numerically, that they can be used for a…
We propose an algorithm for computing real-time observables using a quantum processor while avoiding the need to prepare the full quantum state. This reduction in quantum resources is achieved by classically sampling configurations in…
Recovering an unknown Hamiltonian from measurements is an increasingly important task for certification of noisy quantum devices and simulators. Recent works have succeeded in recovering the Hamiltonian of an isolated quantum system with…
Gibbs sampling is a crucial computational technique used in physics, statistics, and many other scientific fields. For classical Hamiltonians, the most commonly used Gibbs sampler is the Metropolis algorithm, known for having the Gibbs…
Ground-state preparation for a given Hamiltonian is a common quantum-computing task of great importance and has relevant applications in quantum chemistry, computational material modeling, and combinatorial optimization. We consider an…
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…
We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in $\sqrt{N \beta/{\cal Z}}$ and polynomial in…
We revisit the problem of fitting Lindbladian models to the outputs of quantum process tomography. A sequence of prior theoretical works approached the problem by considering whether there exists a Lindbladian generator close to a matrix…
The preparation of Hamiltonian eigenstates is essential for many applications in quantum computing; the efficiency with which this can be done is of key interest. A canonical approach exploits the quantum phase estimation (QPE) algorithm.…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
Drawing independent samples from high-dimensional probability distributions represents the major computational bottleneck for modern algorithms, including powerful machine learning frameworks such as deep learning. The quest for discovering…
We study steady-states of quantum Markovian processes whose evolution is described by local Lindbladians. We assume that the Lindbladian is gapped and satisfies quantum detailed balance with respect to a unique full-rank steady state…
Semidefinite programs (SDPs) are a particular class of convex optimization problems with applications in combinatorial optimization, operational research, and quantum information science. Seminal work by Brand\~{a}o and Svore shows that a…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
The theory of two projections is utilized to study two-component Gibbs samplers. Through this theory, previously intractable problems regarding the asymptotic variances of two-component Gibbs samplers are reduced to elementary matrix…
We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time…
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum…