arXiv:2610.06832
Energy-constrained two-way capacities of pure-loss and quantum-limited amplifier channels
Stefano Pirandola
Abstract
We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity $η$ and mean photon number $N$, all four capacities coincide and are given by $g(N)-g((1-η)N)$, where $g$ is the entropy of a thermal mode. This resolves the longstanding energy-constrained capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every $N>0$, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value $-\log_2(1-η)$. For parallel protocols with a hard total-photon-number cutoff, the same energy-constrained capacity formula instead satisfies an exponential strong converse. As an extension, we determine the energy-constrained two-way capacities of the quantum-limited amplifier, showing that classical assistance does not improve its unassisted quantum and private rates. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.
AI Summary
The paper addresses the finite-energy two-way assisted capacities of the pure-loss bosonic channel, asking whether the reverse-coherent-information rate remains optimal for general adaptive protocols. Energy is constrained by the unconditional mean transmitted photon number, averaged over all outcomes and unsuccessful branches; local memories are unrestricted. For transmissivity $\eta$ and input budget $N$, it establishes $Q_2=D_2=P_2=K_2=g(N)-g((1-\eta)N)$, where $g(x)=(x+1)\log_2(x+1)-x\log_2x$. The converse uses sector teleportation simulation: fixed-total-photon-number inputs admit exact channel simulation with sector-dependent entangled resources whose relative entropy of entanglement is calculated explicitly. Grouping corresponding rounds across independent replicas of an adaptive protocol removes sublinear photon-count entropy overheads, yielding an energy-dependent bound on regularized output entanglement. Fidelity and privacy tests give operational converses; sector hashing supplies matching achievability. Under the mean-energy constraint, the strong-converse thresholds instead equal the unconstrained value $-\log_2(1-\eta)$ for every $N>0$. Public randomization between an energetic protocol and vacuum transmission explains this separation. Parallel protocols with a hard total-photon cutoff satisfy an exponential strong converse at the finite-energy capacity; a vanishing cutoff tail also suffices for a strong converse. For a quantum-limited amplifier of gain $\kappa$, all four capacities equal $g(\kappa N+\kappa-1)-g((\kappa-1)(N+1))$, so two-way assistance does not improve the known unassisted rates. The cutoff strong converse is restricted to parallel inputs, not interleaved adaptive protocols. Thermal-loss capacities and an adaptive energy-dependent cutoff strong converse remain open.
used during the preparation of this manuscript to generate candidate mathematical derivations and proofs, assist with their development, and improve the presentation of the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- Detailed AI-use history added: The preparation of this work involved 43 author-directed prompts spanning mathematical development, verification, and manuscript refinement; all mathematical content was independently checked and revised by the author