.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
03
67
Ac
03
67
Dd
42
50
Dv
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
9.1K
被引数:
7.7K
机构
引用论文
.png){kind=icon}
Quantum private query: A new kind of practical quantum cryptographic protocol量子私有查询: 一种新型实用的量子密码协议
PREAI
分享收藏
没有更多内容
没有更多内容