Quantum algorithms for Hamiltonian simulation

Опубликовано 27 июля 2016, 1:26

Simulation of physical quantum systems is potentially the most important application of quantum computers, and is Feynman's original motivation for proposing quantum computers. The first proposed techniques for simulation use Lie-Trotter product formulas, and are exponentially faster than classical algorithms in terms of the system dimension. However, they have worse scaling than classical algorithms in terms of other parameters: the system evolution time and the allowable error. I will present new techniques based on quantum walks and graduated compression, that provide improved scaling of the efficiency in terms of these parameters.

See slides and more at microsoft.com/en-us/research/v...