Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2509.24407

Q-REACH: Quantum information Repetition, Error Analysis and Correction using Caching Network

Karl C. Linne, Yuanyuan Li, Debashri Roy, Kaushik Roy Chowdhury

Published Sep 29, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum repeaters incorporating quantum memory play a pivotal role in mitigating loss in transmitted quantum information (photons) due to link attenuation over a long-distance quantum communication network. However, limited availability of available storage in such quantum repeaters and the impact on the time spent within the memory unit presents a trade-off between quantum information fidelity (a metric that quantifies the degree of similarity between a pair of quantum states) and qubit transmission rate. Thus, effective management of storage time for qubits becomes a key consideration in multi-hop quantum networks. To address these challenges, we propose Q-REACH, which leverages queuing theory in caching networks to tune qubit transmission rate while considering fidelity as the cost metric. Our contributions in this work include (i) utilizing a method of repetition that encodes and broadcasts multiple qubits through different quantum paths, (ii) analytically estimating the time spent by these emitted qubits as a function of the number of paths and repeaters, as well as memory units within a repeater, and (iii) formulating optimization problem that leverages this analysis to correct the transmitted logic qubit and select the optimum repetition rate at the transmitter.

DOI
10.48550/arxiv.2509.24407

Related papers

Optimal deployment design of repeaters and memories in quantum networks

Jiangyuan Yao, Kaiwen Zou, Deshun Li +1 more

In quantum communication networks, the transmission success rate of entangled photons decreases exponentially with the transmission distance in fiber channel. With quantum repeaters, quantum networks can realize arbitrary long-distance links based on quantum entanglement swapping, quantum storage, and quantum teleportation. Thanks to the development of quantum memory technology, the throughput of quantum relay networks can be improved by increasing the number of quantum memories. In this paper, we study the routing metric, the goal of which is to achieve a higher throughput in a long-distance quantum network by reasonably allocating repeater positions with a given memory count between source and destination. A routing metric$E$was proposed, where the number and distance range of repeater deployments can be obtained by numerical analysis to support an optimal network throughput. According to the above principle, various repeaters were deployed on a linear quantum network to test the effectiveness of the proposed allocation mechanism with the given transmission loss, Bell-State Measurement (BSM) success rate, memory quantity, and distance. The results of evaluation show that increasing the number of repeaters blindly can lead to a waste of resources and a throughput decreasing, which implies that repeaters need to be placed at an appropriate deployment distance to achieve the optimal performance.

IEEE International Conference on High Performance Computing and Communications; IEEE International Conference on Smart City; IEEE International Conference on Data Science and Systems (HPCC/SmartCity/DSS)•Dec 1, 2021•2 citations

A high-performance quantum memory for quantum interconnects

H. -X Luo, C. Li, J. -L. Ren +7 more

Single photons are the flying qubits of choice for distributing entanglement in a quantum internet. Quantum memories embedded in quantum repeaters are crucial to overcome transmission loss and enhance the rate of quantum communication. A multimode memory can further boost the channel capacity. However, benchmarking and building a practical quantum memory that simultaneously optimizes multiple performance metrics poses two key challenges. Here, we introduce quantum interconnect rate to comprehensively quantify quantum memories, and further demonstrate a high-performance quantum memory that simultaneously integrates three essential criteria at once: large multimode capacity, high efficiency, and high fidelity. Operating on 11-dimensional spatial modes, our memory achieves a uniform efficiency exceeding 80% and qubit storage fidelities above 99%, enabling the efficient storage of high-dimensional qudits. Based on these capabilities, we estimate a distribution of 3.56 bits of quantum information over a 1000-km repeater link in one minute, highlighting a practical pathway toward scalable quantum interconnects and quantum networks.

quant-pharXiv:2603.01156•Physical Review Letters•Mar 3, 2026•1 citation

Q-FiRM: Fidelity-based Rate Maximizing Routes for Quantum Networks

Kai Li, Vini Chaudhary, Sara García Sánchez +1 more

Efficient routing of information between end-nodes is a key enabler for secure quantum networks and quantum secret key sharing, which rely on creating and sustaining entangled states over time. However, such pairwise entanglements degrade due to channel loss and the storage of the entangled photons at the network nodes. The state of entanglement in turn impacts fidelity, a metric which quantifies the degree of similarity between a pair of quantum states. In this paper, we propose a routing solution that satisfies threshold fidelity requirements imposed by a receiver on the quantum information received from multiple transmitter nodes. Our solution selects intermediate repeaters from a pool of such nodes within the network to maximize the sum-rate of quantum information transfer. To this extent, we first provide expressions for the fidelity loss between adjacent nodes as well as for the end-to-end quantum data rate. Then, we propose a novel two-stage routing solution that (i) identifies the k-shortest paths for each transmitter using fidelity as cost metric and (ii) (heuristically) assigns a path for each transmitter depending on whether the repeater nodes have a single or multiple available memory units. Simulation results demonstrate that our proposed fidelity-based routing solution satisfies a wide range of fidelity requirements [0.6-0.79] while maximizing the quantum information transfer rate, outperforming the existing distance- and hop-based routing approaches.

IEEE Consumer Communications and Networking Conference•Jan 8, 2023•6 citations

Efficient Optimization of Cut-offs in Quantum Repeater Chains

Boxi Li, Tim J. Coopmans, David Elkouss

Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on the communication channel preclude the direct long-distance transmission of quantum information in many relevant scenarios. In principle, quantum repeaters allow one to overcome losses. However, realistic hardware parameters make long-distance quantum communication a challenge in practice. For instance, in many protocols an entangled pair is generated that needs to wait in quantum memory until the generation of an additional pair. During this waiting time the first pair decoheres, impacting the quality of the final entanglement produced. At the cost of a lower rate, this effect can be mitigated by imposing a cutoff condition. For instance, a maximum storage time for entanglement after which it is discarded. In this article, we optimize the cutoffs for quantum repeater chains. First, we develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols which include a cutoff. Then, we use the algorithm to optimize cutoffs in order to maximize the secret-key rate between the end nodes of the repeater chain. In this article, we find that the use of the optimal cutoff extends the parameter regime for which secret key can be generated and, moreover, significantly increases the secret-key rate for a large range of parameters.

arXiv:2005.04946•IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2020•52 citations

Analysis of QoS in Networks of Quantum Repeaters

Jelena Mišić, Vojislav B. Mišić

In this work we consider a quantum network consisting of multiple interconnected quantum repeaters. In this network, data plane of communication is achieved by photon transmission over fibre cables, while the control plane which transmits results of measurements and control information is implemented over classical Internet. Important part of the control plane is the server which distributes connection requests and entanglement resources to nodes involved in the path. Together, data and control plane establish reliable multi hop links over the network deploying purification and swapping operations. We analyze the performance of such a network using probabilistic model of communication time between repeaters, rather than slotted time. We consider random arrivals of connection requests to each repeater and variable path lengths. We model a single repeater using theory of$M^{[x]}/G/m+r$queues where each batch request encompasses heralding, purification, and swapping times pertaining to a single repeater node. To model the network, we have used the concept of Jackson's network over repeater nodes in the path. This model allows derivation of end-to-end entanglement delivery time as random distribution and calculation of probability of decoherence of qubits stored in quantum memories over the path. We considered different numbers of entanglements per request and different types of quantum memories. Results of this analysis are useful for dimensioning capacities of quantum repeaters, memories and links in order to avoid decoherence of quantum memories.

IEEE Transactions on Network Science and Engineering•Jan 1, 2026•1 citation

Quantum Networking: Information Encoding and Decoding Strategies

Jincheng Zhang

This paper investigates optimal information encoding and decoding strategies within quantum networks. The core aim is to enhance information transmission efficiency and security by leveraging principles from information theory and quantum information theory. We analyze various encoding and decoding schemes, quantifying their performance using key metrics such as channel capacity and quantum bit error rate (QBER). This work focuses on identifying strategies that maximize the fidelity of quantum information transfer, considering the inherent challenges posed by quantum noise and decoherence. The proposed strategies incorporate adaptive coding techniques and error correction protocols tailored to specific network topologies and noise characteristics. Ultimately, this research contributes to the development of more robust and efficient quantum networks, a critical component of future quantum communication systems.

•Aug 31, 2026•0 citations
Quantum repeaters incorporating quantum memory play a pivotal role in mitigating loss in transmitted quantum information (photons) due to link attenuation over a long-distance quantum communication network. However, limited availability of available storage in such quantum repeaters and the impact on the time spent within the memory unit presents a trade-off between quantum information fidelity (a metric that quantifies the degree of similarity between a pair of quantum states) and qubit transmission rate. Thus, effective management of storage time for qubits becomes a key consideration in multi-hop quantum networks. To address these challenges, we propose Q-REACH, which leverages queuing theory in caching networks to tune qubit transmission rate while considering fidelity as the cost metric. Our contributions in this work include (i) utilizing a method of repetition that encodes and broadcasts multiple qubits through different quantum paths, (ii) analytically estimating the time spent by these emitted qubits as a function of the number of paths and repeaters, as well as memory units within a repeater, and (iii) formulating optimization problem that leverages this analysis to correct the transmitted logic qubit and select the optimum repetition rate at the transmitter.
In quantum communication networks, the transmission success rate of entangled photons decreases exponentially with the transmission distance in fiber channel. With quantum repeaters, quantum networks can realize arbitrary long-distance links based on quantum entanglement swapping, quantum storage, and quantum teleportation. Thanks to the development of quantum memory technology, the throughput of quantum relay networks can be improved by increasing the number of quantum memories. In this paper, we study the routing metric, the goal of which is to achieve a higher throughput in a long-distance quantum network by reasonably allocating repeater positions with a given memory count between source and destination. A routing metricEEEwas proposed, where the number and distance range of repeater deployments can be obtained by numerical analysis to support an optimal network throughput. According to the above principle, various repeaters were deployed on a linear quantum network to test the effectiveness of the proposed allocation mechanism with the given transmission loss, Bell-State Measurement (BSM) success rate, memory quantity, and distance. The results of evaluation show that increasing the number of repeaters blindly can lead to a waste of resources and a throughput decreasing, which implies that repeaters need to be placed at an appropriate deployment distance to achieve the optimal performance.
Single photons are the flying qubits of choice for distributing entanglement in a quantum internet. Quantum memories embedded in quantum repeaters are crucial to overcome transmission loss and enhance the rate of quantum communication. A multimode memory can further boost the channel capacity. However, benchmarking and building a practical quantum memory that simultaneously optimizes multiple performance metrics poses two key challenges. Here, we introduce quantum interconnect rate to comprehensively quantify quantum memories, and further demonstrate a high-performance quantum memory that simultaneously integrates three essential criteria at once: large multimode capacity, high efficiency, and high fidelity. Operating on 11-dimensional spatial modes, our memory achieves a uniform efficiency exceeding 80% and qubit storage fidelities above 99%, enabling the efficient storage of high-dimensional qudits. Based on these capabilities, we estimate a distribution of 3.56 bits of quantum information over a 1000-km repeater link in one minute, highlighting a practical pathway toward scalable quantum interconnects and quantum networks.
Efficient routing of information between end-nodes is a key enabler for secure quantum networks and quantum secret key sharing, which rely on creating and sustaining entangled states over time. However, such pairwise entanglements degrade due to channel loss and the storage of the entangled photons at the network nodes. The state of entanglement in turn impacts fidelity, a metric which quantifies the degree of similarity between a pair of quantum states. In this paper, we propose a routing solution that satisfies threshold fidelity requirements imposed by a receiver on the quantum information received from multiple transmitter nodes. Our solution selects intermediate repeaters from a pool of such nodes within the network to maximize the sum-rate of quantum information transfer. To this extent, we first provide expressions for the fidelity loss between adjacent nodes as well as for the end-to-end quantum data rate. Then, we propose a novel two-stage routing solution that (i) identifies the k-shortest paths for each transmitter using fidelity as cost metric and (ii) (heuristically) assigns a path for each transmitter depending on whether the repeater nodes have a single or multiple available memory units. Simulation results demonstrate that our proposed fidelity-based routing solution satisfies a wide range of fidelity requirements [0.6-0.79] while maximizing the quantum information transfer rate, outperforming the existing distance- and hop-based routing approaches.
Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on the communication channel preclude the direct long-distance transmission of quantum information in many relevant scenarios. In principle, quantum repeaters allow one to overcome losses. However, realistic hardware parameters make long-distance quantum communication a challenge in practice. For instance, in many protocols an entangled pair is generated that needs to wait in quantum memory until the generation of an additional pair. During this waiting time the first pair decoheres, impacting the quality of the final entanglement produced. At the cost of a lower rate, this effect can be mitigated by imposing a cutoff condition. For instance, a maximum storage time for entanglement after which it is discarded. In this article, we optimize the cutoffs for quantum repeater chains. First, we develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols which include a cutoff. Then, we use the algorithm to optimize cutoffs in order to maximize the secret-key rate between the end nodes of the repeater chain. In this article, we find that the use of the optimal cutoff extends the parameter regime for which secret key can be generated and, moreover, significantly increases the secret-key rate for a large range of parameters.
In this work we consider a quantum network consisting of multiple interconnected quantum repeaters. In this network, data plane of communication is achieved by photon transmission over fibre cables, while the control plane which transmits results of measurements and control information is implemented over classical Internet. Important part of the control plane is the server which distributes connection requests and entanglement resources to nodes involved in the path. Together, data and control plane establish reliable multi hop links over the network deploying purification and swapping operations. We analyze the performance of such a network using probabilistic model of communication time between repeaters, rather than slotted time. We consider random arrivals of connection requests to each repeater and variable path lengths. We model a single repeater using theory ofM[x]/G/m+rM^{[x]}/G/m+rM[x]/G/m+rqueues where each batch request encompasses heralding, purification, and swapping times pertaining to a single repeater node. To model the network, we have used the concept of Jackson's network over repeater nodes in the path. This model allows derivation of end-to-end entanglement delivery time as random distribution and calculation of probability of decoherence of qubits stored in quantum memories over the path. We considered different numbers of entanglements per request and different types of quantum memories. Results of this analysis are useful for dimensioning capacities of quantum repeaters, memories and links in order to avoid decoherence of quantum memories.
This paper investigates optimal information encoding and decoding strategies within quantum networks. The core aim is to enhance information transmission efficiency and security by leveraging principles from information theory and quantum information theory. We analyze various encoding and decoding schemes, quantifying their performance using key metrics such as channel capacity and quantum bit error rate (QBER). This work focuses on identifying strategies that maximize the fidelity of quantum information transfer, considering the inherent challenges posed by quantum noise and decoherence. The proposed strategies incorporate adaptive coding techniques and error correction protocols tailored to specific network topologies and noise characteristics. Ultimately, this research contributes to the development of more robust and efficient quantum networks, a critical component of future quantum communication systems.