Routing Qubits on Noisy Networks

• URL: http://arxiv.org/abs/2601.14824v1
• Date: Wed, 21 Jan 2026 09:51:06 GMT
• Title: Routing Qubits on Noisy Networks
• Authors: Claudia Benedetti, Giovanni Ragazzi, Simone Cavazzoni, Paolo Bordone, Matteo G. A. Paris,
• Abstract summary: We encode information in the position of a quantum walker on a graph, modelling the routing of a generic qubit state from a single input to multiple outputs.<n>We analyse and assess routing performance in various regimes, evaluating their robustness against static and dynamical noise.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Robust quantum routing is essential for scalable quantum technologies. This paper investigates the resilience of routing protocols in network architectures designed for perfect, high-fidelity transfer of both classical and quantum information under ideal conditions. We encode information in the position of a quantum walker on a graph, modelling the routing of a generic qubit state from a single input to multiple (orthogonal) outputs. We analyse and assess routing performance in various regimes, evaluating their robustness against static and dynamical noise.

Related papers

• Variational noise mitigation in quantum circuits: the case of Quantum Fourier Transform [35.18016233072556]
  We perform numerical simulations for two qubits under both coherent and incoherent noise.<n>Our results show that the variational circuit can reproduce the QFT with higher fidelity in scenarios dominated by coherent noise.<n>This demonstrates the potential of the approach as an effective error-mitigation strategy for small- to medium-scale quantum systems.
  arXiv  Detail & Related papers  (2025-11-07T14:35:55Z)
• 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)
• Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions [5.246986428523558]
  This paper presents a framework for quantum network routing that combines belief-state planning with Graph Neural Networks (GNNs)<n>Our approach encodes complex quantum network dynamics, including entanglement degradation and time-varying channel noise, into a low-dimensional feature space.<n> Experiments on simulated quantum networks with up to 100 nodes demonstrate significant improvements in routing fidelity and entanglement delivery rates.
  arXiv  Detail & Related papers  (2025-09-10T14:50:03Z)
• 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)
• Crosstalk-Resilient Quantum MIMO for Scalable Quantum Communications [40.44880302154388]
  Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity.<n>We propose a mitigation strategy based on encoding discrete-variable quantum information into continuous-variable modes.<n>We prove the existence of a gauge-fixing decoder enabling recovery of the logical information.
  arXiv  Detail & Related papers  (2025-06-26T18:40:26Z)
• Sequential Entanglement-Swapping assisted by Quantum Protocol over Ethernet Networks [33.41459442049189]
  We show the potential of combining classical and quantum technologies for efficient, scalable quantum networking.<n>Some novel protocols enable reliable end-to-end quantum entanglement over Ethernet.
  arXiv  Detail & Related papers  (2025-02-26T10:01:28Z)
• Scalable Structure For Chiral Quantum Routing [0.0]
  We address the problem of routing quantum and classical information from one sender to many possible receivers in a network.<n>By employing the formalism of quantum walks, we describe the dynamics on a discrete structure based on a complete graph.
  arXiv  Detail & Related papers  (2025-02-18T10:55:26Z)
• 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)
• Perfect chiral quantum routing [0.0]
  We consider information encoded in the position of a quantum walker on a graph.<n>We design an optimal structure to achieve perfect quantum routing exploiting chirality and weighting of the edges.
  arXiv  Detail & Related papers  (2024-06-17T17:59:55Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Quantum routing of information using chiral quantum walks [0.0]
  We show how continuous time chiral quantum walks over a minimal graph may be used to model directional transfer and routing of information over a network. In our scheme, chirality is governed by a single phase, and the routing probability is robust against fluctuations of this parameter.
  arXiv  Detail & Related papers  (2023-02-16T18:29:33Z)
• 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)

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.