Zhonghui Li

Zhonghui Li

Auto-generated profile, based on publicly available information

Zhonghui Li

School of Cyber Science and Technology, University of Science and Technology of China, Hefei, Anhui, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 July 2023 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
ZLZhonghui Li
Zhonghui Li
KXKaiping Xue
Kaiping Xue
JLJian Li
Jian Li
Lutong ChenLutong Chen
Lutong Chen
Ruidong LiRuidong Li
Ruidong Li
JLJun Lu
Jun Lu
Over the past few decades, significant progress has been made in quantum information technology, from theoretical studies to experimental demonstrations. Revolutionary quantum applications are now in the limelight, showcasing the advantages of quantum information technology and becoming a research hotspot in academia and industry. To enable quantum applications to have a more profound impact and wider application, the interconnection of multiple quantum nodes through quantum channels becomes essential. Building an entanglement-assisted quantum network, capable of realizing quantum information transmission between these quantum nodes, is the primary goal. However, entanglement-assisted quantum networks are governed by the unique laws of quantum mechanics, such as the superposition principle, the no-cloning theorem, and quantum entanglement, setting them apart from classical networks. Consequently, fundamental efforts are required to establish entanglement-assisted quantum networks. While some insightful surveys have paved the way for entanglement-assisted quantum networks, most of these studies focus on enabling technologies and quantum applications, neglecting critical network issues. In response, this paper presents a comprehensive survey of entanglement-assisted quantum networks. Alongside reviewing fundamental mechanics and enabling technologies, the paper provides a detailed overview of the network structure, working principles, and development stages, highlighting the differences from classical networks. Additionally, the challenges of building wide-area entanglement-assisted quantum networks are addressed. Furthermore, the paper emphasizes open research directions, including architecture design, entanglement-based network issues, and standardization, to facilitate the implementation of future entanglement-assisted quantum networks.

12 May 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
ZLZhonghui Li
Zhonghui Li
JLJian Li
Jian Li
KXKaiping Xue
Kaiping Xue
DWDavid S. L. Wei
David S. L. Wei
Ruidong LiRuidong Li
Ruidong Li
JLJun Lu
Jun Lu
The quantum network is designed to connect numerous quantum nodes and support various ground-breaking quantum applications. Most of these applications require communicating parties to share entangled pairs. Therefore, entanglement routing, a technology distributing entangled pairs between distant quantum nodes, plays a vital role in realizing quantum networks’ capability. However, due to the limitation of quantum memory size and quantum decoherence, the entangled pairs shared by adjacent quantum nodes can hardly satisfy concurrent entanglement routing requests, thus leading to severe network congestion. In this paper, we propose a novel congestion mitigation (CM) scheme to tackle such bottleneck problems. The basic idea of CM is to “recycle” idle link-level entanglement resources from well-resourced links to bottleneck links utilizing a unique enabling technology of quantum networks, called entanglement swapping. CM can increase the capacity of each bottleneck link, thus overcoming resource limitations to improve resource utilization and network throughput. To complete our work, we also propose a swapping-based entanglement routing design, including path selection and resource allocation algorithms. Extensive simulations show that our design can significantly alleviate network congestion and improve the request service rate of quantum networks compared to the traditional entanglement routing designs.

9 October 2023 in IEEE Network
Verified
Journal Article
Closed access
ZXZirui Xiao
Zirui Xiao
JLJian Li
Jian Li
KXKaiping Xue
Kaiping Xue
ZLZhonghui Li
Zhonghui Li
NYNenghai Yu
Nenghai Yu
JLJun Lu
Jun Lu
Remote entanglement distribution plays a crucial role in quantum networks, which can support many essential and exciting quantum applications. As the network scale expands, it is urgent to design a general and efficient remote entanglement distribution protocol. Nowadays, connection-oriented remote entanglement distribution protocols are available to achieve reliable entanglement distribution. However, in memory-limited quantum networks, connection-oriented entanglement distribution protocols cannot utilize entanglement resources fully and increase the delay of End-to-End (E2E) entanglement connection establishment. To overcome these shortcomings of existing entanglement distribution protocols, we design a connectionless remote entanglement distribution protocol to let Source-Destination (S-D) pairs compete for entanglement resources simultaneously. In our protocol, a fair request scheduling algorithm is proposed to reduce the waiting time without entanglement connections between S-D pairs. Furthermore, a fast scheduling trigger mechanism is proposed to perform entanglement swapping timely to reduce the delay of E2E entanglement connection establishment. The simulation results show that the designed protocol has advantages in terms of resource utilization, throughput, the service completion time of S-D pairs, and the maximum waiting time, compared with the existing remote entanglement distribution protocol.

21 March 2024 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
Lutong ChenLutong Chen
Lutong Chen
KXKaiping Xue
Kaiping Xue
JLJian Li
Jian Li
ZLZhonghui Li
Zhonghui Li
Ruidong LiRuidong Li
Ruidong Li
JLJun Lu
Jun Lu
Remote entanglement distribution in an efficient and reliable manner, especially in the context of a large-scale quantum network with multiple requests, remains an unsolved challenge. The key difficulties lie in achieving spontaneous and precise control over the entanglement distribution procedure, as multiple nodes need to reach a consensus on how to perform it. From the network aspect, allocating link-layer entangled pairs as resources to achieve high efficiency is also challenging. To address these issues, we propose a decentralized Reliable Entanglement Distribution Protocol (REDP) for large-scale networks. The protocol operates in a Forward-Backward Propagation (FBP) manner, where consensus is reached hop-by-hop and disseminated to all nodes on the path. We further use probabilistic analysis and quasi-static modeling to seek the fairness and efficiency of the network based on the above transmission model. Accordingly, we introduce a Source Window Strategy (SWS) and an Entanglement Allocation Strategy (EAS) to assign sending windows and allocate resources for multiple requests, ensuring a high level of fairness and efficiency from a network perspective. Through systematic simulations involving both classical and quantum communication protocols, we demonstrate that REDP outperforms existing approaches in terms of fairness, throughput, and fidelity performance.

13 February 2025 in IEEE Network
Verified
Journal Article
Closed access
JLJian Li
Jian Li
PZPeng Zheng
Peng Zheng
ZLZhonghui Li
Zhonghui Li
KXKaiping Xue
Kaiping Xue
ZXZhilin Xie
Zhilin Xie
JLJun Lu
Jun Lu
As a promising quantum application, Quantum Key Distribution (QKD) technology has been rapidly developed from point-to-point communication to a large-scale commercial network. However, considering the cost of QKD components and network infrastructure, building a QKD network is challenged by its expensive capital expenditure, which significantly hinders its future popularization. In this article, we envision an evolution roadmap consisting of three stages for the future development of QKD networks, aiming at achieving a fully integrated network architecture that combines QKD and telecommunications networks. Powered by several critical technologies, such as link multiplexing, miniaturized QKD, and transmission optimization, QKD is foreseen to be integrated into telecommunications networks as an add-on module that can be flexibly deployed. After that, we introduce the integrated network architecture design in detail, and respectively provide four QKD-related function implementations. At last, key technologies that should be concerned and further investigated are also discussed with performance evaluation, which can provide theoretical guidance for both industries and academia. Based on the proposed roadmap and integrated architecture, we believe a scalable, easy-to-use, and affordable QKD service can be brought to current telecommunication networks, and extensively applied by ordinary people while using daily applications.

18 July 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
ZLZhonghui Li
Zhonghui Li
JLJian Li
Jian Li
KXKaiping Xue
Kaiping Xue
DWDavid S. L. Wei
David S. L. Wei
NYNenghai Yu
Nenghai Yu
JLJun Lu
Jun Lu
Entanglement distribution between distant quantum nodes plays an essential role in realizing quantum networks’ capabilities. In addition to path selection, remote entanglement distribution involves two pivotal quantum operations, i.e., entanglement generation and entanglement swapping. The existing studies mainly adopt two methods, i.e., Tell-and-Generation (TAG) and Tell-and-Swapping (TAS), to manage these two quantum operations on a selected path. However, both methods fatally introduce redundant stop-and-wait processes, which are detrimental to the performance of remote entanglement distribution in terms of latency and fidelity. To achieve low-latency and high-fidelity entanglement distribution between far-off quantum nodes, we propose a segment-based method consisting of an entanglement generation algorithm and a segment design to diminish the unnecessary stop-and-wait processes. The entanglement generation algorithm adopts a concurrent design to establish entanglement links using the one-demand generation model, thus effectively reducing waiting time compared to hop-by-hop and parallel designs. The segment design is proposed to split a long-distance path into multiple short-haul segments with the similar ability to swap entanglement, and these segments build multi-hop entanglement connections in parallel. Extensive simulations show that the segment-based method significantly outperforms the existing methods, including TAG and TAS, in entanglement distribution latency and effectively mitigates fidelity attenuation.