Energy-constrained two-way capacities of the pure-loss channel

summary

Video file (mp4)

The gist

The gist: The two-way quantum and secret-key capacities of the pure-loss channel under an average input photon-number constraint are determined to be equal to a specific function involving the

In short

The paper determines that for a single-mode pure-loss channel under an average input photon constraint, the two-way quantum and secret-key capacities are equal to a function involving the entropy of a thermal state, $g(N) - g((1 - η)N)$. This provides the complete formula for bosonic quantum communication in this lossy scenario.

Key concepts

Two-way capacities
These are two different measures of communication capability: one for sending quantum information (quantum capacity) and another for securely transmitting a secret key (secret-key capacity). The paper shows these two values are identical under the given constraints.
Pure-loss channel ($L_ η$)
This is a specific type of communication channel where input photons are lost to an environment, modeled by mixing the input with a vacuum state on a beam splitter. The parameter $\eta$ controls the loss rate.
Regularized relative entropy ($ER(A: B)\rho$
This is a mathematical tool used to quantify the distinguishability between two quantum states, $A$ and $B$, especially when dealing with mixed states. It helps bound how much entanglement or information can be gained or lost under constraints.
Entropy of a thermal state ($g(N)$)
This function represents the entropy associated with a thermal state, which is crucial for defining the capacity limits. The final capacity formula is expressed directly in terms of this entropy function.

Terminology used across episodes

This episode discusses

The paper

Energy-constrained two-way capacities of the pure-loss channel · Read on arXiv

Alessandro Falco, *Francesco Anna Mele*, Ludovico Lami, Vittorio Giovannetti

Scuola Normale Superiore · Institute for Quantum Information and Matter, California Institute of Technology · NEST, Scuola Normale Superiore and Istituto Nanoscienze-CNR

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: Today's paper: "Energy-constrained two-way capacities of the pure-loss channel".

Mira: The gist:

Kai: First, who's behind it and why it matters.

Paper summary: Kai: So, to recap where we are, this paper is tackling how to calculate the two-way quantum and secret key capacities for a pure-loss channel when you have an average input photon budget constraint. The main thesis they put forward is that these two capacities are equal to a specific function involving the entropy of a thermal state.

Mira: They claim that for transmissivity eta and photon budget N, both the two-way quantum capacity Q2(L eta, N) and the secret key capacity K(L eta, N) equal g(N) - g((one - eta)N), where g is defined as (x + one) two(x + one) - x two x <ref:2610.12365#pg1,and photon budget N, both>.

Lev: That function g is crucial because it's what they use to describe the entropy of a thermal state, and they establish this identity as the main result of Theorem one point one <ref:2610.12365#pg1,the entropy of a thermal state>. They’ve also noted that this result aligns with the known reverse coherent information for a two-mode squeezed vacuum state.

Kai: It matters because it provides what they call the last missing capacity formula for the pure-loss channel, completing the picture of bosonic quantum communication under pure loss, which is pretty big for this area.

Mira: They also show how this function behaves at the boundaries; it gives zero when N is zero or eta is zero, and it equals g(N) when eta equals one. For cases between those points, like zero eta < one it approaches minus log2 (one minus eta) as N goes to infinity <ref:2610.12365#pg1>.

Lev: That asymptotic behavior recovering the unconstrained capacity PLOB17 is a key piece of the puzzle, showing how the constrained result connects back to the theoretical ideal when you have plenty of photons.

Kai: So, for someone listening just for what this paper means in broad terms, it’s about getting an exact mathematical description of communication limits when you have physical energy constraints on a lossy channel.

Mira: It shifts the focus from just having upper bounds to having a precise formula that describes the actual achievable quantum and key rates under these specific constraints.

Lev: For someone looking at error correction, this gives us a concrete quantity to work with when designing protocols, knowing exactly what the capacity is in terms of N and eta.

Kai: It sets up the groundwork for how we can analyze performance when we’re dealing with realistic setups that involve loss.

Conclusion: Kai: So, wrapping up this discussion on "Energy-constrained two-way capacities of the pure-loss channel," we see that the authors have successfully determined that Q2 and K are equal to g(N) - g((one - eta)N) for every finite N and eta <ref:2610.12365#pg1,Energy-constrained two-way capacities of the pure-loss channel>.

Mira: This means they’ve found a way to precisely quantify both how much quantum information you can send and how much secret key you can extract, given the average photon budget N you put in. It’s a complete formula for this problem under pure loss.

Lev: The authors also noted that the achievable function f eta comes from reverse reconciliation and reverse coherent information, which is important because it connects their result to existing techniques in entanglement-assisted capacity calculations.

Kai: Ultimately, what this paper does is provide the final piece of the puzzle for bosonic quantum communication when dealing with pure loss channels. It’s a complete picture that was previously missing in our understanding of these limits.

Mira: In simple terms, they’ve given us the exact mathematical tool to calculate those two-way rates when you have limitations on your input energy for a lossy channel.

Lev: For the future, this formula is what we can start using to design protocols that operate right at the edge of what's possible with finite resources.

Kai: It moves us closer to knowing exactly how much secure communication we can expect from these systems in a real-world setting where loss is unavoidable.

More episodes

← Home