Quick Navigation
Topics
Quantum Communication Networks
High-capacity dual degrees of freedom quantum secret sharing protocol beyond the linear rate-distance bound
arXiv
Authors: Meng-Dong Zhu, Cheng Zhang, Shi-Pu Gu, Xing-Fu Wang, Ming-Ming Du, Wei Zhong, Lan Zhou, Yu-Bo Sheng
Year
2026
Paper ID
3981
Status
Preprint
Abstract Read
~2 min
Abstract Words
186
Citations
N/A
Abstract
Quantum secret sharing (QSS) is the multipartite cryptographic primitive. Most of existing QSS protocols are limited by the linear rate-distance bound, and cannot realize the long-distance and high-capacity multipartite key distribution. This paper proposes a polarization (Pol) and phase (Ph) dual degrees of freedom (dual-DOF) QSS protocol based on the weak coherent pulse (WCP) sources. Our protocol combines the single-photon interference, two-photon interference and non-interference principles, and can resist the internal attack from the dishonest player. We develop simulation method to estimate its performance under the beam splitting attack. The simulation results show that our protocol can surpass the linear bound. Comparing with the differential-phase-shift twin-field QSS and WCP-Ph-QSS protocols, our protocol has stronger resistance against the beam splitting attack, and thus has longer maximal communication distance and higher key rate. By using the WCPs with high average photon number $μ$ = 1.5, our protocol achieves a key rate about 5.4 times of that in WCP-Ph-QSS protocol. Its maximal communication distance (441.7 km) is about 7.9% longer than that of the WCP-Ph-QSS. Our protocol is highly feasible with current experimental technology and offers a promising approach for long-distance and high-capacity quantum networks.
Why This Paper Matters
- This paper contributes to the Quantum Communication & Networks research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- Quantum secret sharing (QSS) is the multipartite cryptographic primitive.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.