Mike Geller, University of Georgia
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. A natural generalization of constraint satisfaction problems to the quantum setting is the local Hamiltonian problem, which is of significant interest to both complexity theorists and to physicists studying properties of physical systems alike. In this talk, we define a natural approximation version of the local Hamiltonian problem and initiate its study. We present two main results.
Kristan Temme and Maris Ozols will be speaking at this Physics lunch seminar.
Mike Thewalt, Simon Fraser University
Patrick Hayden, McGill
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny (a.k.a. algebraic map) between them, but finding such an isogeny is believed to be computationally difficult. The fastest known classical algorithm for this problem requires exponential time, and prior to our work no faster quantum algorithm was known. We show that this problem can be solved in subexponential time on a quantum computer, assuming the
Robert Raussendorf, University of British Columbia
Yutaka Shikano, Tokyo Institute of Technology & Paul Skrzypczyk, University of Bristol
Thomas Jennewein, IQC
Mark Wilde, McGill University