University of Waterloo

## Talks by Andrew Childs

## The computational power of quantum walk

Andrew Childs
University of Waterloo

Quantum computers have the potential to solve certain problems dramatically faster than classical computers. One of the main quantum algorithmic tools is the notion of quantum walk, a quantum mechanical analog of random walk. I will describe quantum algorithms based on this idea, including an optimal algorithm for evaluating Boolean formulas and one of the best known algorithms for simulating quantum dynamics. I will also show how quantum walk can be viewed as a universal model of quantum computation.

## 13/14 PSI - Quantum Information Review - Lecture 14

Andrew Childs
University of Waterloo

## 13/14 PSI - Quantum Information Review - Lecture 13

Andrew Childs
University of Waterloo

## 13/14 PSI - Quantum Information Review - Lecture 12

Andrew Childs
University of Waterloo

## 13/14 PSI - Quantum Information Review - Lecture 11

Andrew Childs
University of Waterloo

## 13/14 PSI - Quantum Information Review - Lecture 10

Andrew Childs
University of Waterloo

## 13/14 PSI - Quantum Information Review - Lecture 9

Andrew Childs
University of Waterloo

## 13/14 PSI - Quantum Information Review - Lecture 8

Andrew Childs
University of Waterloo

## 13/14 PSI - Quantum Information Review - Lecture 7

Andrew Childs
University of Waterloo

## 13/14 PSI - Quantum Information Review - Lecture 6

Andrew Childs
University of Waterloo