## Abstract

We describe a method to simulate Hamiltonian evolution on a quantum computer by repeatedly using a superposition of steps of a quantum walk, then applying a correction to the weightings for the numbers of steps of the quantum walk. This correction enables us to obtain complexity which is the same as the lower bound up to double-logarithmic factors for all parameter regimes. The scaling of the query complexity is *O* (*τ* (log log*τ*/log log log*τ)* + log(1/*ε*)) where *τ* := *t*||*H*||_{max}*d*, for *ε* the allowable error, *t* the time, ||*H*||_{max} the max-norm of the Hamiltonian, and *d* the sparseness. This technique should also be useful for improving the scaling of the Taylor series approach to simulation, which is relevant to applications such as quantum chemistry.

Original language | English |
---|---|

Pages (from-to) | 1295–1317 |

Number of pages | 23 |

Journal | Quantum Information and Computation |

Volume | 16 |

Issue number | 15&16 |

Publication status | Published - Nov 2016 |

## Keywords

- quantum algorithms
- quantum query complexity
- Hamiltonian simulation
- quantum walk