Entanglement distillation over the pure-loss bosonic channel is governed by the PLOB bound, -log2(1-η) ebits per use, but this benchmark presumes unlimited two-way classical communication. When the classical feedback budget is metered at B bits per use, the achievable rate approaches PLOB exponentially in B, yet no matching converse is known, and we argue that the standard route — static entanglement monotones — cannot work even in principle. Here we develop a converse program built on the Devetak–Harrow–Winter (DHW) characterization of one-way distillation. Our central result is a conservation law: for every rank-one instrument applied by the sending party, the single-copy communication charge R and entanglement yield E obey the exact identity R+E=S(B), the local entropy of the measured system, independent of the state; general instruments obey R+E=S(B)-S(E'|B'X), with a correction that vanishes for all projective coarse-grainings. Combining the identity with the proven quantum entropy power inequality yields an unconditional lower bound on the Bob-entropy cost of approaching PLOB, and, for the class of sharp instruments satisfying a per-instrument yield condition, a two-sided bound η^2 2^{-B} lesssim PLOB-C lesssim (e/2) η^2 2^{-B}: in this class the feedback-metered capacity provably falls short of PLOB at every finite B, with the gap determined up to a factor e/2. For two-mode-squeezed inputs — and, non-asymptotically, for the whole class of products of two-mode-squeezed states of arbitrary energies dressed by passive linear optics — we prove a complementary converse that needs no yield condition at all: a separable Gaussian witness pins the relative entropy of entanglement of the loss output to within Theta(1/bar N) of PLOB, reproducing the 2^{-B} gap scaling unconditionally for these input classes, with constants matched to within 0.78–0.94 of the achievability side for two-mode-squeezed inputs (smaller for the passive class at η ≥ 0.5). We further identify the obstruction to removing the yield condition in general: measurements can increase the reverse coherent information by up to their heralding information, E ≤ I_R + I(X;E), and we exhibit state families saturating this and show numerically that the excess is generic even for loss-channel outputs. The sharp-class converse is thereby reduced to a single variational problem, which we state precisely and conjecture to stay below PLOB; beyond the sharp class, we show the conservation law acquires a coarse-graining discount that must be bounded separately. Preprint (converse-side companion of: How many classical bits buy how much quantum capacity? Feedback-metered limits of lossy quantum communication). Ancillary files: reproduction scripts and data; code maintained at https://github.com/deeptell-inc/fmplob.
Cryptographic protocols often involve the assistance of public side channels to which all parties have perfectly noiseless access. For instance, in the BB84 quantum key distribution protocol, the side channel is used to share the bases in which Alice and Bob encoded or measured their qubits. In this paper, we find that in the case of continuous variable communication, by slightly altering this model such that Eve's copy of the initial round of feedback is corrupted by an iota of noise while keeping Alice's copies noiseless, the capacity can be increased dramatically. Specifically, it is known that the private capacity with noiseless feedback for a pure-loss bosonic channel is at most -log(1-η) bits per mode, where η is the transmissivity, in the limit of infinite input photon number. This is a very pessimistic result as there is a finite rate limit even with an arbitrarily large number of input photons. We refer to this as a loss limited rate. However, in our altered model we find that we can achieve a rate of (1/2) log(1+4ηNS) bits per mode with weak security, where NS is the input photon number. This rate diverges with NS, in sharp contrast to the result for the original model. This suggests that physical considerations behind the eavesdropping model should be taken more seriously, as they can create strong dependencies of the achievable rates on the model. For by a seemingly inconsequential weakening of Eve, we obtain a loss-unlimited rate. Our protocol also works verbatim for arbitrary i.i d, noise (not even necessarily Gaussian) injected by Eve in every round, and even if Eve is given access to copies of the initial transmission and noise. The error probability of the protocol decays super-exponentially with the blocklength.
Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that are achievable by two remote parties at the ends of a quantum channel, without restrictions on their local operations and classical communication, which can be unlimited and two-way. These two-way assisted capacities represent the ultimate rates that are reachable without quantum repeaters. Here, by constructing an upper bound based on the relative entropy of entanglement and devising a dimension-independent technique dubbed 'teleportation stretching', we establish these capacities for many fundamental channels, namely bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels in arbitrary dimension. In particular, we exactly determine the fundamental rate-loss tradeoff affecting any protocol of quantum key distribution. Our findings set the limits of point-to-point quantum communications and provide precise and general benchmarks for quantum repeaters.
How much classical information can a noisy optical channel carry when both signal energy and preshared entanglement are limited? This work gives an exact capacity frontier for this joint resource problem. It allows one to determine the best asymptotic communication rate, price the benefit of additional entanglement, and distinguish the effect of tolerating errors from that of changing how entanglement is supplied. Exact capacity under two resource constraints The setting is any fixed bosonic Gaussian channel
Φ with finitely many input and output modes. Signal energy is measured by a positive quadratic Hamiltonian
HG=21RTGR, with
G>0 and ground energy
E0;
R collects the canonical quadratures. The budgets satisfy
E≥E0 and
P≥0. For an
n-use code, the mean total signal energy is at most
nE, while the same initially shared maximally entangled state has Schmidt rank
Kn satisfying
logKn≤nP. Thus
P is a strictly supplied entanglement rate. Encoders may be arbitrary joint quantum operations, and decoding may be collective. The classical capacity is
C(E,P)=maxU≥Vphysical21Tr(GU)≤E,SG(V)≤P[SG(ΦU)+SG(V)−SG(ΦcV)]. Here
V is a Gaussian seed covariance,
U is the average-input covariance, and
U−V is the displacement-modulation covariance. A covariance is physical when
V+iΩ/2≥0, where
Ω is the canonical commutation matrix and the vacuum covariance is
I/2. The notation
SG denotes Gaussian von Neumann entropy, and
Φc is the full complementary channel, including any environment purification. All logarithms are natural, so rates are in nats per channel use. This formula replaces optimization over arbitrary quantum block codes by a finite-dimensional covariance optimization. It supplies both an achievable rate and a converse against non-Gaussian, correlated encodings. At
P=0, it also determines the unassisted capacity of general fixed finite-mode Gaussian channels, including channels without a passive decomposition into independent modes. The reduction specifies the exact capacity value; it does not require a closed-form optimizer for every device. Energy and strict entanglement supply respond differently to errors For a fixed allowed average error
0≤ε<1, the exact capacity under the mean-energy constraint is
Cε(E,P)=C(E0+1−εE−E0,P). Allowing failure rescales the mean energy above the ground state, but leaves the strict initial entanglement budget unchanged. The proof uses an exponential strong converse for codes whose inputs obey a hard total-energy cutoff. In a different model, where a readable flag permits random entanglement supply constrained only on average, the work establishes an achievable bound and a strict small-supply advantage for thermal attenuation at positive energy and fixed nonzero error. That comparison identifies the operational importance of the supply rule; it is not a complete capacity characterization of the flagged model. The communication value of entanglement For a thermal attenuator, let
0<η<1 be the transmissivity,
b>0 the output mean photon number for vacuum input, and
N the input mean photon number. Write its capacity as
CN(P), and define
g(N)=(N+1)log(N+1)−NlogN. The gain from entanglement obeys the sharp bound
0≤CN(P)−CN(0)≤1+bηP. For every fixed
N>0, the coefficient
η/(1+b) is attained as the initial right derivative at
P=0. In the low-photon limit, the stronger resource law is
CN(P)−CN(0)=1+bηmin{P,g(N)}+O(N),N↓0. The remainder is uniform over
P≥0 at fixed
η and positive
b. Noise therefore determines the conversion efficiency, while
g(N)∼Nlog(1/N) sets the entanglement scale sufficient for saturation. This uniform limit concerns the entanglement budget, not a simultaneous limit of vanishing thermal noise. Multimode resource allocation and scope A coupled two-mode example demonstrates how the frontier can guide resource allocation. A global resource-price certificate proves that a legal covariance pair exceeds the entire common-passive-frame Gaussian profile hull by at least
10−5 nat per two-mode use at specified budgets. The comparison includes all common passive frames, local squeezing and average-resource mixtures. The mechanism is the freedom to choose different mode allocations for the seed and average input; the benchmark is this precisely defined Gaussian class, rather than all unentangled encodings. The universal scope is the stated family of fixed finite-mode Gaussian channels, positive quadratic signal costs and strict initial maximally entangled Schmidt-rank supply, with unrestricted joint encoding and collective decoding. The model has no feedback or credit for returned entanglement. The capacity frontier and its resource consequences provide a common way to assess optical communication designs under these operational constraints.
Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by such entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an entanglement-breaking channel even when it is assisted by a classical feedback link from the receiver to the transmitter. In doing so, we identify a bound on the strong converse exponent, which determines the exponentially decaying rate at which the success probability tends to zero, for a sequence of codes with communication rate exceeding capacity. Proving a strong converse, along with an achievability theorem, shows that the classical capacity is a sharp boundary between reliable and unreliable communication regimes. One of the main tools in our proof is the sandwiched Rényi relative entropy. The same method of proof is used to derive an exponential bound on the success probability when communicating over an arbitrary quantum channel assisted by classical feedback, provided that the transmitter does not use entangled encoding schemes.
Abstract In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.