Abstract
Quantum secret sharing schemes, as multi-user quantum communication protocols, have been extensively studied in fiber-optic channels but remain underdeveloped in free-space environments. To address this gap, we propose a graph-based Hamiltonian path approach for free-space quantum secret sharing scheme that uses graph theory and a decentralized architecture to determine the communication link of the system. We model users as nodes and link distances as weighted edges in a fully connected graph to identify the shortest Hamiltonian Paths, which is the shortest path for full traversal, as the communication transmission paths by combinatorial path algorithms. Our paper provides a theoretical foundation and path selection methodology for multi-user free-space quantum secret sharing. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2026.
| Original language | English |
|---|---|
| Article number | 124 |
| Journal | Quantum Information Processing |
| Volume | 25 |
| Issue number | 4 |
| Online published | 31 Mar 2026 |
| DOIs | |
| Publication status | Published - Apr 2026 |
| Externally published | Yes |
Funding
We would like to thank the anonymous referees for their constructive suggestions. This work is supported by the Key Program of the Ye Qisun Science Foundation, National Natural Science Foundation of China (Grant No. U2441219), and the Hunan Provincial Science and Technology Innovation Program Project (Project No. 2022GK2016).
Research Keywords
- Continuous-variable
- Decentralized
- Free-space
- Graph theory
- Path selection
- Quantum secret sharing
Fingerprint
Dive into the research topics of 'Graph-based Hamiltonian path approach for free-space quantum secret sharing scheme'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver