A Design for an Early Quantum Network

August 07, 2025 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yuan Li, Chen Zhang, Hao Zhang, Tao Huang, Yunjie Liu arXiv ID 2508.04967 Category quant-ph: Quantum Computing Cross-listed cs.NI Citations 0 Venue arXiv.org Last Checked 5 months ago
Abstract
With the rapid advancement of quantum information technology, quantum networks have become essential for supporting diverse applications, which often have stringent demands for key metrics such as fidelity and request completion time. In this work, we propose a design for early-stage quantum networks that is compatible with the three existing quantum repeater technologies. The design aims to maximize the ability of the network to accommodate the diverse needs of quantum applications, even under conditions of limited quantum resources and suboptimal network performance. We have also described the required identifiers in the quantum network and the specific process for implementing quantum requests. To assess the feasibility of our design, we conduct simulations based on discrete-event modeling of quantum networks. The simulations consider various types of noise and imperfect parameters that might exist in early-stage networks. We analyze the impact of these parameters on the fidelity of the generated entangled states and the request completion time. Furthermore, we investigated additional decisions that the central controller can make beyond path selection, such as the choice of cutoff time and the allocation of network resources to requests.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted