Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to im...Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.展开更多
This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liuet al （2002 Phys. Rev. A 65 022304） and the quantum secret sha...This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liuet 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 Einstei^Podolsky-l^osen 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 21bd bits of information, and almost all the pairs can be used for carrying useful information.展开更多
基金Project supported by the National Natural Science Foundation of China (Grant No. 61072071)
文摘Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.
基金Project supported by the National Natural Science Foundation (NSF) of China (Grant No 10847147)the NSF of Jiangsu Province, China (Grant No BK2008437)+1 种基金Jiangsu Provincial Universities (Grant No 07KJB510066)the Science Foundation of NUIST, China
文摘This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liuet 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 Einstei^Podolsky-l^osen 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 21bd bits of information, and almost all the pairs can be used for carrying useful information.
