⚛️ quantum physics

Routing Entanglement in Complex Quantum Networks Using GHZ States

This paper proposes a hybrid GHZ-BSM routing strategy that outperforms conventional Bell state measurement routing in square grid networks by accounting for varying GHZ measurement success probabilities, while highlighting the need for more sophisticated, globally informed adaptations in complex and real-world network topologies.

Original authors: Xin-An Chen, Caitao Zhan, Joaquin Chung, Jeffrey Larson

Published 2026-04-06

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Xin-An Chen, Caitao Zhan, Joaquin Chung, Jeffrey Larson

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to send a secret, unbreakable message to a friend who lives very far away. In the world of quantum computers, this "secret" is entanglement—a magical link where two particles are connected so deeply that what happens to one instantly affects the other, no matter the distance.

The problem? Sending these links through fiber optic cables is like trying to throw a fragile glass ball across a stormy ocean. The longer the distance, the higher the chance the ball breaks (signal loss). To fix this, we use Quantum Repeaters, which act like relay stations. They catch the ball, fix it, and throw it to the next station.

This paper is about finding the best way to organize these relay stations to get the message across.

The Old Way: The "Relay Chain" (BSM Routing)

Traditionally, scientists used a method called Bell State Measurement (BSM).

The Analogy: Imagine a line of people passing a bucket of water down a chain to put out a fire.
How it works: Person A passes to Person B, who passes to Person C, and so on. At every single step, the person has to successfully catch the bucket and pass it on.
The Flaw: If the chain is long (many people), the chance of the water spilling at some point becomes very high. The longer the distance, the less likely the fire gets put out.

The New Idea: The "Magic Web" (GHZ Routing)

Recently, researchers proposed a smarter way using something called GHZ states.

The Analogy: Instead of a single line, imagine a spiderweb. One person in the middle holds a special "magic rope" that connects to everyone around them at once.
How it works: Instead of passing a bucket step-by-step, the middle person performs a special "magic trick" (a GHZ measurement) that instantly ties the start and end points together, skipping the middle steps.
The Promise: In theory, this "magic web" doesn't care how far apart the start and end are. As long as the magic trick works, the connection is made instantly, regardless of distance.

The Problem with the "Magic Web"

The original idea for the Magic Web had a big flaw in its math. It assumed that the "magic trick" works just as well whether you are connecting 2 people or 100 people.

Reality Check: In the real world, the more people you try to connect at once, the harder the trick is to pull off. It's like trying to juggle 2 balls vs. 20 balls; the more balls you add, the higher the chance you'll drop them.
The Paper's Discovery: The authors realized that if you try to connect too many nodes at once, the "Magic Web" actually fails more often than the old "Relay Chain."

The Solution: The "Hybrid Team"

So, the authors invented a new strategy called Hybrid GHZ-BSM Routing.

The Analogy: Think of a construction crew. Sometimes, it's best to build a long bridge step-by-step (the old Relay Chain). Other times, it's better to use a crane to lift a huge beam across a gap (the Magic Web).
How it works: The new strategy is smart. It uses the "Magic Web" for short, easy jumps where it's very reliable, but switches back to the "Relay Chain" for long, difficult jumps where the magic trick is too risky. It mixes the two methods to get the best of both worlds.

What They Found in Different Cities (Networks)

The team tested this in three different types of "cities" (network layouts):

The Grid City (Square Grid): Like a perfect checkerboard.
- Result: The Hybrid strategy was a huge winner! It was faster and more reliable than the old way, especially over long distances.
The Random City (Waxman Network): Like a city where roads are built randomly between houses.
- Result: The "Magic Web" struggled here because there were too many random paths, and the web got confused. However, the authors suggested a fix: Network Segmentation.
- The Fix: Instead of one giant web for the whole city, break the city into smaller neighborhoods. Let each neighborhood do its own magic tricks in parallel. This makes the system much faster.
The Hub City (Scale-Free Network): Like a city with a few huge airports (hubs) and many small local roads.
- Result: The Hybrid strategy worked well here too, matching the performance of the old method but offering more flexibility.
The Real City (SURFnet): A real network used in the Netherlands.
- Result: Similar to the Hub City. The Hybrid approach was solid, though the pure "Magic Web" didn't work well unless the success rate of the tricks was extremely high.

The Big Takeaway

The paper teaches us that while "Magic Webs" (GHZ routing) sound amazing and promise distance-independent speeds, they are fragile in the real world because complex tricks are hard to pull off.

The best solution isn't to rely on one super-powerful trick, but to be adaptable. By mixing the old reliable relay chains with the new magic tricks, and by breaking big networks into smaller, manageable neighborhoods, we can build a quantum internet that is fast, reliable, and ready for the real world.

1. Problem Statement

Distributing entanglement over long distances in quantum networks is hindered by photon loss in optical fibers. Conventional entanglement routing relies on generating Bell states between adjacent nodes and performing Bell State Measurements (BSMs) to swap entanglement along a path. However, because BSMs are probabilistic and success rates decrease exponentially with the number of hops (distance), long-distance entanglement distribution rates drop significantly.

A recent alternative proposed using Greenberger-Horne-Zeilinger (GHZ) measurements to connect multiple nodes simultaneously. Previous theoretical work suggested this could achieve distance-independent rates (a "percolation" phenomenon) but relied on two critical, unrealistic assumptions:

Uniform Success Probability: It assumed $k$ -qubit GHZ measurements succeed with the same probability $q$ regardless of $k$ (the number of connections).
Network Topology: It focused primarily on simple square grid networks, ignoring complex real-world topologies.

The authors address the gap between theory and practice by investigating GHZ routing under realistic constraints (varying measurement success probabilities) and across diverse network models (Waxman, Scale-Free, and real-world SURFnet).

2. Methodology

Network Models

The study evaluates protocols on four distinct topologies:

Square Grid: $N \times N$ nodes on a regular lattice.
Waxman Networks: Randomly distributed nodes where connection probability decays exponentially with distance (modeling US fiber networks).
Scale-Free Networks: Dynamically built networks with "hubs" following preferential attachment.
SURFnet: A real-world research and education network topology in the Netherlands.

Protocols Evaluated

The authors compare three main strategies:

Conventional BSM Routing: A greedy algorithm selecting shortest paths and performing BSMs. Requires global topology information.
GHZ Routing (Original Proposal): Nodes blindly perform $k$ $k$ -qubit GHZ measurements based on local connectivity.
- Uniform-Success Model: Assumes constant success probability $q$ for all $k$ .
- Exponential-Decay Model: Assumes success probability scales as $q^{k-1}$ (reflecting the difficulty of larger measurements).
- (2,3)-GHZ Model: Restricts measurements to only 2-qubit (BSM) and 3-qubit GHZ states.
Hybrid GHZ-BSM Routing (Proposed): A new strategy where helper nodes locally prepare GHZ states and perform BSMs to simulate a GHZ measurement. This aims to retain the benefits of GHZ routing while mitigating the failure rates of large $k$ -qubit measurements.

Simulation Approach

Metrics: End-to-end entanglement rate (expected number of Bell states per cycle) and average rate $\langle R \rangle$ over all node pairs.
Method: Monte Carlo simulations sampling virtual topologies (successful link generations) over fixed physical topologies.
Parameters: Fiber loss $\gamma = 0.2$ dB/km; varying measurement success probabilities ( $q$ ).

3. Key Contributions

Realistic Modeling of GHZ Measurements: The paper explicitly models the success probability of $k$ -qubit GHZ measurements as decreasing with $k$ (either exponentially or restricted to small $k$ ). This reveals that the "distance-independent" advantage of GHZ routing vanishes under these realistic conditions in many scenarios.
Proposal of Hybrid GHZ-BSM Strategy: The authors introduce a hybrid protocol where nodes prepare GHZ states and use local BSMs. This approach effectively simulates GHZ measurements with higher reliability than direct large-scale GHZ measurements.
Comprehensive Topological Analysis: The study extends GHZ routing analysis beyond square grids to complex Waxman, Scale-Free, and real-world (SURFnet) networks, revealing that topological structure significantly impacts protocol performance.
Network Segmentation Concept: For complex networks (like Waxman) where naive GHZ routing fails, the authors propose network segmentation (dividing the network into smaller regions, analogous to OSPF areas) to enable parallel routing and unlock scalability.

4. Results

Square Grid Networks

Uniform-Success GHZ: Achieves distance-independent rates and outperforms BSM routing for large distances.
Realistic GHZ (Exponential/2,3): Performs poorly, often worse than BSM.
Hybrid GHZ-BSM: Outperforms conventional BSM routing in large networks (high node count) and achieves distance-independent rates, provided the measurement success probability $q$ is above a critical threshold.

Waxman Networks

Performance Gap: All GHZ-based strategies (including the hybrid) perform significantly worse than conventional BSM routing.
Reasoning: Waxman networks have high connectivity ( $O(n)$ paths). BSM routing exploits this redundancy effectively. In contrast, GHZ routing operates "coherently," often yielding only one end-to-end pair despite multiple available paths, failing to utilize path redundancy.
Phase Transition: The authors identify a phase transition where the network becomes sufficiently connected. They suggest that network segmentation could improve GHZ routing rates from $O(1)$ to $O(n)$ in these networks.

Scale-Free Networks

Uniform-Success GHZ: Outperforms BSM.
Realistic GHZ: Performs significantly worse than BSM.
Hybrid GHZ-BSM: Achieves rates comparable to BSM routing when the network size is sufficiently large, though it does not clearly outperform BSM.

SURFnet (Real-World Topology)

Performance: Similar to Scale-Free networks. Uniform-success GHZ is comparable to BSM.
Failure of (2,3)-GHZ: The restricted (2,3)-GHZ protocol achieves near-zero rates, highlighting the sensitivity of specific protocol designs to topology.
Distance Independence: Only observed for very high success probabilities ( $q \ge 0.9$ ).

5. Significance and Conclusion

This paper provides a critical reality check for GHZ-based entanglement routing. While the theoretical promise of distance-independent rates is valid under idealized assumptions, naive application of GHZ routing in complex, realistic networks with imperfect measurements yields rates much lower than conventional BSM routing.

The primary significance lies in the Hybrid GHZ-BSM strategy, which offers a viable path forward for square grid networks and potentially others. Furthermore, the identification of network segmentation as a necessary adaptation for complex topologies (like Waxman) suggests that future quantum network architectures cannot rely on a single universal routing protocol. Instead, they require sophisticated, topology-aware designs that may combine local GHZ operations with global coordination or segmentation strategies to fully leverage the potential of quantum repeaters.

The work bridges the gap between statistical physics models of percolation and practical quantum networking engineering, emphasizing that protocol design must account for both measurement fidelity and network topology.