Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Physics Letters

Fault-Tolerate Three-Party Quantum Secret Sharing over a Collective-Noise Channel

Chunyan Li, Yansong Li

Published Feb 1, 2011• 13 citations
Publisher

Abstract

We present a fault-tolerate three-party quantum secret sharing (QSS) scheme over a collective-noise channel. Decoherence-free subspaces are used to tolerate two noise modes, a collective-dephasing channel and a collective-rotating channel, respectively. In this scheme, the boss uses two physical qubits to construct a logical qubit which acts as a quantum channel to transmit one bit information to her two agents. The agents can get the information of the private key established by the boss only if they collaborate. The boss Alice encodes information with two unitary operations. Only single-photon measurements are required to rebuilt Alice's information and detect the security by the agents Bob and Charlie, not Bell-state measurements. Moreover, Almost all of the photons are used to distribute information, and its success efficiency approaches 100% in theory.

DOI
10.1088/0256-307x/28/2/020304

Related papers

Efficient Three-Party Quantum Secret Sharing with Single Photons

Ping Zhou, Xihan Li, Deng Fu-Guo +1 more

A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett–Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.

Chinese Physics Letters•Jul 26, 2007•26 citations

EFFICIENT FAULT-TOLERANT QUANTUM SECRET SHARING OVER TWO COLLECTIVE-NOISE CHANNELS

Xiao-jiao Duan, RIFENG ZHOU, Xihan Li

Based on the quantum key distribution protocol [X. H. Li, F. G. Deng and H. Y. Zhou, Phys. Rev. A78 (2008) 022321], we proposed two efficient fault-tolerant quantum secret sharing schemes over two collective-noise channels, in which the sharers can establish a key with the sender only if all the sharers collaborate together. Noiseless subspaces are composed of two Bell states based on the hypothesis of collective noise and the spatial degree of freedom is introduced to insure the security. Although entangled states are used to encode the key bits, the sharers are only required to perform single-particle product operations or single-particle product measurement, making the schemes convenient with current technique. As there is no basis mismatch during the measurement, almost all of the samples can be used to share the key.

International Journal of Quantum Information•Dec 1, 2010•4 citations

FAULT-TOLERATE QUANTUM KEY DISTRIBUTION OVER A COLLECTIVE-NOISE CHANNEL

Chunyan Li, Yansong Li

We present two quantum key distribution (QKD) schemes over a collective-noise channel. Each logical qubit, composed of two physical qubits with a decoherence-free subspace, is immune to a collective noise and can carry one bit of information in theory. Although the receiver should prepare entangled two-photon quantum systems, he can read out the information encoded by the sender with two unitary operations on two photons, resorting to only two single-photon measurements, not Bell-state measurements, which makes these protocols simpler than others in experiment. These two QKD protocols are deterministic, not random, which makes the classical information exchanged be reduced largely. Also, they have a high intrinsic efficiency.

International Journal of Quantum Information•Oct 1, 2010•14 citations

High-capacity three-party quantum secret sharing with superdense coding

Bin Gu, Li Chuan-Qi, Xu Fei +1 more

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 2lb d bits of information, and almost all the pairs can be used for carrying useful information.

Chinese Physics B•Nov 1, 2009•35 citations

Fault-tolerant quantum secret sharing against collective noise

Yu‐Guang Yang, Yi-Wei Teng, Hai-Ping Chai +1 more

We present two robust quantum secret sharing protocols against two kinds of collective noise with single logical qubits. Each logical qubit is encoded in two-qubit noiseless states and so it can function over a quantum channel subjected to a collective noise. The safety of transmission is ensured by nonorthogonality of the noiseless states traveling forward and backward on the quantum channel. Moreover, we construct efficient quantum circuits to implement channel encoding and information encoding by means of primitive operations in quantum computation.

Physica Scripta•Jan 14, 2011•35 citations

FAULT TOLERANT QUANTUM KEY DISTRIBUTION BASED ON QUANTUM DENSE CODING WITH COLLECTIVE NOISE

Xihan Li, Bao‐Kui Zhao, Yu‐Bo Sheng +2 more

We present two robust quantum key distribution protocols against two kinds of collective noise, following some ideas in quantum dense coding. Three-qubit entangled states are used as quantum information carriers, two of which form the logical qubit, which is invariant with a special type of collective noise. The information is encoded on logical qubits with four unitary operations, which can be read out faithfully with Bell-state analysis on two physical qubits and a single-photon measurement on the other physical qubit, not three-photon joint measurements. Two bits of information are exchanged faithfully and securely by transmitting two physical qubits through a noisy channel. When the losses in the noisy channel is low, these protocols can be used to transmit a secret message directly in principle.

arXiv:0904.0056•International Journal of Quantum Information•Dec 1, 2009•73 citations
We present a fault-tolerate three-party quantum secret sharing (QSS) scheme over a collective-noise channel. Decoherence-free subspaces are used to tolerate two noise modes, a collective-dephasing channel and a collective-rotating channel, respectively. In this scheme, the boss uses two physical qubits to construct a logical qubit which acts as a quantum channel to transmit one bit information to her two agents. The agents can get the information of the private key established by the boss only if they collaborate. The boss Alice encodes information with two unitary operations. Only single-photon measurements are required to rebuilt Alice's information and detect the security by the agents Bob and Charlie, not Bell-state measurements. Moreover, Almost all of the photons are used to distribute information, and its success efficiency approaches 100% in theory.
A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett–Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.
Based on the quantum key distribution protocol [X. H. Li, F. G. Deng and H. Y. Zhou, Phys. Rev. A78 (2008) 022321], we proposed two efficient fault-tolerant quantum secret sharing schemes over two collective-noise channels, in which the sharers can establish a key with the sender only if all the sharers collaborate together. Noiseless subspaces are composed of two Bell states based on the hypothesis of collective noise and the spatial degree of freedom is introduced to insure the security. Although entangled states are used to encode the key bits, the sharers are only required to perform single-particle product operations or single-particle product measurement, making the schemes convenient with current technique. As there is no basis mismatch during the measurement, almost all of the samples can be used to share the key.
We present two quantum key distribution (QKD) schemes over a collective-noise channel. Each logical qubit, composed of two physical qubits with a decoherence-free subspace, is immune to a collective noise and can carry one bit of information in theory. Although the receiver should prepare entangled two-photon quantum systems, he can read out the information encoded by the sender with two unitary operations on two photons, resorting to only two single-photon measurements, not Bell-state measurements, which makes these protocols simpler than others in experiment. These two QKD protocols are deterministic, not random, which makes the classical information exchanged be reduced largely. Also, they have a high intrinsic efficiency.
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 2lb d bits of information, and almost all the pairs can be used for carrying useful information.
We present two robust quantum secret sharing protocols against two kinds of collective noise with single logical qubits. Each logical qubit is encoded in two-qubit noiseless states and so it can function over a quantum channel subjected to a collective noise. The safety of transmission is ensured by nonorthogonality of the noiseless states traveling forward and backward on the quantum channel. Moreover, we construct efficient quantum circuits to implement channel encoding and information encoding by means of primitive operations in quantum computation.
We present two robust quantum key distribution protocols against two kinds of collective noise, following some ideas in quantum dense coding. Three-qubit entangled states are used as quantum information carriers, two of which form the logical qubit, which is invariant with a special type of collective noise. The information is encoded on logical qubits with four unitary operations, which can be read out faithfully with Bell-state analysis on two physical qubits and a single-photon measurement on the other physical qubit, not three-photon joint measurements. Two bits of information are exchanged faithfully and securely by transmitting two physical qubits through a noisy channel. When the losses in the noisy channel is low, these protocols can be used to transmit a secret message directly in principle.