Quantum computers are expected to surpass the computational capabilities of classical
computers and have a transformative impact on numerous industry sectors. We present a …

Applications such as simulating complicated quantum systems or solving large-scale linear
algebra problems are very challenging for classical computers, owing to the extremely high …

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 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 …

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 …

Quantum computers are expected to surpass the computational capabilities of classical
computers during this decade and have transformative impact on numerous industry sectors …

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 …

Previously proposed quantum algorithms for solving linear systems of equations cannot be
implemented in the near term due to the required circuit depth. Here, we propose a hybrid …

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 …

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