Beyond Traditional Quantum Routing

• URL: http://arxiv.org/abs/2508.18023v1
• Date: Mon, 25 Aug 2025 13:38:13 GMT
• Title: Beyond Traditional Quantum Routing
• Authors: Si-Yi Chen, Angela Sara Cacciapuoti, Marcello Caleffi,
• Abstract summary: We propose a novel approach to quantum routing, which avoids the inherent overhead of conventional quantum pathfinding.<n>Our approach exploits graph complement strategies to establish directly entanglement between remote nodes.<n>It allows to improve the flexibility and efficiency of quantum networks, by paving the way for more practical quantum communication infrastructures.
• Score: 5.192590792600339
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Existing quantum routing implicitly mimics classical routing principles, with finding the ``best'' path (aka pathfinding), according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However, optimal pathfinding is computationally intensive, particularly in complex topologies. In this paper, we propose a novel approach to quantum routing, which avoids the inherent overhead of conventional quantum pathfinding, by establishing directly entanglement between remote nodes. Our approach exploits graph complement strategies. It allows to improve the flexibility and efficiency of quantum networks, by paving the way for more practical quantum communication infrastructures.

Related papers

• On Utility-optimal Entanglement Routing in Quantum Networks [0.10312968200748114]
  Quantum networks are envisioned to enable reliable distribution and manipulation of quantum information across distances.<n>In this work, we aim to identify optimal routes that correspond to the achievable network utility.<n>Our work provides the framework for extending classical flow-based and quality of service-aware routing concepts to quantum networks.
  arXiv  Detail & Related papers  (2026-03-01T17:32:32Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• 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)
• Learning Best Paths in Quantum Networks [35.925796298492]
  Quantum networks (QNs) transmit delicate quantum information across noisy quantum channels.<n>This paper addresses learning the best path in a QN in the online learning setting.<n>We introduce two online learning algorithms, BeQuP-Link and BeQuP-Path, to identify the best path.
  arXiv  Detail & Related papers  (2025-06-14T12:01:16Z)
• On Selecting Paths for End-to-End Entanglement Creation in Quantum Networks [0.9582800998895141]
  We show that textitprior entanglements are an important consideration in optimal path selection due to the dynamic nature of quantum networks.<n>Longer paths with prior entanglements can establish e2e entanglement faster than shorter paths under certain conditions.
  arXiv  Detail & Related papers  (2025-05-04T22:45:38Z)
• Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks [38.499527873574436]
  We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.<n>By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules.<n>We demonstrate our method's competetiveness with state-of-the-art circuit generalizations and capabilities on large sets of diverse random circuits.
  arXiv  Detail & Related papers  (2025-04-04T13:19:08Z)
• Entanglement Routing in Quantum Networks: A Comprehensive Survey [2.624902795082451]
  Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine. We classify and discuss the studied quantum routing schemes into reactive, proactive, opportunistic, and virtual routing.
  arXiv  Detail & Related papers  (2024-08-02T12:48:40Z)
• 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)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Transfer Learning in Quantum Parametric Classifiers: An Information-Theoretic Generalization Analysis [42.275148861039895]
  A key step in quantum machine learning with classical inputs is the design of an embedding circuit mapping inputs to a quantum state. This paper studies a transfer learning setting in which classical-to-quantum embedding is carried out by an arbitrary parametric quantum circuit.
  arXiv  Detail & Related papers  (2022-01-17T09:28:13Z)
• 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)
• 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)
• 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.