Talks

Quantum Algorithm for Computing the Period Lattice of an Infrastructure, Recent Progress on Quantum Algorithms, Institute for Quantum Computing, University of Waterloo and Perimeter Institute, Waterloo, Canada, April 11-13, 2012

Quantum Algorithm for Computing the Period Lattice of an Infrastructure, QIP Seminar at MIT, October 31, 2011

Quantum Algorithms for One-dimensional Infrastructures, SIAM Conference on Applied Algebraic Geometry, North Carolina State University, Raleigh, North Carolina, October 6-9, 2011

Quantum Algorithms (with Andrew Childs), 10th Canadian Summer School on Quantum Information, University of British Columbia, Vancouver, Canada, July 17-30, 2010

Quantum Algorithm for Preparing Thermal States of Interacting Quantum Systems, Workshop on Quantum Algorithms, Computational Models, and Foundations of Quantum Mechanics, University of British Columbia, Vancouver, Canada, July 23-25, 2010

Quadratic Hidden Polynomials and Dihedral Hidden Subgroups, Institute for Quantum Information, California Institute of Technology, May 7-21, 2010 and Department of Electrical Engineering & Computer Science, University of California, Berkeley, May 3-7, 2010

Quantum Algorithms for Approximating Jones and HOMFLYPT Polynomials, Mini-Conference on Topology and Quantum Information Theory, George Washington University, Washington, March 24-26, 2010

Quantum Algorithms for Preparing Thermal Gibbs States, NATO Advanced Research Workshop "Quantum Cryptography and Computing: Theory and Implementation", National Quantum Information Center of Gdansk, University of Gdansk, Poland, September 9-12, 2009

IMA Conference on Quantum Computing and Complexity of Quantum Simulation, Institute for Mathematical Science, Imperial College, London, UK, March 31 - April 2, 2009

Quantum Speed-up of Estimating Paritions Functions, Institute for Quantum Computing, University of Waterloo, March 2009 and Department of Physics, University of Sherbrooke

Mutually Unbiased Bases in Square Dimensions, Mathematics Colloquium Series, University of Central Florida, October 23, 2008

Estimating Partition Functions on Quantum Computers, QICS Workshop "Foundational Structures for Quantum Information and Quantum Computation", Obergurgl, Austria, September 14-20, 2008

Speed-up by Quantum Sampling, Institute for Quantum Information, California Institute of Technology, April 2008

Hamiltonian Quantum Cellular Automata in 1D, Classical and Quantum Information Theory, Santa Fe, New Mexico, March 24-28, 2008

Introduction to Quantum Algorithms Based on Group Representations, Mathematics Department, University of Central Florida, March 2008

Hamiltonian Quantum Cellular Automata in 1D, Perimeter Institute for Theoretical Physics, Waterloo, Canada, January 2008

Efficient Combinatorial Schemes for Decoupling and Simulating Hamiltonians, First International Conference on Quantum Error Correction, Center for Quantum Information Science and Technology, University of Southern California, December 17-21, 2007

Classical Problems Characterizing the Power of Quantum Computing, Quantum Information Science @ MIT, Massachusetts Institute of Technology, Boston, November 5, 2007

Efficient Quantum Algorithm for Identifying Hidden Polynomial Function Graphs
NEC/Rutgers seminar "Quantum Computing: Theory and Implementations", Princeton, October 4, 2007

Introduction to Quantum Algorithms Based on Group Representations
Workshop "Group Representations & Combinatorics", Mathematics Department, University of Florida, September 10 - 14, 2007

Quantum Algorithm for Identifying Hidden Polynomial Function Graphs
First Joint International Meeting between the AMS and the Polish Mathematical Society, University of Warsaw, Poland, July 31 - August 3, 2007

A PromiseBQP-complete String Rewriting Problem
Computational Complexity of Quantum Hamiltonian Systems, Lorentz Center, Leiden University, Holland, July 23 - 27, 2007

Quantum Algorithm for Identifying Hidden Polynomial Function Graphs
Workshop in Quantum Algorithms and Applications, Sydney, Australia, May 27 - June 2, 2007

Quantum Algorithm for Identifying Hidden Polynomial Function Graphs
Institute for Quantum Information, California Institute of Technology, May 22, 2007

Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem
24th International Symposium on Theoretical Aspects of Computer Science , Aachen, Germany, February 22 - 24, 2007

The Jones Polynomial: Quantum Algorithms and Application to Quantum Complexity Theory
Seminar Combinatorial Theory at the Euler Institute for Discrete Mathematics and its Applications, Department of Computer Science and Mathematics, Eidhoven Technical University, November 2006

Complexity of Hamiltonian Problems
IBM T. J. Watson Research Center, Yorktown Heights, New York, July 2006

Quantum Algorithms, Quantum Complexity Theory and Their Connection to the Jones Polynomial
Topology Seminar, Department of Mathematics, University of California, Santa Barbara, February, 2006

On the Quantum Hardness of Solving Isomorphism Problems as Nonabelian Hidden Shift Problems
IQI Seminar, Institute for Quantum Information, California Institute of Technology, November, 2005
slides in pdf-format

Introduction to Quantum Information Processing
Department of Computer and Information Science and Engineering, University of Florida, March, 2005
slides in pdf-format

Mutually Unbiased Bases
Algebra Seminar organized by P. H. Tiep , Department of Mathematics, University of Florida , March, 2005

Limitations of Nice Mutually Unbiased Bases
Combinatorics Seminar organized by Rick Wilson , Department of Mathematics, California Institute of Technology , January, 2005

Eulerian Orthogonal Arrays
Combinatorics Seminar organized by Rick Wilson , Department of Mathematics, California Institute of Technology , November, 2004

New Construction of Mutually Unbiased Bases in Square Dimensions
Combinatorics Seminar organized by Rick Wilson , Department of Mathematics, California Institute of Technology , October, 2004

PSPACE-hardness of Measuring Local Observables and Estimating Mixing Properties of Local Hamiltonian Dynamics and Quantum Random Walks
University of Innsbruck, Austria, February, 2004; University of Bristol, and Imperial College, London, UK, March, 2004

Computational Power of Hamiltonians in Quantum Computing
Institute for Scientific Interchange Foundation, Torino, Italy, September, 2003

Application of Simulation of Hamiltonians in Adiabatic Quantum Computing
Institute for Quantum Information, California Institute of Technology, April, 2003

Complexity of Mutual Simulation of Hamiltonian Dynamics
Ludwig-Maximilian University, Munich, Germany, July, 2002

Mutual Simulation of Hamiltonian Dynamics on Interacting Quantum Systems
DFG-Kolloqium im Schwerpunktprogramm Quanteninformationsverarbeitung, Bad Honnef, Germany, January, 2002

Algorithme de Brill-Noether Applique aux Courbes Reduites
Journees de Calcul Formel, CIRM, Luminy, France, October 1998


last updated: 05/02/12

Back to main page