文献类型：期刊文献

英文题名：Constant-round multi-party quantum computation for constant parties

作者：Cao, Zhu[1,2]

机构：[1] Key Laboratory of Advanced Control and Optimization for Chemical Processes of Ministry of Education, East China University of Science and Technology, Shanghai, 200237, China; [2] Shanghai Institute of Intelligent Science and Technology, Tongji University, Shanghai, 200092, China

年份：2020

外文期刊名：arXiv

收录：EI(收录号：20210001081)

语种：英文

外文关键词：Privacy-preserving techniques - Quantum computers - Quantum cryptography

摘要：One of the central themes in classical cryptography is multi-party computation, which performs joint computation on multiple participants’ data while maintaining data privacy. The extension to the quantum regime was proposed in 2002, but despite two decades of research, the current state-of-the-art multi-party quantum computation protocol for a fixed number of parties (even 2 parties) requires unbounded rounds of communication, which greatly limit its practical usage. In this work, we propose the first constant-round multi-party quantum computation protocol for a fixed number of parties against specious adversaries, thereby significantly reducing the required number of rounds. Our work constitutes a key step towards practical implementation of secure multi-party quantum computation, and opens the door for practitioners to be involved in this exciting field. The result of our work has wide implications to quantum fidelity evaluation, quantum machine learning, quantum voting, and distributed quantum information processing. ? 2020, CC-BY.