Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2508.09445 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913987940057088 |
|---|---|
| author | Liao, Qin Tang, Chong Peng, Qingquan Ding, Chao Zhu, Lingjin Wang, Yijun Fu, Xiquan |
| author_facet | Liao, Qin Tang, Chong Peng, Qingquan Ding, Chao Zhu, Lingjin Wang, Yijun Fu, Xiquan |
| contents | Continuous-variable quantum secret sharing (CVQSS) is a promising approach to ensuring multi-party information security. While CVQSS offers practical ease of implementation, its present performance remains limited. In this paper, we propose a novel CVQSS protocol integrated with a state-discrimination detector (SDD), dubbed SDD-CVQSS. In particular, we first develop the detailed procedure of SDD-CVQSS, which replaces the traditional coherent detector with an SDD and eliminates the long-standing necessary step of establishing multiple point-to-point quantum key distribution links between all users and the dealer. We then elaborate on the principle of the specifically designed SDD, which can efficiently discriminate mixed states with a much lower error probability. Finally, we construct a security model for SDD-CVQSS and derive its security bound against beam-splitting collective attacks. Numerical simulations show that SDD-CVQSS outperforms conventional CVQSS in both maximum transmission distance and secret key rate, even surpassing the PLOB bound. Additionally, we find that the performance degradation of SDD-CVQSS in long-distance transmission scenarios can be effectively compensated for using a post-selection scheme, providing a feasible way to achieve high-performance CVQSS. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_09445 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Surpassing the PLOB bound in continuous-variable quantum secret sharing using a state-discrimination detector Liao, Qin Tang, Chong Peng, Qingquan Ding, Chao Zhu, Lingjin Wang, Yijun Fu, Xiquan Quantum Physics Continuous-variable quantum secret sharing (CVQSS) is a promising approach to ensuring multi-party information security. While CVQSS offers practical ease of implementation, its present performance remains limited. In this paper, we propose a novel CVQSS protocol integrated with a state-discrimination detector (SDD), dubbed SDD-CVQSS. In particular, we first develop the detailed procedure of SDD-CVQSS, which replaces the traditional coherent detector with an SDD and eliminates the long-standing necessary step of establishing multiple point-to-point quantum key distribution links between all users and the dealer. We then elaborate on the principle of the specifically designed SDD, which can efficiently discriminate mixed states with a much lower error probability. Finally, we construct a security model for SDD-CVQSS and derive its security bound against beam-splitting collective attacks. Numerical simulations show that SDD-CVQSS outperforms conventional CVQSS in both maximum transmission distance and secret key rate, even surpassing the PLOB bound. Additionally, we find that the performance degradation of SDD-CVQSS in long-distance transmission scenarios can be effectively compensated for using a post-selection scheme, providing a feasible way to achieve high-performance CVQSS. |
| title | Surpassing the PLOB bound in continuous-variable quantum secret sharing using a state-discrimination detector |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2508.09445 |