Quantum state preparation is an important subroutine for quantum computing. We show that
any n-qubit quantum state can be prepared with a Θ (n)-depth circuit using only single-and …

A central roadblock to analyzing quantum algorithms on quantum states is the lack of a
comparable input model for classical algorithms. Inspired by recent work of the author [E …

One of the most fundamental problems in quantum many-body physics is the
characterization of correlations among thermal states. Of particular relevance is the thermal …

We present quantum algorithms for the estimation of n-time correlation functions, the local
and nonlocal density of states, and dynamical linear response functions. These algorithms …

State-of-the-art quantum computers can only reliably execute circuits with limited qubit
numbers and computational depth. This severely reduces the scope of algorithms that can …

A candidate application for quantum computers is to simulate the low-temperature properties
of quantum systems. For this task, there is a well-studied quantum algorithm that performs …

Quantum algorithms for differential equation solving, data processing, and machine learning
potentially offer an exponential speedup over all known classical algorithms. However, there …

We prove an entanglement area law for a class of one-dimensional quantum systems
involving infinite-dimensional local Hilbert spaces. This class of quantum systems includes …

Nonlocal games with advantageous quantum strategies give arguably the most fundamental
demonstration of the power of quantum resources over their classical counterparts …

We propose a set of Bell-type nonlocal games that can be used to prove an unconditional
quantum advantage in an objective and hardware-agnostic manner. In these games, the …