Quality of Service in aggregated quantum networks

• URL: http://arxiv.org/abs/2501.18846v2
• Date: Mon, 04 Aug 2025 06:01:58 GMT
• Title: Quality of Service in aggregated quantum networks
• Authors: Nicolò Lo Piparo, William J. Munro, Kae Nemoto,
• Abstract summary: We introduce a performance-oriented approach to quantum network routing by extending the classical concept of Quality of Service (QoS) to the context of multi-path quantum resources distribution.<n>Unlike prior models that consider entanglement generation or quantum memory coherence in isolation, we investigate the interplay between path assignment strategies, coherence time constraints, and quantum error correction (QEC)<n>Our findings show that fidelity cannot be optimized independently of memory lifetimes, and that QEC can enhance performance under specific conditions, but it also imposes additional constraints depending on network topology and path-length asymmetries.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Future quantum networks will enable the interconnection of multiple users distributed across vast geographic distances. Due to these large separations and limited physical resources, communication will often rely on multi-path routing strategies, where physical resources are distributed across channels of varying lengths and delivered to end users. Efficient long-distance quantum communication therefore requires optimizing the allocation of these resources across available paths. In this work, we introduce a performance-oriented approach to quantum network routing by extending the classical concept of Quality of Service (QoS) to the context of multi-path quantum resources distribution. Unlike prior models that consider entanglement generation or quantum memory coherence in isolation, we investigate the interplay between path assignment strategies, coherence time constraints, and quantum error correction (QEC), and how they jointly impact end-to-end communication fidelity. We analyze both unencoded and encoded transmissions over aggregated network paths, quantifying the effects of resource allocation on transmission success. Our findings show that fidelity cannot be optimized independently of memory lifetimes, and that while QEC can enhance performance under specific conditions, it also imposes additional constraints depending on network topology and path-length asymmetries. This work provides a foundation for developing QoS-aware quantum routing protocols that balance fidelity, throughput, and memory utilization -- key considerations for near-term quantum repeater networks.

Related papers

• QPing: a Quantum Ping Primitive for Quantum Networks [40.350859102407505]
  We introduce the concept of Quantum Ping (QPing) as a diagnostic primitive for future quantum networks.<n>We develop a formal framework for QPing and leverage different tools such as sequential hypothesis testing.<n>We present several strategies, including active strategies, with path-based and segment-based variants, and passive strategies that utilize pre-shared entangled resources.
  arXiv  Detail & Related papers  (2025-08-05T18:00:06Z)
• Optimal resource requirements for connected quantum sub-networks [1.619107149276392]
  This work describes a scalable approach for building large quantum networks by connecting quantum sub-networks.<n>We derive a set of equations whose solutions give the optimal values of average network parameters that meet threshold requirements.<n>Our results present a pathway for calculating optimal resource requirements in quantum sub-networks interconnected to form the global quantum internet.
  arXiv  Detail & Related papers  (2025-02-20T09:20:55Z)
• Quantum aggregation with temporal delay [0.0]
  We explore the effects of a depolarization channel that occurs for the quantum Reed-Solomon code when quantum aggregation involving different channel lengths is used. Our results will have a significant impact on the ways physical resources are distributed across a quantum network.
  arXiv  Detail & Related papers  (2024-04-04T07:35:39Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Performance metrics for the continuous distribution of entanglement in multi-user quantum networks [0.0]
  Entangled states shared among distant nodes are frequently used in quantum network applications. In this paper, we focus on the steady-state performance analysis of protocols for continuous distribution of entanglement. One of the main conclusions from our analysis is that the entanglement consumption rate has a greater impact on the protocol performance than the fidelity requirements.
  arXiv  Detail & Related papers  (2023-07-03T23:55:02Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• A round-trip multi-band quantum access network [5.894846988315471]
  We propose an expandable and cost-effective quantum access network, in which the round-trip structure makes quantum states travel in a circle to carry the information. We realize multi-user secure key sharing through the continuous-variable QKD (CV-QKD) protocol. The results show that each user can achieve excess noise suppression and 600 bps level secure key generation under 30 km standard fiber transmission.
  arXiv  Detail & Related papers  (2023-05-10T06:14:13Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Quantum Multiple-Access One-Time Pad [9.137554315375919]
  We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. A number of senders initially share a correlated quantum state with a receiver and an eavesdropper. We derive a single-letter characterization for the achievable rate region in a limit of infinitely many copies and vanishingly small error.
  arXiv  Detail & Related papers  (2022-08-25T11:43:24Z)
• Quantum networks with coherent routing of information through multiple nodes [1.7819574476785418]
  We show that a quantum routing approach can extend the distance over which information can be transmitted reliably. Our findings highlight the potential of a future quantum internet.
  arXiv  Detail & Related papers  (2022-07-31T17:47:09Z)
• Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks [79.8886946157912]
  Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
  arXiv  Detail & Related papers  (2021-05-30T11:34:23Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Aggregating Quantum Networks [0.0]
  Single packets of information can now be split and transmitted in a coherent way over different routes. This aggregation allows information to be transmitted in a fault tolerant way between different parts of the quantum network. It is a quantum phenomenon not available in conventional telecommunication networks either.
  arXiv  Detail & Related papers  (2020-08-10T01:53:10Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.