BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:3f6577d2-a042-4edd-9ea7-accdc0db3199
X-WR-CALNAME:[ICQ] Samuel Ducharme (Université de Montréal) Verification of
  quantum computations for oracle problems
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20271031T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20251026T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20261025T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20250330T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20260329T020000
RDATE:20270328T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:3f6577d2-a042-4edd-9ea7-accdc0db3199
DTSTAMP:20260404T172608Z
CLASS:PUBLIC
DESCRIPTION:We could expect the first large-scale fault-tolerant quantum co
 mputers to be few in number and only accessible to the masses via some sor
 t of cloud service\, where users would send computing tasks to remote quan
 tum computers. Under the common belief that quantum computers will be more
  powerful than classical ones (i.e.\, that BPP is strictly contained in BQ
 P)\, this raises the following question : if a quantum computer can effici
 ently perform a computation that a classical computer cannot\, can the cla
 ssical computer at least efficiently verify its result? Over the years\, m
 any techniques have been developed to make delegated quantum computations 
 verifiable classically\, using interaction and various assumptions. Notabl
 e examples include the protocols of Aharonov\, Ben-Or\, Eban and Mahadev (
  [ https://arxiv.org/abs/1704.04487 | https://arxiv.org/abs/1704.04487 ] )
 \, Broadbent\, Fitzsimons and Kashefi ( [ https://arxiv.org/abs/0807.4154 
 | https://arxiv.org/abs/0807.4154 ] )\, and Mahadev ( [ https://arxiv.org/
 abs/1804.01082 | https://arxiv.org/abs/1804.01082 ] ). However\, none of t
 hese techniques are known to relativize to oracle problems\, some of which
  provably separate BPP and BQP and aren't trivially verifiable by a classi
 cal agent. \n\nIn this talk\, I will introduce the first ever protocols fo
 r some of these oracle problems\, namely Simon's problem and the Forrelati
 on problem\, by adapting known verification techniques in novel ways. I wi
 ll also discuss the possibility of the existence of an oracle problem that
  is efficiently solvable by a quantum computer\, but for which there could
 n't exist a verification protocol between a quantum prover and a classical
  verifier. This talk is based on results from my PhD thesis\, which are ye
 t unpublished. \n\n\n\nhttps://combalgo.labri.fr/pmwiki.php/Groupe/Info-Qu
 antique\n\nImport automatique depuis https://webmel.u-bordeaux.fr/home/bf-
 labri.ca@u-bordeaux.fr/gt.info-quantique.ics par sync_icals_to_drupal.py p
 our gt-iq
DTSTART;TZID=Europe/Paris:20260225T143000
DTEND;TZID=Europe/Paris:20260225T153000
LOCATION:On Zoom
SEQUENCE:0
SUMMARY:[ICQ] Samuel Ducharme (Université de Montréal) Verification of quan
 tum computations for oracle problems
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
