Related papers: Quantum computational advantage with constant-temp…
Controlled quantum mechanical devices provide a means of simulating more complex quantum systems exponentially faster than classical computers. Such "quantum simulators" rely heavily upon being able to prepare the ground state of…
Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution produced is described by the Porter-Thomas (PT)…
Two identical finite quantum systems prepared initially at different temperatures, isolated from the environment, and subsequently brought into contact are demonstrated to relax towards Gibbs-like quasi-equilibrium states with a common…
Preparing thermal and ground states is an essential quantum algorithmic task for quantum simulation. In this work, we construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary…
Estimating thermal expectation values of observables is a fundamental task in quantum physics, quantum chemistry, and materials science. While recent quantum algorithms have enabled efficient quantum preparation of thermal states,…
We investigate the time evolution of a generic and finite isolated quantum many-body system starting from a pure quantum state. We find the kinematical general canonical principle proposed by Popescu-Short-Winter for statistical mechanics…
We present a quantum algorithm to prepare the thermal Gibbs state of interacting quantum systems. This algorithm sets a universal upper bound D^alpha on the thermalization time of a quantum system, where D is the system's Hilbert space…
Nature is governed by precise physical laws, which can inspire the discovery of new computer-run simulation algorithms. Thermal states are the most ubiquitous for they are the equilibrium states of matter. Simulating thermal states of…
We show that one can construct a quantum absorption refrigerator that provides refrigeration only in the transient regime, by using three interacting qubits, each of which is also interacting with local heat-bath. The machine either does…
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 discuss the application of techniques of quantum estimation theory and quantum metrology to thermometry. The ultimate limit to the precision at which the temperature of a system at thermal equilibrium can be determined is related to the…
Preparing the thermal density matrix $\rho_{\beta} \propto e^{-\beta H}$ corresponding to a given Hamiltonian $H$ is a task of central interest across quantum many-body physics, and is particularly salient when attempting to study it with…
This work introduces an approach rooted in quantum thermodynamics to enhance sampling efficiency in quantum machine learning (QML). We propose conceptualizing quantum supervised learning as a thermodynamic cooling process. Building on this…
Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum information science. A newly developed quantum Gibbs sampling…
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…
Efficient simulation of a quantum system generally relies on structural properties of the quantum state. Motivated by the recent results by Bakshi et al. on the sudden death of entanglement in high-temperature Gibbs states of quantum spin…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
The promise of quantum computing lies in harnessing programmable quantum devices for practical applications such as efficient simulation of quantum materials and condensed matter systems. One important task is the simulation of…
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…
Bell theorems of many-body nonlocality and contextuality serve as a benchmark for proving quantum advantage in that a quantum computer outperforms a classical computer for a certain problem. In practice, however, near-term quantum devices…