Quantum scheme for secret sharing based on local distinguishability
Quantum scheme for secret sharing based on local distinguishability
复制标题
DOI：
10.1103/physreva.91.022330
复制
发表时间：
2015-02-20
影响因子：
2.9
通讯作者：
Parker, Matthew G.
中科院分区：
文献类型：
--
作者：
Rahaman, Ramij;Parker, Matthew G.
本文分析了正交多体纠缠态在受限局域操作和经典通信条件下的精确纠缠的可能性。在此基础上，我们提出了一个量子秘密共享方案（我们称之为LOCC-QSS）。我们的LOCC-QSS计划是相当普遍和成本效益相比，其他计划。在我们的方案中，不需要联合量子操作来重建秘密。我们还提出了一个有趣的（2，n）-阈值LOCC-QSS方案，其中任何两个合作的球员，一个从两个不相交的球员组，总是可以重建的秘密。这种LOCC-QSS方案是非常罕见的，因为大多数（k，n）门限量子秘密共享方案都有限制k >=倒右正交n/2倒左正交。
In this paper, we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis, we propose a quantum secret sharing scheme (which we call LOCC-QSS). Our LOCC-QSS scheme is quite general and cost efficient compared to other schemes. In our scheme, no joint quantum operation is needed to reconstruct the secret. We also present an interesting (2, n)-threshold LOCC-QSS scheme, where any two cooperating players, one from each of two disjoint groups of players, can always reconstruct the secret. This LOCC-QSS scheme is quite uncommon, as most (k, n)-threshold quantum secret sharing schemes have the restriction k >= inverted right perpendicularn/2inverted left perpendicular.