Filter by:

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 title matches:
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:
Monday, July 27, 2009 12:00 am - Friday, July 31, 2009 12:00 am EDT (GMT -04:00)

Quantum Cryptography School for Young Students 2009 (QCSYS)

Apply for QCSYS and discover how the physics and mathematics of quantum mechanics and cryptography merge into one of the most exciting topics in contemporary science – quantum cryptography.

  • Engage in hands-on experiments and attend lectures
  • Collaborate with renowned researchers
  • Participate in group work and social activities
  • Stay in a university residence with QCSYS counsellor
Thursday, July 14, 2011 6:30 pm - Friday, July 15, 2011 8:30 pm EDT (GMT -04:00)

The Quantum Physics of Harry Potter

Post for The Quantum Physics of Harry Potter From invisibility cloaks to teleportation, Harry Potter’s world is filled with mystery and wonder. Yet this magical world is not so different from the world we inhabit. Just beneath the surface of our ordinary lives is a strange quantum reality.

Tuesday, August 28, 2012 9:00 am - 10:00 am EDT (GMT -04:00)

Francesco Buscemi (Nagoya University): Q+ Hangout

Francesco Buscemi (Nagoya University), Institute for Quantum Computing (IQC)


Title: - All entangled quantum states are nonlocal: equivalence between locality and separability in quantum theory

In this talk I will show how, by slightly modifying the rules of
nonlocal games, one can prove that all entangled states violate local

Monday, March 18, 2013 2:30 pm - 3:30 pm EDT (GMT -04:00)

Dr. Rainer Steinwandt: Quantum circuits for point addition on binary elliptic curves

Dr. Rainer Steinwandt, Florida Atlantic University


Subgroups of elliptic curves over binary fields are a popular mathematical platform to implement cryptographic primitives and protocols. Using Shor's algorithm to tackle the discrete logarithm problem in such groups leads to the question of efficiently implementing the underlying group arithmetic on a quantum computer.