Quantum Network Routing with Heterogeneous Nodes
Anoop Kumar Pandey, Bheemarjuna Reddy Tamma, M. V. Panduranga Rao · 2025
Deciding a route for the transfer of quantum information (namely, qubits) on a quantum network is a significant problem that is being studied extensively. In this work, we investigate the problem of routing on a quantum network of heterogeneous nodes both with and without fidelity and timing constraints.We propose a Path Request Packet (PRP) based routing scheme for dynamically selecting a path that maximizes the overall probability of transmission success while maintaining fidelity above a threshold and adhering to time constraints. While the proposed scheme can perform suboptimally under fidelity and timing constraints, we discuss a straightforward proof of optimality in the absence of these constraints. Simulations on random graphs demonstrate that the PRP-based scheme performs better, both in terms of reliability and fidelity, than a non-trivial baseline routing algorithm.