The longterm potential of quantum computers
Simulating quantum mechanics with quantum computers
Highprecision quantum algorithms
 Computer Science Colloquium, University of Maryland, 30 September 2016
[Slides]
[Video]
 Norbert Wiener Center Seminar, University of Maryland, 6 March 2017 [Slides]
The BoseHubbard and XY models are QMAcomplete
Quantum algorithms for simulating quantum mechanics
 Physics Colloquium, University of Maryland, 24 February 2015
[Slides]
 SITP Seminar, Stanford, 27 February 2015
 Laboratory for Telecommunication Sciences, 23 April 2015
 Naval Research Laboratory, 12 May 2015
From quantum simulation to quantum algorithms for linear algebra
Hamiltonian simulation with nearly optimal dependence on all parameters
Exponential improvement in precision for simulating sparse Hamiltonians
The computational power of quantum walk
 University of Maryland, 10 February 2014
 Perimeter Institute for Theoretical Physics, 11 April 2014
[Slides]
[Video]
Simulating Hamiltonian dynamics on a small quantum computer
The computational power of multiparticle quantum walk
 CIFAR Workshop on Quantum Information Processing, Sherbrooke, 16 November 2013
[Slides]
Universal computation by multiparticle quantum walk
The quantum query complexity of readmany formulas
Quantum query complexity of minorclosed graph properties
Constructing elliptic curve isogenies in quantum subexponential time
Simulating Hamiltonian dynamics
 Institute for Quantum Information Science, University of Calgary, 10 March 2010
[Slides]
Quantum property testing for sparse graphs
The quantum query complexity of implementing blackbox unitary transformations
 Massachusetts Institute of Technology, 19 October 2009
[Slides]

The relationship between continuous and discretetime quantum walk

Universal computation by quantum walk

Searching an ordered list with a quantum computer

Optimal quantum adversary lower bounds for ordered search

Evaluating formulas on a quantum computer

Quantum walks on graphs
 University of New Mexico, 29 March 2007
[Slides]

Quantum algorithms for hidden nonlinear structures
 QIP 2007, Brisbane, 30 January 2007
 SQuInT 2007, Caltech, 17 February 2007
 Western States Mathematical Physics Meeting, Caltech, 20 February 2007
 University of Bristol, 13 March 2007
 UC Davis, 1 May 2007
 Workshop on Advances in Quantum Algorithms, University of Waterloo, 25 June 2007
 IEEE Workshop on Foundations of Computer Science, Providence, 22 October 2007
[Slides]

Quantum algorithms and quantum state identification
 UC San Diego, 17 January 2007
 University of Waterloo, 8 February 2007
 NEC Labs America, 22 February 2007
 University of Washington, 5 March 2007
 University of New Mexico, 29 March 2007
 University of Southern California, 17 April 2007

Quantum algorithm for a generalized hidden shift problem

Weak FourierSchur sampling, the hidden subgroup problem, and the quantum collision problem

Overview of adiabatic quantum computation

The limitations of nice mutually unbiased bases

From optimal measurement to efficient quantum algorithms for the hidden subgroup problem

Optimal measurements for the dihedral hidden subgroup problem

Spatial search and the Dirac equation

Teleportationbased approaches to universal quantum computation with
singlequbit measurements
 Perimeter Institute, 19 November 2003
[Slides]

Spatial search by quantum walk

Exponential algorithmic speedup by quantum walk
 Institute for Quantum Information, Caltech, 29 October 2002
[Slides]

Asymptotic entanglement capacity of the Ising and anisotropic
Heisenberg interactions