【上午九点】波士顿大学张佳瑜博士：Succinct blind quantum computation using a...
在线直播二维码
主题：Succinct blind quantum computation using a random oracle
主讲人：张佳瑜 博士
单位：Boston University
主办方：鹏城实验室量子计算研究中心
报告摘要
In the universal blind quantum computation problem, a client wants to make use of a single quantum server to evaluate C|0>where C is an arbitrary quantum circuit while keeping C secret. The client’s goal is to use as few resources as possible. This problem, first raised by Broadbent, Fitzsimons and Kashefi, has become fundamental to the study of quantum cryptography, not only because of its own importance, but also because it provides a testbed for new techniques that can be later applied to related problems (for example, quantum computation verification). Known protocols on this problem are mainly either information-theoretically (IT) secure or based on trapdoor assumptions (public key encryptions). In this paper we study how the availability of symmetric-key primitives, modeled by a random oracle, changes the complexity of universal blind quantum computation. We give a new universal blind quantum computation protocol. Similar to previous works on IT-secure protocols (for example, BFK), our protocol can be divided into two phases. In the first phase the client prepares some quantum gadgets with relatively simple quantum gates and sends them to the server, and in the second phase the client is entirely classical — it does not even need quantum storage. Crucially, the protocol’s first phase is succinct, that is, its complexity is independent of the circuit size. Given the security parameter κ, its complexity is only a fixed polynomial of κ, and can be used to evaluate any circuit (or several circuits) of size up to a subexponential of κ. In contrast, known schemes either require the client to perform quantum computations that scale with the size of the circuit, or require trapdoor assumptions.
主讲人介绍
为满足更多科研工作者的需求，蔻享平台开通了各科研领域的微信交流群。进群请添加微信18256943123（备注您的科研方向）小编拉您入群哟！
欢迎大家提供各类学术会议或学术报告信息，以便广大科研人员参与交流学习。