Quantum Secure Multiparty Computation with Symmetric Boolean Functions
Hao Cao1,2, Wenping Ma3**, Ge Liu3, Liangdong Lü3,4, Zheng-Yuan Xue5,6**
1Anhui Province Key Laboratory of Animal Nutritional Regulation and Health, School of Information and Network Engineering, Anhui Science and Technology University, Fengyang 233100 2School of Mathematical Science, Huaibei Normal University, Huaibei 235000 3State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071 4Department of Basic Sciences, Air Force Engineering University, Xi'an 710071 5Guangdong Provincial Key Laboratory of Quantum Engineering and Quantum Materials, and School of Physics and Telecommunication Engineering, South China Normal University, Guangzhou 510006 6Frontier Research Institute for Physics, South China Normal University, Guangzhou 510006
Abstract：We propose a class of $n$-variable Boolean functions which can be used to implement quantum secure multiparty computation. We also give an implementation of a special quantum secure multiparty computation protocol. An advantage of our protocol is that only 1 qubit is needed to compute the $n$-tuple pairwise AND function, which is more efficient comparing with previous protocols. We demonstrate our protocol on the IBM quantum cloud platform, with a probability of correct output as high as 94.63%. Therefore, our protocol presents a promising generalization in realization of various secure multipartite quantum tasks.
2020, Vol. 37 
