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.
Received: 16 January 2009
Revised: 13 February 2009
Accepted manuscript online:
Fund: Project supported by the National
Natural Science Foundation (NSF) of China (Grant No 10847147), the
NSF of Jiangsu Province, China (Grant No BK2008437) and Jiangsu
Provincial Universities (Grant No 07KJB510066) and the Science
Foundation of NUIST, China.
Cite this article:
Gu Bin(顾斌), Li Chuan-Qi(李传起), Xu Fei(徐飞), and Chen Yu-Lin(陈玉林) High-capacity three-party quantum secret sharing with superdense coding 2009 Chin. Phys. B 18 4690
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
