Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Graph-based Hamiltonian path approach for free-space quantum secret sharing scheme

  • 期刊论文

  • 发表日期：

    2026年3月31日

查看全文
  • Runsheng Peng,
  • Yijun Wang,
  • Ying Guo,
  • Hang Zhang,
  • Tianyu Wang

摘要

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.