We develop entanglement-of-formation potentials for feedback-assisted classical communication and one-way randomness distillation. For a finite-dimensional quantum channel without initial shared entanglement, an exact amortization theorem bounds the increase of message information plus entanglement remaining across the communicating laboratories. This proves a classical-feedback capacity bound using a mixed-convex-roof expression previously studied by Winter and Yang in the context of potential capacities. We determine the capacity of flagged mixtures of noiseless and entanglement-breaking channels, improve a published depolarizing-channel converse, and evaluate the new bound exactly for the amplitude damping channel. A state analogue gives a finite-blocklength upper bound on the net shared randomness obtainable with one-way classical communication. Amplitude-damping Choi states provide exact benchmarks, while a full-rank generalized amplitude-damping Choi state demonstrates a useful improvement where we do not evaluate the operational rate exactly. We also distinguish one-way from two-way randomness distillation: a two-round weak-measurement protocol strictly exceeds the exact one-way rate of every nontrivial qubit isotropic state. The protocol preserves quantum side information during its first decoding and extracts additional randomness in the reverse direction. This shows why the one-way state potential is not a general two-way converse. Together, these results establish a common entanglement-based approach to sharper communication and randomness bounds, while revealing how retained quantum correlations enable two-way distillation to surpass one-way limits.
AI Summary
The paper studies upper bounds on classical communication over quantum channels with noiseless classical feedback and on shared-randomness distillation with classical communication costs subtracted. It accounts jointly for extracted classical information and entanglement retained across the laboratories.
For arbitrary finite-dimensional channels without initial shared entanglement, it proves exact amortization of $I(M;B'T)+E_F(A';B'|MT)$. The maximal single-use increase equals $U_F(\mathcal N)=\sup_{\{p_x,\rho_x\}}[\chi(\{p_x,\mathcal N(\rho_x)\})+\sum_xp_x f_{\mathcal N}(\rho_x)]$, an existing mixed-convex-roof expression. A relocation inequality and pure-ensemble refinement establish the result for mixed, correlated memories. Consequently, $(1-\epsilon)\log M\le nU_F+h_2(\epsilon)$. Applications determine feedback capacity for flagged noiseless/entanglement-breaking mixtures, give $U_F\approx0.188943$ for qubit depolarizing noise at $p=1/2$ versus unassisted capacity $0.188722$, and evaluate amplitude damping exactly as $U_F(\mathcal A_\gamma)=h_2((1+\sqrt\gamma)/2)$ using a fixed-environment-measurement convexity argument.
A corresponding state potential $V_F$ upper-bounds one-way net randomness, including at finite blocklength through a weighted decoder test. For a specified full-rank generalized-amplitude-damping Choi state, interval-verified certificates give $0.43226906<R_\rightarrow\le V_F<0.45252360$, while two earlier computable bounds exceed $0.66600769$.
A two-round weak-measurement protocol with gentle decoding strictly exceeds the exact one-way rate $1-h_2(p/2)$ of every nontrivial qubit isotropic state; at $p=1/2$ it achieves $0.2114185$. This also disproves extending $V_F$ to unrestricted two-way distillation. The channel converse is weak, not strong; the results establish neither feedback advantages for depolarizing or amplitude-damping channels nor optimal two-way randomness rates.
Almost certainly largely AI-generatedAI use disclosed
ChatGPT (OpenAI) Pro 6 (Astra) was used extensively for mathematical exploration, drafting and revision, bibliographic checks, and preparation of LaTeX, TikZ, and numerical code.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
We develop entanglement-of-formation potentials for feedback-assisted classical communication and one-way randomness distillation. For a finite-dimensional quantum channel without initial shared entanglement, an exact amortization theorem bounds the increase of message information plus entanglement remaining across the communicating laboratories. This proves a classical-feedback capacity bound using a mixed-convex-roof expression previously studied by Winter and Yang in the context of potential capacities. We determine the capacity of flagged mixtures of noiseless and entanglement-breaking channels, improve a published depolarizing-channel converse, and evaluate the new bound exactly for the amplitude damping channel. A state analogue gives a finite-blocklength upper bound on the net shared randomness obtainable with one-way classical communication. Amplitude-damping Choi states provide exact benchmarks, while a full-rank generalized amplitude-damping Choi state demonstrates a useful improvement where we do not evaluate the operational rate exactly. We also distinguish one-way from two-way randomness distillation: a two-round weak-measurement protocol strictly exceeds the exact one-way rate of every nontrivial qubit isotropic state. The protocol preserves quantum side information during its first decoding and extracts additional randomness in the reverse direction. This shows why the one-way state potential is not a general two-way converse. Together, these results establish a common entanglement-based approach to sharper communication and randomness bounds, while revealing how retained quantum correlations enable two-way distillation to surpass one-way limits.
The paper studies upper bounds on classical communication over quantum channels with noiseless classical feedback and on shared-randomness distillation with classical communication costs subtracted. It accounts jointly for extracted classical information and entanglement retained across the laboratories.
For arbitrary finite-dimensional channels without initial shared entanglement, it proves exact amortization of I(M;B′T)+EF(A′;B′∣MT). The maximal single-use increase equals UF(N)=sup{px,ρx}[χ({px,N(ρx)})+∑xpxfN(ρx)], an existing mixed-convex-roof expression. A relocation inequality and pure-ensemble refinement establish the result for mixed, correlated memories. Consequently, (1−ϵ)logM≤nUF+h2(ϵ). Applications determine feedback capacity for flagged noiseless/entanglement-breaking mixtures, give UF≈0.188943 for qubit depolarizing noise at p=1/2 versus unassisted capacity 0.188722, and evaluate amplitude damping exactly as UF(Aγ)=h2((1+γ)/2) using a fixed-environment-measurement convexity argument.
A corresponding state potential VF upper-bounds one-way net randomness, including at finite blocklength through a weighted decoder test. For a specified full-rank generalized-amplitude-damping Choi state, interval-verified certificates give 0.43226906<R→≤VF<0.45252360, while two earlier computable bounds exceed 0.66600769.
A two-round weak-measurement protocol with gentle decoding strictly exceeds the exact one-way rate 1−h2(p/2) of every nontrivial qubit isotropic state; at p=1/2 it achieves 0.2114185. This also disproves extending VF to unrestricted two-way distillation. The channel converse is weak, not strong; the results establish neither feedback advantages for depolarizing or amplitude-damping channels nor optimal two-way randomness rates.
Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability p, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is h2((1+p)/2) ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for p<1, and construct a binary Kraus representation attaining the uniform formation bound.
We determine the optimal success probability for transmitting a fixed number of classical messages through a finite number of uses of the quantum erasure channel, assisted by noiseless classical feedback and without initial shared entanglement. For an input dimension d, an erasure probability p, a blocklength n, and M equiprobable messages, the optimal success probability is equal to E[min{1,dK/M}], where K is binomial with parameters n and 1−p. The converse allows arbitrary adaptive quantum encoders, quantum memories, and receiver instruments. Its main ingredient is an elementary dimension bound for noiseless quantum communication with classical feedback, proved by fixing the classical controls without conditioning the sender's state on the observed transcript. A classical protocol that transmits the base-d digits of an integer representing the message, repeating each digit until the receiver acknowledges its reception or the prescribed blocklength is reached, attains the bound for every integer M. We also establish a relative-majorization property of erasure-channel outputs and exactly evaluate a hypothesis-testing converse, recovering the same numerical bound without feedback. That converse need not be achievable without feedback: four uses of the qubit erasure channel and four messages give a strict gap. A product-state code employing tetrahedral qubit states nevertheless outperforms every classical binary erasure code with these parameters. We give an explicit message-size formula and show that the bounded-remainder normal approximation and the average-success strong-converse exponent are unchanged without feedback. We also determine the feedback-assisted error exponent below capacity, prove that it agrees with the no-feedback exponent above a critical rate, and give no-feedback bounds at lower rates.
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.
We derive general upper bounds on the distillable entanglement of a mixed state under one-way and two-way local operations and classical communication (LOCC). In both cases, the upper bound is based on a convex decomposition of the state into “useful” and “useless” quantum states. By “useful,” we mean a state whose distillable entanglement is non-negative and equal to its coherent information (and thus given by a single-letter, tractable formula). On the other hand, “useless” states are undistillable, i.e., their distillable entanglement is zero. We prove that in both settings, the distillable entanglement is convex on such decompositions. Hence, an upper bound on the distillable entanglement is obtained from the contributions of the useful states alone, being equal to the convex combination of their coherent informations. Optimizing over all such decompositions of the input state yields our upper bound. The useful and useless states are given by degradable and antidegradable states in the one-way LOCC setting, and by maximally correlated and positive partial transpose (PPT) states in the two-way LOCC setting, respectively. We also illustrate how our method can be extended to quantum channels. Interpreting our upper bound as a convex roof extension, we show that it reduces to a particularly simple, non-convex optimization problem for the classes of isotropic states and Werner states. In the one-way LOCC setting, this non-convex optimization yields an upper bound on the quantum capacity of the qubit depolarizing channel that is strictly tighter than previously known bounds for large values of the depolarizing parameter. In the two-way LOCC setting, the non-convex optimization achieves the PPT-relative entropy of entanglement for both isotropic and Werner states.
We derive explicit, absolutely convergent series formulas for the quantum, unassisted classical, and entanglement-assisted classical capacities of the qubit amplitude damping channel, eliminating residual optimizations and implicit roots. We also obtain analytical upper and lower bounds on two-way assisted quantum and private communication capacities by evaluating a balanced-squashing bound and optimizing the reverse coherent information. Our results characterize the optimal input populations, establish convergence and truncation properties, and provide analytical benchmarks for quantum and classical communication over dissipative channels.
The entanglement-assisted classical capacity of a noisy quantum channel (C/sub E/) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity C/sub E/ is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs /spl rho/, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of /spl rho/ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement-assisted communication - communication over a discrete memoryless channel (DMC) between parties who share prior random information - we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency.