High-capacity three-party quantum secret sharing with superdense coding |
| |
| Authors: | Gu Bin Li Chuan-Qi Xu Fei and Chen Yu-Lin |
| |
| Affiliation: | College of Math and Physics, Nanjing University of Information Science and Technology (NUIST), Nanjing 210044, China |
| |
| Abstract: | This paper presents a scheme for high-capacity three-party
quantum secret sharing with quantum superdense coding, following
some ideas in the work by Liu et al (2002 Phys. Rev. A
65 022304) and the quantum secret sharing scheme by Deng
et al (2008 Phys. Lett. A 372 1957). Instead of using
two sets of nonorthogonal states, the boss Alice needs only to
prepare a sequence of Einstein--Podolsky--Rosen pairs in
d-dimension. The two agents Bob and Charlie encode their
information with dense coding unitary operations, and security is
checked by inserting decoy photons. The scheme has a high capacity
and intrinsic efficiency as each pair can carry 2lbd bits of
information, and almost all the pairs can be used for carrying
useful information. |
| |
| Keywords: | quantum secret sharing three-party high-capacity superdense coding |
| 本文献已被 维普 等数据库收录！ |
| 点击此处可从《中国物理 B》浏览原始摘要信息 |
|
点击此处可从《中国物理 B》下载免费的PDF全文 |
|
