Quantum algorithms and the power of forgetting
Quantum divide and conquer
Efficient quantum algorithm for dissipative nonlinear differential equations
- Sayas Numerics Seminar, 16 March 2021
- USC Physics Colloquium, 17 March 2021
- Northwest Quantum Nexus Seminar, 24 March 2021
- Center on Frontiers of Computing Studies Quantum Day, Peking University, 11 May 2021
- Janet Das Sarma Conference: “Quantum”, 17 May 2021
[Video]
- IMSI Workshop on Quantum Information for Mathematics, Economics, and Statistics, 27 May 2021
- Max Planck Distinguished Speaker Series on Quantum Computing and Quantum Information, 22 July 2021
- 21st Asian Quantum Information Science Conference (AQIS 2021), 1 September 2021 [Slides]
- Fall 2021 INTRIQ Meeting, 13 October 2021
- Computational Mathematics Colloquium, University of Waterloo, 28 October 2021
- Workshop on Quantum Numerical Linear Algebra, IPAM, 24 January 2022
[Video]
Symmetries, graph properties, and quantum speedups
Quantum algorithms and lower bounds for convex optimization
- University College London, 11 April 2019
Algorithmic advances in quantum simulation
Algorithmic challenges in quantum simulation
Algorithms for quantum computers
Toward the first quantum simulation with quantum speedup
The long-term potential of quantum computers
Simulating quantum mechanics with quantum computers
High-precision 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 Bose-Hubbard and XY models are QMA-complete
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 multi-particle quantum walk
- CIFAR Workshop on Quantum Information Processing, Sherbrooke, 16 November 2013
[Slides]
Universal computation by multi-particle quantum walk
The quantum query complexity of read-many formulas
Quantum query complexity of minor-closed 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 black-box unitary transformations
- Massachusetts Institute of Technology, 19 October 2009
[Slides]
-
The relationship between continuous- and discrete-time quantum walk
- SQuInT 2009, Seattle, 22 February 2009
[Slides]
- QuantumWorks 4th Annual General Meeting, Toronto, 11 June 2009
- Los Alamos National Lab, 10 September 2009
-
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 Fourier-Schur 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
-
Teleportation-based approaches to universal quantum computation with
single-qubit 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