⚛️ quantum physics

Distributed Monogamy of Entanglement limits Quantum Channel Simulation

This paper introduces the concept of fractional extendibility to establish a distributed monogamy of entanglement principle, which proves that quantum erasure channels with erasure probabilities exceeding 50% cannot simulate less noisy erasure channels, even with asymptotically many uses.

Original authors: Rabsan Galib Ahmed, Graeme Smith

Published 2026-07-10

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Rabsan Galib Ahmed, Graeme Smith

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 quantum world as a giant, high-stakes game of "keep-away" with a very special, invisible ball called entanglement. This ball is magical: if you hold it, you share a secret link with someone else. But here's the catch—the ball is incredibly monogamous. It hates sharing. If you try to split the link between three or more people, the connection between any two of them gets weak, like a rubber band stretched too thin.

For a long time, scientists knew this rule existed, but they only had a blunt tool to measure it. They could say, "Okay, this connection is strong enough to be shared with two copies of the environment, but not three." It was like saying a person is either "tall" or "not tall," without measuring exactly how many inches they are.

In this paper, authors Rabsan Galib Ahmed and Graeme Smith introduce a much sharper ruler called fractional extendibility. Think of it as a way to measure exactly how much of that secret quantum link leaks out to the environment. They prove that this new ruler is super reliable: it doesn't change if you stack multiple copies of the channel together, and it only gets "worse" (less connected) if you try to process the information locally. It's a precise way to track how much of the quantum magic is lost to the noise.

Using this new ruler, they tackle a big question in quantum communication: Can a noisy, broken channel be used to simulate a cleaner, better channel?

Imagine you have a bucket with a huge hole in it (a very noisy channel) and you want to fill a cup with water using it. You might think, "If I just use the bucket a million times, maybe I can trick it into acting like a bucket with a tiny hole." The authors prove that this is impossible if the hole is too big.

Specifically, they look at a type of quantum channel called the quantum erasure channel. This channel is like a messenger who either delivers your secret note perfectly or, with some probability, throws the note away and replaces it with a note that says "ERROR."

If the messenger throws the note away less than half the time (transmission probability $\lambda > 1/2$ ), you can fix the errors and get your message through.
If the messenger throws the note away more than half the time ( $\lambda \le 1/2$ ), the quantum laws of physics say you can't recover the message. The environment (the "trash can") knows too much, and trying to clone the message would break the "no-cloning theorem."

The big mystery the authors solve is: Can you take a messenger who throws away the note 60% of the time and, by using them a huge number of times, simulate a messenger who only throws it away 50% of the time?

The answer is a hard no.

To prove this, the authors discovered a new rule they call the Distributed Monogamy of Entanglement. Here is the analogy: Imagine you have a party with $n$ guests. You want to see how many pairs of guests can hold hands with a special "EPR pair" (a perfect quantum handshake) at the same time. The authors prove that if you pick a random group of $k$ guests (where $k$ is no more than half the total number of guests), the average chance that any of them can hold that perfect handshake is exactly the fraction $k/n$ .

It's like saying: If you have 100 people and you pick 50 of them at random, the best you can hope for is that, on average, they share the handshake with a probability of 50/100. You can't cheat the math. If you try to use a "worse" channel (one that loses more information) to simulate a "better" one, you are essentially trying to stretch that rubber band of entanglement beyond its limit. The math shows that the "worse" channel leaks too much information to the environment to ever mimic the "better" one, even if you use the worse channel an infinite number of times.

The authors show this rigorously for all cases where the erasure probability is greater than 50%. They prove that a channel that erases more than half the time cannot simulate a channel that erases less than half the time. This isn't just a guess or a simulation; it is a mathematical proof based on the new tools they built.

They also mention that this logic likely applies to other types of noisy channels, like the "amplitude damping" channel (which is like a battery slowly losing energy), but they focus their hard proof on the erasure channel.

So, the bottom line is: In the quantum world, you can't make a bad connection good just by trying harder. If the noise is too high (more than 50% loss), the laws of physics strictly forbid you from simulating a cleaner connection, no matter how many times you try. The "monogamy" of entanglement ensures that the universe keeps its secrets safe, even when you try to stretch the rules.

Technical Summary: Distributed Monogamy of Entanglement Limits Quantum Channel Simulation

Problem Statement
The paper addresses a fundamental question in quantum Shannon theory: the simulation of one noisy quantum channel by another. Specifically, it investigates whether a quantum erasure channel with a higher erasure probability (more noise) can simulate a quantum erasure channel with a lower erasure probability (less noise) in the asymptotic limit, even when the target channel has zero quantum capacity.

While classical Shannon theory divides channels into two equivalence classes (positive capacity and zero capacity) where any channel in a class can simulate any other, quantum channels exhibit richer structure. Previous work established that certain zero-capacity channels cannot simulate others due to "superactivation" phenomena and $k$ -extendibility constraints. However, a general characterization remained elusive for the regime where both channels have zero capacity (erasure probability $\lambda \le 1/2$ ). Specifically, it was unknown if a channel $N_\gamma$ (with $\gamma < \lambda \le 1/2$ ) could simulate $N_\lambda$ . The central obstacle identified is the lack of a fine-grained tool to distinguish the "noisiness" of channels within the zero-capacity regime, as standard $k$ -extendibility is too coarse for certain parameter ranges.

Methodology
The authors develop a theoretical framework based on three main components:

Fractional Extendibility: The authors generalize the concept of $k$ -extendibility to $(p, q)$ -extendibility. A state $\rho_{AB}$ is $(p, q)$ -extendible if there exists an extension $\sigma_{AB_1...B_{p+q}}$ such that any subset of $q$ systems from the $p+q$ extensions can be processed to recover $\rho_{AB}$ . This allows for a continuous parameterization of the correlation leaked to the environment, moving beyond integer $k$ .
Distributed Monogamy of Entanglement (DME): The authors prove a new universal limit on the extraction of entanglement. For an $n$ -party state $AB_1...B_n$ , the maximum average probability of extracting an EPR pair with a reference system $A$ from a random subset of $k$ systems (where $n \ge 2k$ ) is bounded by the fraction $k/n$ . This result is derived using graph-theoretic methods, specifically relating the problem to the Lovász theta function of Kneser graphs ( $KG_{n,k}$ ).
Graph-Theoretic Analysis: The proof of DME utilizes $\mu$ -orthonormal representations of graphs and the continuity of the Lovász theta function to bound the overlap of states that are approximately maximally entangled with a reference.

Key Contributions and Results

Properties of Fractional Extendibility: The authors prove that $(p, q)$ -extendibility is invariant under tensor products (Corollary 4) and monotonic under local pre- and post-processing (Lemmas 5 and 6). These properties establish it as a robust resource monotone for channel simulation.
Characterization of Erasure Channels: They establish a precise relationship between the erasure probability $\lambda$ and extendibility. Specifically, an erasure channel with $\lambda = q/(p+q)$ is $(p, q)$ -extendible. Conversely, if $\lambda = q/(p+q)$ , the channel is not in the closure of the set of $(p', q')$ -extendible states if $p'/q' > p/q$ (Lemma 8).
Impossibility of Simulation: The primary result (Theorem 10) proves that a quantum erasure channel $N_\gamma$ $N_{γ}$ cannot simulate a less noisy erasure channel $N_\lambda$ $N_{λ}$ if $\gamma < \lambda \le 1/2$ $γ < λ \leq 1/2$ .
- Mechanism: If $N_\gamma$ could simulate $N_\lambda$ , the Choi state of the simulated channel would be a limit of $(p, q)$ -extendible states (where $p/q$ corresponds to the noise of $N_\gamma$ ). However, the Choi state of $N_\lambda$ requires a different extendibility ratio. The DME bound ensures that the "fractional" entanglement shared with the environment cannot be reduced below the limit imposed by the noisier channel, leading to a contradiction.
Generalization: The authors note that these arguments can be extended to qubit amplitude damping (AD) channels, suggesting that arbitrary combinations of erasure and AD channels with noise parameters greater than $x$ cannot simulate a channel with noise parameters less than $x$ for any $x \ge 1/2$ .

Significance
The paper claims to resolve the open question regarding the simulation of zero-capacity quantum erasure channels. By introducing fractional extendibility and proving the distributed monogamy of entanglement, the authors provide a rigorous proof that the "noisier" channel cannot simulate the "less noisy" one, even asymptotically. This highlights a fundamental limitation in quantum information processing distinct from classical theory: the inability to "purify" a channel's noise profile through encoding and decoding if the underlying resource (entanglement distribution) is constrained by monogamy. The work establishes that the structure of zero-capacity channels is not uniform; they possess an intrinsic hierarchy of noise that prevents simulation between certain pairs, reinforcing the complexity of quantum channel simulation.

More like this