Hamiltonian simulation

Cambridge University Press eBooks, pp. 210–224

Abstract

This chapter covers the quantum algorithmic primitive of Hamiltonian simulation, which aims to digitally simulate the evolution of a quantum state forward in time according to a Hamiltonian. There are several approaches to Hamiltonian simulation, which are best suited to different situations. We cover approaches for time-independent Hamiltonian simulation based on product formulas, the randomized compiling approach called qDRIFT, and quantum signal processing. We also discuss a method that leverages linear combination of unitaries and truncation of Taylor and Dyson series, which is well suited for time-dependent Hamiltonian simulation

Authors 4

1. Sam McArdle
   Affiliation as printed

   AWS Center for Quantum Computing

2. Connor T. Hann
   Affiliation as printed

   AWS Center for Quantum Computing

3. Aleksander Kubica

   Yale University

   Affiliation as printed

   Yale University

4. Fernando G. S. L. Brandão
   Affiliation as printed

   AWS Center for Quantum Computing