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 adv...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.展开更多
基金National Key R&D Program of China(Grant No.2017YFB0802400)National Natural Science Foundation of China(Grant Nos.61373171 and 11801564)+2 种基金Program for Excellent Young Talents in University of Anhui Province,China(Grant No.gxyq ZD2019060)Basic Research Project of Natural Science of Shaanxi Province,China(Grant Nos.2017JM6037 and 2017JQ1032)Key Project of Science Research of Anhui Province,China(Grant No.KJ2017A519)。
文摘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.
