Quality of Service in quantum networks

• URL: http://arxiv.org/abs/2501.18846v1
• Date: Fri, 31 Jan 2025 01:56:53 GMT
• Title: Quality of Service in quantum networks
• Authors: Nicolò Lo Piparo, William J. Munro, Kae Nemoto,
• Abstract summary: Quantum networks will allow one to connect multiple users scattered around the world. We explore the assignment issue of a router in a quantum aggregation scenario. We consider that the information is encoded using an error correction code.
• Score: 0.0
• License:
• Abstract: Tomorrow's quantum networks will allow one to connect multiple users scattered around the world. The large distances separating the users as well as limited physical resources will require using different paths to exchange information. The resources can be then distributed over channels of different length and transmitted to the end's users. Optimizing the distribution of such resources over those channels is then a fundamental issue that must be considered to achieve efficient long-distance quantum communication. One can then think of a routing mechanism that assigns the available channels to the users across which they can share unencoded and encoded information. Here we explore the assignment issue of a router in a quantum aggregation scenario, in which the users exchange unencoded information. Then we consider that the information is encoded using an error correction code. We give a simple example for both cases with whom we estimate the fidelities of several different configurations.

Related papers

• 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)
• 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)
• 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)
• 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.