论文标题
恒定的多方量子计算恒定政党
Constant-round Multi-party Quantum Computation for Constant Parties
论文作者
论文摘要
经典密码学的中心主题之一是多方计算，该计算在维护数据隐私的同时，对多个参与者的数据执行联合计算。量子制度的扩展是在2002年提出的，但是尽管进行了二十年的研究，但针对固定数量的当事方（甚至两个当事方）的当前最新多方量子计算协议需要无限的交流，这极大地限制了其实际用途。在这项工作中，我们建议针对固定数量的当事方针对固定数量的对手提出第一个恒定的多方量子计算协议，从而大大减少了所需的回合数量。我们的工作构成了实际实施安全多方量子计算的关键一步，并为从业者打开了这一令人兴奋的领域的大门。我们工作的结果对量子保真度评估，量子机学习，量子投票和分布式量子信息处理具有广泛的影响。
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.
