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

One of the most promising suggested applications of quantum computing is solving
classically intractable chemistry problems. This may help to answer unresolved questions …

As we begin to reach the limits of classical computing, quantum computing has emerged as
a technology that has captured the imagination of the scientific world. While for many years …

It is for the first time that quantum simulation for high-energy physics (HEP) is studied in the
US decadal particle-physics community planning, and in fact until recently, this was not …

Quantum algorithms offer significant speed-ups over their classical counterparts for a variety
of problems. The strongest arguments for this advantage are borne by algorithms for …

The Lie-Trotter formula, together with its higher-order generalizations, provides a direct
approach to decomposing the exponential of a sum of operators. Despite significant effort …

We present the problem of approximating the time-evolution operator $ e^{-i\hat {H} t} $ to
error $\epsilon $, where the Hamiltonian $\hat {H}=(\langle G|\otimes\hat {\mathcal {I}})\hat …

An n-qubit quantum circuit performs a unitary operation on an exponentially large, 2 n-
dimensional, Hilbert space, which is a major source of quantum speed-ups. We develop a …

Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

We describe quantum circuits with only O~(N) Toffoli complexity that block encode the
spectra of quantum chemistry Hamiltonians in a basis of N arbitrary (eg, molecular) orbitals …