.png){kind=icon}
Return
Quantum Secure Multiparty Computation with Symmetric Boolean Functions
.png){kind=icon}
PRE
AI
DOI：10.1088/0256-307X/37/5/050303.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
03
67
Ac
03
67
Dd
42
50
Dv
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
9.1K
Citations:
7.7K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
no more
no more