Multi-field quantum conferencing overcomes the network capacity limit

Quantum conferencing enables multiple nodes within a quantum network to share a secure conference key for private message broadcasting. The key rate, however, is limited by the repeaterless capacity to distribute multipartite entangled states across the network. Currently, in the finite-size regime, no feasible schemes utilizing existing experimental techniques can overcome the fundamental rate-distance limit of quantum conferencing in quantum networks without repeaters. Here, we propose a practical, multi-field scheme that breaks this limit, involving virtually establishing Greenberger-Horne-Zeilinger states through post-measurement coincidence matching. This proposal features a measurement-device-independent characteristic and can directly scale to support any number of users. Simulations show that the fundamental limitation on the conference key rate can be overcome in a reasonable running time of sending 1014 pulses. We predict that it offers an efficient design for long-distance broadcast communication in future quantum networks. Quantum networks require secure conference keys for users to communicate and decrypt broadcasts. The authors propose a quantum conferencing protocol that overcomes key rate limits in networks without repeaters by using post-measurement coincidence matching, enabling secure, efficient, and flexible communication resistant to detector side channel attacks.

Authors

Institutions

Publication Details

Journal
Communications Physics
Published
2024-12-19
DOI
https://doi.org/10.1038/s42005-024-01894-1
Citations
11
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
3.82

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-field quantum conferencing overcomes the network capacity limit

Hua‐Lei Yin, Yu-Shuo Lu, Yuan-Mei Xie, Zeng‐Bing Chen et al.
11 citations
Communications Physics
Quantum Information and Cryptography
3.82
article

Multi-field quantum conferencing overcomes the network capacity limit

Hua‐Lei Yin, Yu-Shuo Lu, Yuan-Mei Xie, Zeng‐Bing Chen, Yao Fu
article en
11 citations

Abstract

Quantum conferencing enables multiple nodes within a quantum network to share a secure conference key for private message broadcasting. The key rate, however, is limited by the repeaterless capacity to distribute multipartite entangled states across the network. Currently, in the finite-size regime, no feasible schemes utilizing existing experimental techniques can overcome the fundamental rate-distance limit of quantum conferencing in quantum networks without repeaters. Here, we propose a practical, multi-field scheme that breaks this limit, involving virtually establishing Greenberger-Horne-Zeilinger states through post-measurement coincidence matching. This proposal features a measurement-device-independent characteristic and can directly scale to support any number of users. Simulations show that the fundamental limitation on the conference key rate can be overcome in a reasonable running time of sending 1014 pulses. We predict that it offers an efficient design for long-distance broadcast communication in future quantum networks. Quantum networks require secure conference keys for users to communicate and decrypt broadcasts. The authors propose a quantum conferencing protocol that overcomes key rate limits in networks without repeaters by using post-measurement coincidence matching, enabling secure, efficient, and flexible communication resistant to detector side channel attacks.

Communications PhysicsVol. 7(1)
Yunnan University (CN), Chinese Academy of Sciences (CN), Collaborative Innovation Center of Advanced Microstructures (CN), Beijing Academy of Quantum Information Sciences (CN), Institute of Physics (CN), National Laboratory for Superconductivity (CN), Renmin University of China (CN)
National Natural Science Foundation of China, Renmin University of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 6%
Quantum Information and Cryptography
3.82
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.