Key static and dynamic properties of matter—from creation in the Big Bang to evolution into
subatomic and astrophysical environments—arise from the underlying fundamental …

Practical challenges in simulating quantum systems on classical computers have been
widely recognized in the quantum physics and quantum chemistry communities over the …

Under suitable assumptions, some recently developed quantum algorithms can estimate the
ground-state energy and prepare the ground state of a quantum Hamiltonian with near …

The great promise of quantum computers comes with the dual challenges of building them
and finding their useful applications. We argue that these two challenges should be …

Under suitable assumptions, the quantum-phase-estimation (QPE) algorithm is able to
achieve Heisenberg-limited precision scaling in estimating the ground-state energy …

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 …

Adiabatic quantum computing (AQC) started as an approach to solving optimization
problems and has evolved into an important universal alternative to the standard circuit …

The spectral gap—the energy difference between the ground state and first excited state of a
system—is central to quantum many-body physics. Many challenging open problems, such …

The Schrieffer–Wolff (SW) method is a version of degenerate perturbation theory in which
the low-energy effective Hamiltonian Heff is obtained from the exact Hamiltonian by a unitary …

Preparing the ground state of a given Hamiltonian and estimating its ground energy are
important but computationally hard tasks. However, given some additional information, these …