log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Quantum Advantage Without Speed-Ups
Alexander Poremba - MIT
Wednesday, October 4, 2023, 11:00 am-12:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

Quantum cryptography leverages unique features of quantum mechanics in order to construct cryptographic primitives which are oftentimes impossible for digital computers. Cryptographic applications of quantum computers therefore have the potential for useful quantum advantage – entirely without computational speed-ups. In this talk, I will focus on two fundamental questions: First, is it possible to certify that private data has been deleted? And second, is it possible to revoke a cryptographic key? I show how quantum computers can answer these questions affirmatively through the use of lattice-based cryptography; in particular, by making use of Gaussian superpositions over lattices.

Join Zoom Meeting

https://umd.zoom.us/j/94964523987?pwd=dDM1Z0dPbWtSc0dDbUdrRkFmSmJjdz09

Meeting ID: 949 6452 3987

Passcode: 996869

One tap mobile

+13017158592,,94964523987#,,,,*996869# US (Washington DC)

+16469313860,,94964523987#,,,,*996869# US

Dial by your location

• +1 301 715 8592 US (Washington DC)

• +1 646 931 3860 US

• +1 929 436 2866 US (New York)

• +1 305 224 1968 US

• +1 309 205 3325 US

• +1 312 626 6799 US (Chicago)

• +1 669 900 6833 US (San Jose)

• +1 689 278 1000 US

• +1 719 359 4580 US

• +1 253 205 0468 US

• +1 253 215 8782 US (Tacoma)

• +1 346 248 7799 US (Houston)

• +1 360 209 5623 US

• +1 386 347 5053 US

• +1 507 473 4847 US

• +1 564 217 2000 US

• +1 669 444 9171 US

Meeting ID: 949 6452 3987

Passcode: 996869

*We strongly encourage attendees to use their full name (and if possible, their UMD credentials) to join the zoom session.*

This talk is organized by Andrea F. Svejda