Faster quantum chemistry simulation on fault-tolerant quantum computers
N. Cody Jones, James Daniel Whitfield, Peter L. McMahon, Man-Hong Yung, Rodney Van Meter, Alán Aspuru‐Guzik, Y. Yamamoto · New Journal of Physics · 2012
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain.We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on faulttolerant quantum computers; these methods generalize readily to other quantum simulation problems.Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource.To improve execution time, we examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm (Dawson and Nielsen 2006 Quantum Inform.Comput.6 81).For a given approximation error , arbitrary single-qubit gates can be 7