BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium: Testing quantum systems in the high-complexity regi
 me
DTSTART:20220314T100000
DTEND:20220314T110000
DTSTAMP:20260407T074517Z
UID:ced2abb475a8553980f9330ba2913e793767a8aa68f4b3fd5bd14bad
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Thomas Vidick - California Institute of Technology\n\nAbst
 ract\nFrom carefully crafted quantum algorithms to information-theoretic s
 ecurity in cryptography\, a quantum computer can achieve impressive feats 
 with no classical analogue. Can their correct realization be verified? Whe
 n the power of the device greatly surpasses that of the user\, what means 
 of control remain available to the user?\n\nIn the talk I will describe my
  work providing solutions to this question in two different settings. Firs
 t we will discuss the model of quantum multiprover interactive proof syste
 ms\, which provides a complexity-theoretic framework for the familiar sett
 ing of Bell inequalities from Physics. I will describe how a combination o
 f classical techniques\, such as the PCP theorem\, and insights unique to 
 quantum computing\, such as the uncertainty principle\, lead to protocols 
 for testing randomness\, entanglement\, and quantum computations.\n\nIn th
 e second part of the talk I will focus on a more recent model where testin
 g is done under a post-quantum computational assumption. We will show how 
 a hardness assumption can serve as an effective "classical leash" on a pow
 erful quantum system.\n\nThe two most relevant publications for the talk a
 re arXiv:2001.04383 and arXiv:1804.00640.\n\nFor anyone interested in broa
 der-audience accounts\, I can suggest:\n* An article I wrote for the notic
 es of the AMS in 2019\, which motivates the study of quantum multiprover i
 nteractive proofs from a mathematical (operator algebras) angle:\nhttps://
 www.ams.org/journals/notices/201910/rnoti-p1618.pdf\n* An article publishe
 d in the Bulletin of the AMS on the topic of the second part of the talk\,
  verification under computational assumptions:\nhttp://users.cms.caltech.e
 du/~vidick/notes/verification_bulletin.pdf.\nThomas Vidick is Professor of
  Computing and Mathematical Sciences at the California Institute of Techno
 logy. He received a B.A.\nin pure mathematics from École Normale Supérie
 ure in Paris\, a Masters in Computer Science from Université Paris 7 and 
 a Ph.D. from UC Berkeley.\nHis Ph.D. thesis was awarded the Bernard Friedm
 an memorial prize in applied mathematics. Before joining Caltech he was a 
 postdoctoral associate at the Massachusetts Institute of Technology. His p
 aper “A multi-prover interactive proof for NEXP sound against entangled 
 provers”\, with Tsuyoshi Ito\, was co-awarded the best paper award at FO
 CS’12. His is the recipient of a Presidential Early-Career Award (PECASE
 \, 2019)\, an FSMP research chair (2020) and a Simons Investigator Award (
 2021-).\n\nVidick's research is situated at the interface of theoretical c
 omputer science\, quantum information and cryptography. He is interested i
 n applying techniques from computer science\, such as complexity theory\, 
 to study problems in quantum computing. He is most well-known for his work
  on the study of entanglement in interactive proof systems\, through the c
 omplexity class MIP*. He made multiple contributions to quantum cryptograp
 hy\, including the first proof of security of device-independent quantum k
 ey distribution. He is also known for developing the first polynomial-time
  algorithm for computing ground states of gapped one-dimensional quantum s
 pin systems.\n\nBio\nThomas Vidick is Professor of Computing and Mathemati
 cal Sciences at the California Institute of Technology. He received a B.A.
 \nin pure mathematics from École Normale Supérieure in Paris\, a Masters
  in Computer Science from Université Paris 7 and a Ph.D. from UC Berkeley
 .\nHis Ph.D. thesis was awarded the Bernard Friedman memorial prize in app
 lied mathematics. Before joining Caltech he was a postdoctoral associate a
 t the Massachusetts Institute of Technology. His paper “A multi-prover i
 nteractive proof for NEXP sound against entangled provers”\, with Tsuyos
 hi Ito\, was co-awarded the best paper award at FOCS’12. His is the reci
 pient of a Presidential Early-Career Award (PECASE\, 2019)\, an FSMP resea
 rch chair (2020) and a Simons Investigator Award (2021-).\n\nVidick's rese
 arch is situated at the interface of theoretical computer science\, quantu
 m information and cryptography. He is interested in applying techniques fr
 om computer science\, such as complexity theory\, to study problems in qua
 ntum computing. He is most well-known for his work on the study of entangl
 ement in interactive proof systems\, through the complexity class MIP*. He
  made multiple contributions to quantum cryptography\, including the first
  proof of security of device-independent quantum key distribution. He is a
 lso known for developing the first polynomial-time algorithm for computing
  ground states of gapped one-dimensional quantum spin systems.\n\nMore inf
 ormation
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420 https://epfl.zoom.us/
 j/67927255805?pwd=MTVEYkxCdkdmMks4bDJ0eGJ2UVlzQT09
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR