⚛️ quantum physics

Heralded optical entanglement distribution via lossy quantum channels: A comparative study

This paper compares three heralded schemes for distributing multipartite GHZ states over lossy optical channels using different photon sources and detector configurations, demonstrating that the optimal choice depends on the specific number of parties, transmission distance, and security requirements.

Original authors: Wan Zo, Seungbeom Chin, Yong-Su Kim

Published 2026-08-11

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Wan Zo, Seungbeom Chin, Yong-Su Kim

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 the internet, but instead of sending emails and cat videos, it sends the most mysterious, spooky connections in the universe: quantum entanglement. In this strange world, two particles can be linked so deeply that what happens to one instantly affects the other, no matter how far apart they are. This isn't just magic; it's the fuel for future super-secure codes, unhackable networks, and computers that could solve problems in seconds that would take today's giants thousands of years. But there's a catch. Sending these delicate quantum particles through fiber-optic cables is like trying to mail a soap bubble across a windy field; the signal gets lost, absorbed, or scattered by the glass fibers. To make this work, scientists need a way to know if the bubble actually made it without popping it. They need a "herald"—a signal that says, "Hey, the connection is ready!"—without destroying the precious quantum link itself. This is the challenge of building a quantum internet: how do we distribute these spooky connections over long, lossy distances without losing our minds or our data?

This paper dives into that exact problem, acting like a detective comparing three different strategies for delivering these quantum connections. The researchers, Wan Zo, Seungbeom Chin, and Yong-Su Kim, set out to find the best way to create a specific type of super-connection called a GHZ state, which links three or more people together in a quantum dance. They tested three different "delivery methods" through a simulated, lossy network. The first method, the BC scheme, is like a master chef in a central kitchen who prepares perfect, pre-linked pairs of ingredients (Bell states) and sends them out to everyone. It's incredibly efficient, but it requires the impossible: perfectly synchronized chefs in different cities making the exact same dish at the exact same time. The second method, the SC scheme, is more practical. Instead of pre-linked pairs, everyone sends a single ingredient (a single photon) to the central chef, who then tries to link them up. It's easier to set up, but sometimes the chef gets a signal that looks like a success even when the ingredients didn't actually link up, leading to a "false alarm." The third method, the SD scheme, is the ultimate rebel: there is no central chef at all. Everyone sends their ingredients to their neighbors, and the group links up through a decentralized web of trust. This is great for security because no single person holds all the keys, but it's a bit more fragile against the wind of signal loss.

The authors ran simulations to see which method wins under different conditions, and the results are a tale of trade-offs. If you are building a small network with fewer than 13 people, the SC scheme (the single-photon central hub) is the clear winner for getting the job done most often. It has the highest success rate. However, as the network grows larger (more than 12 parties), the SD scheme (the decentralized web) starts to catch up and eventually becomes better at successfully delivering the entangled state, simply because the distances between neighbors in a large circle are shorter.

But the real twist comes when looking at "heralding efficiency"—how much you can trust the "success signal" not to be a lie. The central hub methods (BC and SC) are great for small groups, but the decentralized SD scheme shines when the parties are close together. The researchers found that if the distance between neighbors is less than about 15.71 km, the decentralized method is actually more reliable than the central one, even for very large networks. This is a crucial finding because it suggests that for dense, city-sized quantum networks where security and trust are paramount (since no single "chef" controls the whole process), the decentralized approach is the most robust choice. The paper doesn't claim to have built the final quantum internet, but it provides a vital roadmap, showing engineers exactly which "delivery truck" to use depending on how many people they are connecting and how far apart they live.

Technical Summary: Heralded Optical Entanglement Distribution via Lossy Quantum Channels

Problem Statement
Quantum entanglement is a foundational resource for quantum networks, cryptography, sensing, and computing. In photonic systems, distributing entanglement to distant parties is hindered by photon loss in optical channels. Unlike ideal scenarios, practical optical channels lack quantum non-demolition (QND) measurements, meaning successful transmission cannot be confirmed without post-selection. To enable scalable quantum information processing, entanglement distribution must be "heralded"—using ancillary photon detections to signal the successful creation of the target state. However, existing protocols face challenges regarding the synchronization of initial states and the impact of channel loss on success probabilities and heralding efficiency. This study addresses the comparative performance of different heralded schemes for distributing multipartite Greenberger-Horne-Zeilinger (GHZ) states over lossy channels.

Methodology
The authors propose and analyze three distinct heralded schemes for generating $N$ -partite GHZ states, distinguishing them by their photon sources and network architectures. The performance of each scheme is evaluated using two primary metrics:

Success Probability ( $P_{suc}$ ): The probability of generating the target GHZ state across all transmission trials.
Heralding Efficiency ( $H_{eff}$ ): The conditional probability of generating the GHZ state given a successful heralding detection signal.

The three schemes analyzed are:

BC Scheme (Bell state inputs with Centralized third-party): Utilizes $N$ pre-shared Bell states (2 $N$ photons) distributed from a central node. Entanglement swapping is performed via a central third party using polarization beam splitters (PBS) and photon-number resolving detectors (PNRD).
SC Scheme (Single-photon inputs with Centralized third-party): Replaces initial Bell states with $2N$ single photons generated locally at each party. These photons are split via 50:50 beam splitters, with one path sent to a central third party for measurement.
SD Scheme (Single-photon inputs with Decentralized heralding): Utilizes $2N$ single photons but eliminates the centralized third party. Heralding detectors are distributed among the $N$ participants in a symmetric, decentralized network structure.

The analysis incorporates channel loss modeled by an exponential transmission coefficient $\eta = e^{-\alpha l}$ , where $\alpha$ is the attenuation constant and $l$ is the channel length. The network geometry is assumed to be a two-dimensional circular arrangement with radius $R$ .

Key Contributions and Results
The paper provides analytical derivations for $P_{suc}$ and $H_{eff}$ for all three schemes under lossy conditions and compares their performance based on the number of parties ( $N$ ) and network radius ( $R$ ).

BC Scheme Performance:
- Achieves the highest success probability among the three schemes.
- Maintains a constant heralding efficiency of $H_{eff} = 1$ , as the heralding signal guarantees the presence of the entangled state regardless of loss.
- Limitation: Requires the simultaneous generation and synchronization of $N$ Bell states among distant parties, which is experimentally demanding.
SC vs. SD Scheme Comparison:
- Success Probability ( $P_{suc}$ ): The SC scheme outperforms the SD scheme for networks with $N \leq 12$ parties. For $N > 12$ , the SD scheme yields a higher success probability. This crossover occurs because the SD scheme's channel length ( $l_{SD} = 2R\sin(\pi/N)$ ) decreases as $N$ increases, eventually offsetting the penalty of sending two photons per link compared to the SC scheme's single photon.
- Heralding Efficiency ( $H_{eff}$ ):
  - For $N \leq 6$ , the SC scheme maintains higher heralding efficiency than the SD scheme at all radii.
  - For $N \geq 7$ , a crossover radius ( $R_c$ ) exists. When the network radius is smaller than $R_c$ , the SD scheme exhibits superior heralding efficiency.
  - As $N$ becomes large, the inter-party distance at which the efficiencies cross converges to approximately 15.71 km. Thus, for large networks where parties are closer than ~15.71 km, the SD scheme is more efficient.
- Security and Trust: The SD scheme offers a distinct advantage in information balance. By distributing heralding detectors evenly among participants, it removes the need for a trusted third party, addressing potential security concerns inherent in centralized architectures like the BC and SC schemes.

Significance
The study provides a framework for selecting the optimal entanglement distribution strategy based on specific network constraints. The authors conclude that while the BC scheme offers theoretical optimality in efficiency, its experimental requirements are prohibitive. The SC and SD schemes offer more practical alternatives using single-photon sources. The choice between them depends on the network scale and topology:

The SC scheme is preferable for smaller networks ( $N \leq 12$ ) or where maximizing success probability is the primary goal.
The SD scheme becomes advantageous for larger networks ( $N > 12$ ) or when the inter-party distance is short (<15.71 km), particularly when security requirements necessitate a decentralized, trust-free architecture.

These findings offer crucial insights for designing resilient heralded circuits for quantum information processing over lossy channels, balancing the trade-offs between success probability, heralding efficiency, and network security.

More like this