We introduce an algorithm to compute Hamiltonian dynamics on digital quantum
computers that requires only a finite circuit depth to reach an arbitrary
precision, i.e. achieves zero discretization error with finite depth. This
finite number of gates comes at the cost of an attenuation of the measured
expectation value by a known amplitude, requiring more shots per circuit. The
gate count for simulation up to time t is O(t2μ2) with μ the
1-norm of the Hamiltonian, without dependence on the precision desired on the
result, providing a significant improvement over previous algorithms. The only
dependence in the norm makes it particularly adapted to non-sparse
Hamiltonians. The algorithm generalizes to time-dependent Hamiltonians,
appearing for example in adiabatic state preparation. These properties make it
particularly suitable for present-day relatively noisy hardware that supports
only circuits with moderate depth.Comment: 5 page