An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters
Gui-Lu Long, Dong Pan, Yu-Bo Sheng, Qikun Xue, Jianhua Lu, and Lajos, Hanzo

TL;DR
This paper proposes a practical, secure classical repeater-based approach for quantum networks, enabling a gradual transition from classical to quantum internet using existing technology and quantum-resistant algorithms.
Contribution
It introduces a novel hybrid quantum network architecture utilizing secure classical repeaters and QSDC, demonstrating its feasibility with experimental validation.
Findings
First experimental demonstration of a secure classical repeater-based hybrid quantum network.
The proposed approach ensures end-to-end security with quantum-resistant algorithms.
Supports seamless transition from classical to quantum internet using existing infrastructure.
Abstract
Until quantum repeaters become mature, quantum networks remain restricted either to limited areas of directly connected nodes or to nodes connected to a common node. We circumvent this limitation by conceiving quantum networks using secure classical repeaters combined with the quantum secure direct communication (QSDC) principle, which is a compelling form of quantum communication that directly transmits information over quantum channel. The final component of this promising solution is our classical quantum-resistant algorithm. Explicitly, in these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes, where it is read out and then transmitted to the next node. At the repeaters, the information is protected by our quantum-resistant algorithm, which is secure even in the face of a quantum computer. Hence, our solution offers secure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
