Related papers: Quantum Algorithm for Preparing Thermal Gibbs Stat…
We present classical and quantum algorithms for approximating partition functions of classical Hamiltonians at a given temperature. Our work has two main contributions: first, we modify the classical algorithm of \v{S}tefankovi\v{c},…
Low-energy estimation and state preparation for general $k$-local Hamiltonians are fundamental challenges in quantum complexity theory. For constant relative accuracy, Buhrman et al. (PRL 2025) recently broke the natural Grover bound…
Gibbs state preparation is an important subroutine in quantum computing. In this work we use the detectability lemma to improve Gibbs state preparation. Specifically, we design new Gibbs state preparation methods that do not rely on…
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient due to its polynomial scaling, we find that the circuits…
While dissipation has traditionally been viewed as an obstacle to quantum coherence, it is increasingly recognized as a powerful computational resource. Dissipative protocols can prepare complex many-body quantum states by leveraging…
Solving finite-temperature properties of quantum many-body systems is generally challenging to classical computers due to their high computational complexities. In this article, we present experiments to demonstrate a hybrid…
Quantum state tomography is an essential tool for the characterization and verification of quantum states. However, as it cannot be directly applied to systems with more than a few qubits, efficient tomography of larger states on mid-sized…
The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout…
While recent advances have established efficient quantum algorithms for preparing Gibbs states of finite-dimensional systems, comparable complexity results for bosonic and other infinite-dimensional models remain unexplored. We introduce…
We consider two related tasks: (a) estimating a parameterisation of a given Gibbs state and expectation values of Lipschitz observables on this state; and (b) learning the expectation values of local observables within a thermal or quantum…
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…
Machine learning algorithms often take inspiration from established results and knowledge from statistical physics. A prototypical example is the Boltzmann machine algorithm for supervised learning, which utilizes knowledge of classical…
The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one…
We give an improved algorithm for learning a quantum Hamiltonian given copies of its Gibbs state, that can succeed at any temperature. Specifically, we improve over the work of Bakshi, Liu, Moitra, and Tang [BLMT24], by reducing the sample…
An algorithm is proposed which transfers the quantum information of a wave function (analogue signal) into a register of qubits (digital signal) such that $n$ qubits describe the amplitudes and phases of $2^n$ points of a sufficiently…
A local and distributive algorithm is proposed to find an optimal trial wave-function minimizing the Hamiltonian expectation in a quantum system. To this end, the quantum state of the system is connected to the Gibbs state of a classical…
We present a holographic quantum simulation algorithm to variationally prepare thermal states of $d$-dimensional interacting quantum many-body systems, using only enough hardware qubits to represent a ($d$-1)-dimensional cross-section. This…
We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known…
In quantum algorithms discovered so far for simulating scattering processes in quantum field theories, state preparation is the slowest step. We present a new algorithm for preparing particle states to use in simulation of Fermionic Quantum…
We consider the problem of preparing thermal equilibrium states at finite temperature on quantum computers. Assuming thermalization, we show that states that are locally at thermal equilibrium can be prepared by evolving adiabatically an…