Faster quantum chemistry simulation on fault-tolerant quantum computers

Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm (C.M. Dawson and M.A. Nielsen, Quantum Inf. Comput., 6:81, 2006). For a given approximation error , arbitrary single- qubit gates can be produced fault-tolerantly and using a limited set of gates in time which is O(log ) or O(log log ); with sucient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze ecient implementations of rst- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specic example we analyze is the ground-state energy calculation for Lithium hydride.