Name
Title | ||
|---|---|---|
Searching for optimal quantum secret sharing scheme based on local distinguishability. |
Abstract | ||
|---|---|---|
The (k, n)-threshold quantum secret sharing scheme is an important and difficult field in quantum information processing and quantum cryptography. In this paper, the (k, n)-threshold quantum secret sharing scheme based on local operations and classical communication (LOCC-QSS) is investigated. Firstly, in order to effectively study the LOCC-QSS scheme, digital and graphical representations of judgement space are introduced creatively. These representations are simple and convenient. Secondly, an algorithm is designed to search optional states for any given k and n. For optional states, the unambiguous probability equals 0 when x participants cooperate (x<k). Thirdly, a method is proposed to decrease the guessing probability. Some schemes which are more secure than existing ones can be obtained further. Last but not least, the conditions of optimal LOCC-QSS schemes are given for the first time. Our research will be helpful for the development of LOCC-QSS scheme. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s11128-020-02809-z | QUANTUM INFORMATION PROCESSING |
Keywords | DocType | Volume |
Security,Quantum secret sharing,Local distinguishability,Optimal scheme,Searching algorithm | Journal | 19 |
Issue | ISSN | Citations |
10 | 1570-0755 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhao Dou | 1 | 13 | 3.02 |
| Gang Xu | 2 | 36 | 18.66 |
| Xiu-Bo Chen | 3 | 163 | 36.11 |
| Xinxin Niu | 4 | 211 | 33.93 |
| Yixian Yang | 5 | 1121 | 140.62 |
| Yu Yang | 6 | 0 | 0.34 |