BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Kai-Min Chung (Institute of Information Science\, Acedemia Sinica\
 , Taiwan)
DTSTART:20200602T010000Z
DTEND:20200602T020000Z
DTSTAMP:20260423T010102Z
UID:UTSQSI/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/UTSQSI/3/">H
 ow well can a classical client delegate quantum computation?</a>\nby Kai-M
 in Chung (Institute of Information Science\, Acedemia Sinica\, Taiwan) as 
 part of Centre for Quantum Software and Information Seminar Series\n\n\nAb
 stract\nIn a recent breakthrough\, Mahadev (FOCS 2018) constructed the fir
 st classical verification of quantum computation (CVQC) protocol that allo
 ws a classical client to delegate the computation of a BQP language (i.e.\
 , a decision problem) to an efficient quantum server.\n\nIn this talk\, we
  present several generalizations of Mahadev’s work. In particular\, we i
 nitiate the study of CVQC protocols for quantum *sampling* problems and co
 nstruct the first such protocol that allows a classical client to verifiab
 ly obtain a sample drawn from a quantum computation from a quantum server.
  We also construct the first protocol with efficient verification\, i.e.\,
  the client’s runtime can be sublinear in the quantum time complexity of
  the delegated computation. Finally\, we present a generic compiler that c
 ompiles any CVQC protocol to achieve blindness\, i.e.\, the server learns 
 nothing about the client’s input\, which leads to the first constant-rou
 nd blind CVQC protocol.\n\nBased on joint works with Nai-Hui Chia\, Takash
 i Yamakawa\, Yi Lee\, Han-Husan Lin\, and Xiaodi Wu\n\nHosted by Prof Zhen
 gfeng Ji\, UTS Centre for Quantum Software and Information.\n
LOCATION:https://researchseminars.org/talk/UTSQSI/3/
END:VEVENT
END:VCALENDAR