Comparando Estrat\'egias de Roteamento em Redes Qu\^anticas Oportun\'isticas

• URL: http://arxiv.org/abs/2311.01662v1
• Date: Fri, 3 Nov 2023 01:52:26 GMT
• Title: Comparando Estrat\'egias de Roteamento em Redes Qu\^anticas Oportun\'isticas
• Authors: Diego Abreu, Alan Veloso, Antonio Abel\'em
• Abstract summary: This paper presents a comparative analysis of three routing strategies in opportunistic quantum networks. routing strategies are compared based on the fidelity of the chosen routes, the number of entangled pairs created, and the number of route recalculations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents a comparative analysis of three routing strategies in opportunistic quantum networks. Quantum communication networks face unique challenges, such as the fragility of qubits and the need to create and maintain pairs of entangled states for reliable transmission. In this context, efficient and reliable routing is crucial to maximize the fidelity of the established routes, minimize the creation of new entangled pairs, and reduce the need for route recalculation. The routing strategies are compared based on the fidelity of the chosen routes, the number of entangled pairs created, and the number of route recalculations. The results obtained provide valuable information for the design and optimization of opportunistic quantum networks, contributing to advances in the efficiency and reliability of quantum communications.

Related papers

• Differentiated Service Entanglement Routing for Quantum Networks [4.522468619087071]
  We propose a differentiated service entanglement routing (DSER) scheme, which firstly finds out the lowest loss paths and supported wavelength channels with the tensor-based path searching algorithm, and then allocates the paired channels with the differentiated routing strategies. The evaluation results show that the proposed DSER scheme can be performed for constructing various large scale quantum networks.
  arXiv  Detail & Related papers  (2024-01-30T23:37:16Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Green, Quantized Federated Learning over Wireless Networks: An Energy-Efficient Design [68.86220939532373]
  The finite precision level is captured through the use of quantized neural networks (QNNs) that quantize weights and activations in fixed-precision format. The proposed FL framework can reduce energy consumption until convergence by up to 70% compared to a baseline FL algorithm.
  arXiv  Detail & Related papers  (2022-07-19T16:37:24Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• 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)
• 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)
• Wireless Power Control via Counterfactual Optimization of Graph Neural Networks [124.89036526192268]
  We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium. To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture. We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
  arXiv  Detail & Related papers  (2020-02-17T07:54:39Z)
• Effective routing design for remote entanglement generation on quantum networks [6.695045642641268]
  Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network's capabilities. We propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification.
  arXiv  Detail & Related papers  (2020-01-07T18:16:55Z)

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.