Quantum algorithms for Hamiltonian simulation

  • Dominic Berry | Macquarie University

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.

[SLIDES]

Speaker Details

I am an ARC Future Fellow working on techniques for quantum information and metrology that are robust against errors. This research is in both quantum information and quantum optics. My interests include the use of adaptive techniques to beat the standard quantum limit for phase measurements, processing of quantum optical states to achieve tasks in quantum information, quantum algorithms for simulation problems, and Bell inequalities. In quantum information, I developed some of the most efficient known algorithms for simulation of physical systems, which have been used as the basis for important new quantum algorithms. In the area of quantum optics, I invented the most accurate known methods to measure optical phase by using adaptive techniques, and am collaborating with experimental groups for demonstration of these methods.

    • Portrait of Jeff Running

      Jeff Running

Series: Microsoft Research Talks