Faster quantum chemistry simulation on fault-tolerant quantum computers

N. Cody Jones, James D. Whitfield, Peter L. McMahon, Man Hong Yung, Rodney D Van Meter, Alán Aspuru-Guzik, Yoshihisa Yamamoto

Research output: Contribution to journalArticle

67 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number115023
JournalNew Journal of Physics
Volume14
DOIs
Publication statusPublished - 2012 Nov

Fingerprint

quantum computers
quantum chemistry
simulation
lithium hydrides
subroutines
time constant
resources
preparation
physics
ground state
approximation
energy

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Jones, N. C., Whitfield, J. D., McMahon, P. L., Yung, M. H., Van Meter, R. D., Aspuru-Guzik, A., & Yamamoto, Y. (2012). Faster quantum chemistry simulation on fault-tolerant quantum computers. New Journal of Physics, 14, [115023]. https://doi.org/10.1088/1367-2630/14/11/115023

Faster quantum chemistry simulation on fault-tolerant quantum computers. / Jones, N. Cody; Whitfield, James D.; McMahon, Peter L.; Yung, Man Hong; Van Meter, Rodney D; Aspuru-Guzik, Alán; Yamamoto, Yoshihisa.

In: New Journal of Physics, Vol. 14, 115023, 11.2012.

Research output: Contribution to journalArticle

Jones, NC, Whitfield, JD, McMahon, PL, Yung, MH, Van Meter, RD, Aspuru-Guzik, A & Yamamoto, Y 2012, 'Faster quantum chemistry simulation on fault-tolerant quantum computers', New Journal of Physics, vol. 14, 115023. https://doi.org/10.1088/1367-2630/14/11/115023
Jones, N. Cody ; Whitfield, James D. ; McMahon, Peter L. ; Yung, Man Hong ; Van Meter, Rodney D ; Aspuru-Guzik, Alán ; Yamamoto, Yoshihisa. / Faster quantum chemistry simulation on fault-tolerant quantum computers. In: New Journal of Physics. 2012 ; Vol. 14.
@article{55e166d4fd0a44ad8886c1f5dbc22686,
title = "Faster quantum chemistry simulation on fault-tolerant quantum computers",
abstract = "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.",
author = "Jones, {N. Cody} and Whitfield, {James D.} and McMahon, {Peter L.} and Yung, {Man Hong} and {Van Meter}, {Rodney D} and Al{\'a}n Aspuru-Guzik and Yoshihisa Yamamoto",
year = "2012",
month = "11",
doi = "10.1088/1367-2630/14/11/115023",
language = "English",
volume = "14",
journal = "New Journal of Physics",
issn = "1367-2630",
publisher = "IOP Publishing Ltd.",

}

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 - Van Meter, Rodney D

AU - Aspuru-Guzik, Alán

AU - Yamamoto, Yoshihisa

PY - 2012/11

Y1 - 2012/11

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

VL - 14

JO - New Journal of Physics

JF - New Journal of Physics

SN - 1367-2630

M1 - 115023

ER -