THIS SITE

Information for

Events

Tuesday, December 21, 2010 — 12:00 PM to 1:00 PM EST

James Wootton, University of Leeds

Abstract

Abstract to be announced.

Tuesday, December 14, 2010 — 12:00 PM to 1:00 PM EST

Thomas Vidick, University of California, Berkeley

Monday, December 13, 2010 — 12:30 PM to 1:30 PM EST

Osama Moussa, Institute for Quantum Computing

Abstract

Abstract to be announced.

Thursday, December 9, 2010 — 1:00 PM to 2:30 PM EST

Olaf Benningshof, Universiteit Leiden

Wednesday, December 8, 2010 — 2:00 PM to 4:00 PM EST

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.

Tuesday, December 7, 2010 — 11:00 AM to 12:00 PM EST

Christophe Couteau, L’Université de technologie de Troyes

Thursday, December 2, 2010 — 12:00 PM to 1:00 PM EST

Jacob Biamonte, Oxford University

Tuesday, November 30, 2010 — 12:00 PM to 1:00 PM EST

Andrew Childs, Institute for Quantum Computing

Monday, November 29, 2010 — 12:30 PM to 1:30 PM EST

Mark Wilde, McGill University

Thursday, November 25, 2010 — 4:00 PM to 5:00 PM EST

Thomas Jennewein, IQC

Thursday, November 25, 2010 — 12:00 PM to 1:00 PM EST

Yutaka Shikano, Tokyo Institute of Technology & Paul Skrzypczyk, University of Bristol

Monday, November 22, 2010 — 12:30 PM to 1:30 PM EST

Robert Raussendorf, University of British Columbia

Friday, November 19, 2010 — 3:30 PM to 4:30 PM EST

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

Thursday, November 18, 2010 — 12:00 PM to 1:00 PM EST

IQC/QuantumWorks Joint Seminar Eric Luvisotto and Scott Inwood, Waterloo Commercialization Office (”WatCo”)

Monday, November 15, 2010 — 12:30 PM to 1:30 PM EST

Patrick Hayden, McGill

Thursday, November 11, 2010 — 12:00 PM to 1:00 PM EST

Kristan Temme and Maris Ozols will be speaking at this Physics lunch seminar.

Tuesday, November 9, 2010 — 12:00 PM to 1:00 PM EST

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.

Monday, November 8, 2010 — 12:30 PM to 1:30 PM EST

Mike Geller, University of Georgia

Thursday, November 4, 2010 — 12:00 PM to 1:00 PM EDT

Seth Lloyd, Massachusetts Institute of Technology

Tuesday, November 2, 2010 — 12:00 PM to 1:00 PM EDT

Falk Unger, University of California, Berkeley

Monday, November 1, 2010 — 12:30 PM to 1:30 PM EDT

Todd Pittman, University of Maryland, Baltimore County

Monday, October 25, 2010 — 12:30 PM to 1:30 PM EDT

Britton Plourde, Syracuse University

Tuesday, October 19, 2010 — 12:00 PM to 1:00 PM EDT

Nathan Wiebe, University of Calgary

We introduce an efficient quantum algorithm for simulating time-dependent Hamiltonian quantum dynamics on a quantum computer and accounts fully for all computational resources, especially the per-qubit oracle query cost, which has been previously regarded as constant cost per query regardless of the number of qubits accessed.

Monday, October 18, 2010 — 12:30 PM to 1:30 PM EDT

Adrian Lupascu, Institute for Quantum Computing

Quantum superconducting circuits are nanostructured superconducting electrical networks with Josephson junctions. At low temperatures, their quantum dynamics is properly described by using a few degrees of freedom with a collective character. The parameters in the Hamiltonian depend on the dimensions and topology of the circuit; superconducting quantum circuits therefore behave as artificial atoms.

Pages

S M T W T F S
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
6
  1. 2018 (92)
    1. October (1)
    2. September (1)
    3. August (1)
    4. July (9)
    5. June (9)
    6. May (12)
    7. April (16)
    8. March (17)
    9. February (14)
    10. January (13)
  2. 2017 (135)
    1. December (13)
    2. November (7)
    3. October (11)
    4. September (14)
    5. August (11)
    6. July (8)
    7. June (12)
    8. May (9)
    9. April (13)
    10. March (13)
    11. February (18)
    12. January (7)
  3. 2016 (94)
  4. 2015 (85)
  5. 2014 (97)
  6. 2013 (92)
  7. 2012 (125)
  8. 2011 (117)
  9. 2010 (41)
    1. December (7)
    2. November (15)
    3. October (4)
    4. September (5)
    5. August (3)
    6. July (3)
    7. June (3)
    8. May (2)
  10. 2009 (4)
  11. 2008 (1)
  12. 2007 (1)
  13. 2005 (1)
  14. 2004 (3)