[Paper Review] Purification and Entanglement Routing on Quantum Networks

Michelle Victora, Stefan Krastanov+3 more|arXiv (Cornell University)|Nov 23, 2020

Quantum Computing Algorithms and Architecture4 citations

TL;DR

This paper presents a hybrid approach to optimizing entanglement routing and purification in quantum networks with realistic constraints, such as limited memory coherence and imperfect channel fidelities. By integrating heuristic link costs with adaptive purification protocols, the authors achieve near-brute-force performance in path selection while maximizing distillable entanglement, demonstrating that multi-path routing with constrained path lengths significantly improves network efficiency across various topologies like grid and hexagonal lattices.

ABSTRACT

We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.

Motivation & Objective

• To address the challenge of distributing high-fidelity entanglement across quantum networks with imperfect channels and limited memory coherence.
• To optimize the interplay between purification protocols and routing strategies under resource constraints such as channel bandwidth and gate fidelity.
• To develop fast, effective heuristics for path-finding that match the performance of computationally expensive brute-force methods.
• To evaluate how network topology and multi-path routing influence entanglement generation rates under realistic hardware limitations.
• To inform future quantum network design by analyzing the impact of path length, node degree, and resource equivalence frameworks on distillable entanglement.

Proposed method

• The authors model quantum networks using end nodes, quantum channels, and repeaters, with entanglement generated via probabilistic sources and managed through local operations.
• They introduce a weighted link cost model for Dijkstra’s algorithm, incorporating both channel fidelity and purification efficiency to guide path selection.
• Purification protocols are optimized based on input state fidelity, gate fidelity, and circuit width, using permutation-based schemes to improve conversion efficiency.
• Multi-path routing is implemented across various topologies (e.g., grid, hexagonal lattice), with paths selected based on effective heuristics that balance length and resource usage.
• Two resource equivalence frameworks—equivalent channel EGR and equivalent repeater EGR—are used to compare distillable entanglement performance across different network parameters.
• Simulations use NetworkX in Python to analyze network topologies and evaluate entanglement rates under varying channel bandwidths and decoherence times.

Experimental results

Research questions

• RQ1 How does the choice of purification protocol affect entanglement routing performance in networks with limited memory coherence and channel noise?
• RQ2 What is the optimal trade-off between path length and number of available paths in multi-path quantum routing under resource constraints?
• RQ3 Can heuristic path-finding algorithms achieve performance comparable to brute-force search while remaining scalable for large networks?
• RQ4 How do different network topologies (e.g., grid vs. hexagonal lattice) influence the achievable distillable entanglement under identical resource constraints?
• RQ5 To what extent can multi-path routing with overlapping (non-edge-disjoint) paths improve entanglement generation rates when channels support multiple entanglement flows?

Key findings

• Multi-path routing significantly improves distillable entanglement rates, especially when path lengths are constrained, even in topologies with high node degree like hexagonal lattices.
• The performance of path-finding algorithms is highly sensitive to the choice of link cost metric, with heuristic costs achieving near-optimal results compared to brute-force search.
• Networks with higher node degree do not necessarily yield better entanglement rates unless path length imbalance is minimized.
• The use of equivalent channel and equivalent repeater EGR frameworks reveals that resource constraints—particularly channel bandwidth and memory time—critically limit entanglement scaling.
• Purification protocols optimized for circuit width and gate fidelity outperform standard protocols, especially in low-bandwidth or high-noise regimes.
• The study demonstrates that overlapping multi-path routing, though not currently modeled in full, could enable higher entanglement rates by allowing parallel flows on shared channels.