BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Quantum Computing Seminar
SUMMARY:The Role of piracy in quantum proofs - Alex Grilo 
 (Sorbonne Université)
DTSTART;TZID=Europe/London:20250310T140000
DTEND;TZID=Europe/London:20250310T150000
UID:TALK227752AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/227752
DESCRIPTION:A well-known feature of quantum information is tha
 t it cannot\, in general\, be cloned. Recently\, a
  number of quantum-enabled information-processing 
 tasks have demonstrated various forms of uncloneab
 ility\; among these forms\, piracy is an adversari
 al model that gives maximal power to the adversary
 \, in controlling both a cloning-type attack\, as 
 well as the evaluation/verification stage.\n\nHere
 \, we initiate the study of anti-piracy proof syst
 ems\, which are proof systems that inherently prev
 ent piracy attacks. We define anti-piracy proof sy
 stems\, demonstrate such a proof system for an ora
 cle problem\, and also describe a candidate anti-p
 iracy proof system for NP.\n\nWe also study quantu
 m proof systems that are cloneable and settle the 
 famous QMA vs. QMA(2) debate in this setting. Last
 ly\, we discuss how one can approach the QMA vs. Q
 CMA question by studying its cloneable variants.
LOCATION:Computer Laboratory\, William Gates Building\, Roo
 m SS03
CONTACT:Tom Gur
END:VEVENT
END:VCALENDAR