THIS SITE

Information for

Events

Monday, April 30, 2012 — 12:30 PM to 1:30 PM EDT

Oleg Gittsovich, Institute for Quantum Computing (IQC)

Thursday, April 26, 2012 — 12:00 PM to 1:00 PM EDT
Tuesday, April 24, 2012 — 12:00 PM to 1:00 PM EDT

Igor Markov, University of Michigan

Tuesday, April 24, 2012 — 9:00 AM to 10:00 AM EDT

A Q+ hangout is a broadcast seminar using the hangout feature of Google+

Jonathan Oppenheim, University College London

Title: Fundamental limitations for quantum and nano thermodynamics

Monday, April 23, 2012 — 12:30 PM to 1:30 PM EDT

Antonio Corcoles, IBM

Thursday, April 19, 2012 — 12:00 PM to 1:00 PM EDT

Marcos Cesar de Oliveira, University of Calgary

Tuesday, April 17, 2012 — 12:00 AM to 1:00 PM EDT

Leonard Schulman, California Institute of Technology

Abstract

We describe a new cryptosystem which (conjecturally) provides both a
trap-door one-way function and a signature scheme. The new system is a
type of "multivariate quadratic" cryptosystem, but is based on a
different trap-door from existing methods, and is simpler.

Monday, April 16, 2012 — 12:30 PM to 1:30 PM EDT

David Kaiser, Massachusetts Institute of Technology (MIT)

Wednesday, April 11, 2012 — 12:00 AM to Friday, April 13, 2012 — 1:00 AM EDT

One of the main goals of Quantum Computation is to design novel methods for speeding up computations by taking advantage of the surprising effects of quantum mechanics. Many powerful quantum algorithms have been discovered over the last decade, yet a large number of them derive their power from a handful of ingredients.

Tuesday, April 10, 2012 — 12:00 PM to 1:00 PM EDT

Internal Speaker, Institute for Quantum Computing (IQC)

Abstract

Abstract to be announced.

Monday, April 9, 2012 — 12:30 PM to 1:00 PM EDT

Aram Harrow, University of Washington

Abstract

This talk will begin by justifying the first part of the title, by explaining a method to test whether a given multipartite pure state is product or far from product, given only two copies of the state. Next, I'll explain how this test has implications for the computational hardness of a large number of optimization problems.

Thursday, April 5, 2012 — 12:00 PM to 1:00 PM EDT

Abstract

Abstract to be announced.

Tuesday, April 3, 2012 — 12:00 PM to 1:00 PM EDT

Internal Speaker, Institute for Quantum Computing (IQC)

Abstract

Abstract to be announced.

S M T W T F S
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
1
2
3
4
5
  1. 2018 (123)
    1. December (1)
    2. November (2)
    3. October (10)
    4. September (10)
    5. August (10)
    6. July (11)
    7. June (9)
    8. May (13)
    9. April (16)
    10. March (17)
    11. February (14)
    12. 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)
    1. December (6)
    2. November (10)
    3. October (9)
    4. September (8)
    5. August (9)
    6. July (11)
    7. June (16)
    8. May (6)
    9. April (14)
    10. March (9)
    11. February (10)
    12. January (18)
  8. 2011 (117)
  9. 2010 (41)
  10. 2009 (4)
  11. 2008 (1)
  12. 2007 (1)
  13. 2005 (1)
  14. 2004 (3)