Recent successes in producing intermediate-scale quantum devices have focused interest
on establishing whether near-term devices could outperform classical computers for …

We design a quantum algorithm for ground state preparation in the early fault tolerant
regime. As a Monte Carlo style quantum algorithm, our method features a Lindbladian …

The phase diagram of strong interactions in nature at finite temperature and chemical
potential remains largely theoretically unexplored due to inadequacy of Monte-Carlo–based …

Abstract The Quantum Fisher Information matrix (QFIM) is a central metric in promising
algorithms, such as Quantum Natural Gradient Descent and Variational Quantum Imaginary …

Numerous quantum error-mitigation protocols have been proposed, motivated by the critical
need to suppress noise effects on intermediate-scale quantum devices. Yet, their general …

We present a variational approach for quantum simulators to realize finite temperature Gibbs
states by preparing thermofield double (TFD) states. Our protocol is motivated by the …

This work presents a novel realization approach to quantum Boltzmann machines (QBMs).
The preparation of the required Gibbs states, as well as the evaluation of the loss function's …

We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case
running time n 1/2 m 1/2 s 2 poly (log (n), log (m), R, r, 1/δ), with n and s the dimension and …

Preparing ground states and thermal states is essential for simulating quantum systems on
quantum computers. Despite the hope for practical quantum advantage in quantum …

The thermal or equilibrium ensemble is one of the most ubiquitous states of matter. For
models comprised of many locally interacting quantum particles, it describes a wide range of …