Related papers: Quantum computational advantage with constant-temp…
Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…
We prove that any one-dimensional (1D) quantum state with small quantum conditional mutual information in all certain tripartite splits of the system, which we call a quantum approximate Markov chain, can be well-approximated by a Gibbs…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
On a quantum superconducting processor we observe partial and infinite-temperature thermalization induced by a sequence of repeated quantum projective measurements, interspersed by a unitary (Hamiltonian) evolution. Specifically, on a qubit…
{Many-body quantum states at thermal equilibrium are ubiquitous in nature. Investigating their dynamical properties is a formidable task due to the complexity of the Hilbert space they live in. Quantum computers may have the potential to…
Quantum technology has the potential to revolutionize how we acquire and process experimental data to learn about the physical world. An experimental setup that transduces data from a physical system to a stable quantum memory, and…
We introduce a method for digital preparation of ground states of simulated Hamiltonians, inspired by cooling in nature and adapted to leverage the capabilities of digital quantum hardware. The cold bath is simulated by a single ancillary…
In this article, we derive the stochastic master equations corresponding to the statistical model of a heat bath. These stochastic differential equations are obtained as continuous time limits of discrete models of quantum repeated…
Statistical mechanics assumes that a quantum many-body system at low temperature can be effectively described by its Gibbs state. However, many complex quantum systems exist only as metastable states of dissipative open system dynamics,…
It has previously been suggested that small subsystems of closed quantum systems thermalize under some assumptions; however, this has been rigorously shown so far only for systems with very weak interaction between subsystems. In this work,…
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…
The evolution of a driven quantum system is said to be adiabatic whenever the state of the system stays close to an instantaneous eigenstate of its time-dependent Hamiltonian. The celebrated quantum adiabatic theorem ensures that such pure…
Quantum Markov networks are a generalization of quantum Markov chains to arbitrary graphs. They provide a powerful classification of correlations in quantum many-body systems---complementing the area law at finite temperature---and are…
We develop a quantum algorithm for estimating the free energy as well as the total Gibbs state of interacting quantum Coulomb gases and molecular systems in dimensions $d \in \{2,3\}$ at finite temperature. These systems lie beyond the…
In the current era of noisy quantum devices, there is a need for quantum algorithms that are efficient and robust against noise. Towards this end, we introduce the projected cooling algorithm for quantum computation. The projected cooling…
We develop a rigorous system-agnostic method to predict quantum thermalization in an overwhelming fraction of accessible pure states in a many-body system, entirely in terms of certain out-of-time-ordered correlators of few-body…
Szegedy's quantum walk gives a generic quadratic speedup for reversible classical Markov chains, but extending this mechanism to quantum Gibbs sampling has remained challenging beyond special cases. We present a walk-free quantum algorithm…
For quantum many-body systems in one dimension, computational complexity theory reveals that the evaluation of ground-state energy remains elusive on quantum computers, contrasting the existence of a classical algorithm for temperatures…
The removal of heat generated during computation poses a major challenge for both classical and quantum information processing. In particular, heat removal is directly linked to a fundamental requirement of quantum computation: the ability…
Quantum thermometry leveraging quantum sensors is investigated with an emphasis on fundamental precision bounds derived from quantum estimation theory. The proposed sensing platform consists of two dissimilar qubits coupled via capacitor,…