TY - JOUR

T1 - Faster quantum chemistry simulation on fault-tolerant quantum computers

AU - Jones, N. Cody

AU - Whitfield, James D.

AU - McMahon, Peter L.

AU - Yung, Man Hong

AU - Meter, Rodney Van

AU - Aspuru-Guzik, Alán

AU - Yamamoto, Yoshihisa

PY - 2012/11/1

Y1 - 2012/11/1

N2 - 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 fault-tolerant 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 produced fault-tolerantly and using a restricted set of gates in time which is O(log ) or O(log log ); with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for lithium hydride.

AB - 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 fault-tolerant 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 produced fault-tolerantly and using a restricted set of gates in time which is O(log ) or O(log log ); with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for lithium hydride.

UR - http://www.scopus.com/inward/record.url?scp=84870476904&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870476904&partnerID=8YFLogxK

U2 - 10.1088/1367-2630/14/11/115023

DO - 10.1088/1367-2630/14/11/115023

M3 - Article

AN - SCOPUS:84870476904

VL - 14

JO - New Journal of Physics

JF - New Journal of Physics

SN - 1367-2630

M1 - 115023

ER -