Events

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, November 19, 2010 3:30 pm - 4:30 pm EST (GMT -05:00)

David Jao: Constructing Elliptic Curve Isogenies in Quantum Subexponential Time

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

Wednesday, December 8, 2010 2:00 pm - 4:00 pm EST (GMT -05:00)

David Cory: From Quantum Parlor Tricks to Quantum Computing

David Cory, Institute for Quantum Computing

Abstract

In RAC II at the Institute for Quantum Computing we are setting up a laboratory of test-beds for quantum information processing. I will describe the range of test-beds, what each offers for the development of quantum processors and where we are on the path towards a non-trivial quantum processor.