An information advantage can be converted into a positive communication rate using the constructed channel itself. The reduction makes exact-zero quantum and private capacity, and related one-way distillation questions, undecidable. The result. The paper turns a pair of quantum channels into one flagged channel with a four-dimensional auxiliary input. Complete information dominance holds exactly when the constructed channel has zero private capacity, and exactly when it has zero quantum capacity. A failed comparison therefore produces a positive communication rate. The construction transfers the companion paper’s undecidability to exact-zero capacity and to one-way entanglement and key distillation, even with a prescribed positive lower bound on two-way distillation. How the argument works. The comparison witness may involve a large quantum reference, which communication does not supply for free. Repeated uses of the flagged channel distribute that reference in quantum shares together with a classical key. The routing and key structure make unsuccessful patterns harmless and retain a finite positive private-information witness. Further uses of the same channel realize the helper needed to convert this private advantage into positive coherent information. All transmission and activation resources are provided by the constructed channel; no separate reference channel is assumed. Scope. The capacities are the ordinary unassisted quantum and private classical capacities of a finite-dimensional memoryless channel. The witnessing reference dimension, blocklength and positive rate may depend on the input channel pair. The undecidability distinguishes exactly zero from strictly positive capacity. It supplies no uniform positive rate gap and does not by itself obstruct additive approximation of capacity. The distillation consequences use the constructions and hypotheses stated in the paper. Related work. Complete information orders of quantum channels: equivalence and undecidability.
An information advantage can be converted into a positive communication rate using the constructed channel itself. The reduction makes exact-zero quantum and private capacity, and related one-way distillation questions, undecidable. The result. The paper turns a pair of quantum channels into one flagged channel with a four-dimensional auxiliary input. Complete information dominance holds exactly when the constructed channel has zero private capacity, and exactly when it has zero quantum capacity. A failed comparison therefore produces a positive communication rate. The construction transfers the companion paper’s undecidability to exact-zero capacity and to one-way entanglement and key distillation, even with a prescribed positive lower bound on two-way distillation. How the argument works. The comparison witness may involve a large quantum reference, which communication does not supply for free. Repeated uses of the flagged channel distribute that reference in quantum shares together with a classical key. The routing and key structure make unsuccessful patterns harmless and retain a finite positive private-information witness. Further uses of the same channel realize the helper needed to convert this private advantage into positive coherent information. All transmission and activation resources are provided by the constructed channel; no separate reference channel is assumed. Scope. The capacities are the ordinary unassisted quantum and private classical capacities of a finite-dimensional memoryless channel. The witnessing reference dimension, blocklength and positive rate may depend on the input channel pair. The undecidability distinguishes exactly zero from strictly positive capacity. It supplies no uniform positive rate gap and does not by itself obstruct additive approximation of capacity. The distillation consequences use the constructions and hypotheses stated in the paper. Related work. Complete information orders of quantum channels: equivalence and undecidability.
Several ways to ask whether one quantum channel preserves more information turn out to give the same answer when every finite quantum reference is allowed. That complete comparison remains undecidable, even for strictly positive rational measurements. The result. Quantum channels can be compared by their preservation of relative entropy, Holevo information or symmetric logarithmic derivative Fisher information. Allowing an arbitrary finite untouched quantum reference makes these three comparisons equivalent. Passing to complementary channels reverses the order. The resulting comparison problem is coRE-complete, already for measurements with strictly positive rational-complex effects. The paper also gives an additive bounded entropy defect whose value cannot be computed to any fixed positive rational additive accuracy. How the argument works. An untouched reference is an auxiliary quantum system that may be correlated with the input. Its freedom connects local Fisher-information tests to global entropy comparisons through coherent blocks and resolvent identities. A purification identity relates information retained by the receiver to information lost to the environment. For the undecidability reduction, finite nonlocal games are encoded into inverse Sylvester kernels and then into strictly positive measurement effects. Finite witnesses detect failed comparisons, but their required reference dimensions have no computable uniform bound. Scope. Each individual channel, measurement and test is finite dimensional. Completeness quantifies over every finite reference dimension, with no common bound. The equivalence is a statistical information order; it does not by itself assert that one channel can be obtained by physically processing the other. The fixed-accuracy obstruction concerns the bounded entropy defect defined in the paper. Its conclusion depends on the complete comparison and the specified exact input representation. Related work. From complete channel order to capacity and one-way distillation.
Recent examples have shown that zero private capacity need not imply antidegradability and that two channels with zero private capacity can nevertheless transmit private information together. Existing entropic channel orders compare what a receiver and its environment can learn and thereby bound capacities. We connect these orders to the recent constructions through binary estimation, whose minimum mean-square error is governed by measured χ2 divergence. A new integral representation shows how measured χ2 on a qubit extension recovers quantum χ2. It lets us pass from complete measured-χ2 ordering to complete quantum-χ2, relative-entropy, and less-noisy ordering. Zhu and Wang used a signed lift to show that their qutrit channel has zero private capacity. We show that Hermitian-smoothed measured-χ2 ordering characterizes when such lifts exist, even with a quantum reference. Environmental dominance in binary estimation at every blocklength yields a finite-code reliability--secrecy bound. These results explain why complete comparison prevents activation with antidegradable helpers whereas regularized comparison alone does not. Building on that qutrit example, we establish this stability for a range of noisy Werner--Holevo channels, determine sharp private-capacity and antidegradability thresholds, and compute exact complementary capacities in a nondegradable range. By contrast, we extend Pauli half-erasure activation to all 1/2≤p<1 and establish the same range for a new four-level family. Reference-assisted measured-χ2 witnesses show why these activating constructions lack complete comparison.
Short note with supporting code and data on Open Problem Zoo record op_d2813fe3fcdf09ad (private capacity P of the qubit depolarizing channel Lambda_p(rho) = (1-p) rho + p I/2). The record certifies P > 0 only for p ≤ 0.259824 (via the quantum capacity) and lists positivity on (0.259824, 1/3) as open. Two observations. (1) Published one-way key-distillation results already imply more: the one-way six-state rate with noisy preprocessing (Renes-Smith 2007, Kraus-Gisin-Renner 2005) is a single-use private information of this channel and is positive for p < 0.28223 (QBER = p/2), and the rates of Kern and Renes (2008) with repetition codes of length 250 are positive up to QBER 14.5741%, i.e. p = 0.291482; a short in-band lemma (send the publicly announced syndromes through extra channel uses with a classical code; I(S;B) = H(S) ≥ I(S;E) up to Fano terms) turns any such forward-announcement rate into a Devetak private information over finitely many uses, so P(Lambda_p) > 0 for all p ≤ 0.291482 with no public channel. (2) Explicit finite-n witnesses: ensembles of two classical mixed states on n ≤ 8 qubits whose private information I(X;B) - I(X;E) is positive at p = 0.28336, 0.28372, 0.28405, 0.28437, 0.28466 for n = 4, 5, 6, 7, 8 (thresholds 0.283375 ... 0.284671), above the single-use threshold 0.28223. They were found by an autonomous AI research agent (the depositor's EVO harness); the members are distributions over bit strings whose weights depend only on the Hamming weight, with the second member the bit complement of the first. Verification uses an exact closed-form block decomposition of the environment state's spectrum (no 4^n-dimensional objects); every value is recomputed in 30-digit arithmetic and agrees with double precision to about twelve digits. Negative findings of the same searches: the family is locally optimal within classical ensembles, gains ~0.0003 per added qubit, and general (quantum) members at n ≤ 3 give no gain; the finite-n frontier will not reach the key-distillation frontier at n ≤ 10. Claim boundary: lower bounds on the positivity threshold and on finite-n private informations; no capacity value, optimality or priority claim. Files: the note (PDF + LaTeX), the ensembles as JSON, the exact evaluator and verifier, the high-precision certifier, the agent's notes and search code, SHA-256 sums.
We prove an exponential strong converse for the unassisted private capacity of every finite-dimensional degradable quantum channel. We use a single error criterion: the infidelity between the actual message-estimate-environment state and an ideal state consisting of uniformly distributed, perfectly correlated messages that are independent of the environment. At every rate strictly above the channel's maximum coherent information, the optimized fidelity to this ideal state decays exponentially in the number of channel uses. The same bound holds when the ideal environment state is fixed to the actual environment marginal. The proof applies to arbitrary mixed-state encoders and arbitrary collective decoders. Its main operator ingredient is an overlap bound for privacy tests: two receiver placements with a common subsystem of dimension dC have overlap at most dC/M, where M is the key size, independently of both shield dimensions. We combine this bound with the signed averaging construction presented in arXiv:2608.01308 and a single-filter reduction to symmetric states. A Gaussian filter replaces the common receiver subsystem by a system of controlled dimension from which the original correlations can be approximately recovered using quantum side information. The filter preserves exact exchange symmetry, and a uniform smooth-entropy estimate bounds its output dimension for arbitrary correlated channel inputs. We also obtain an exponential strong converse at zero for antidegradable channels under the same joint criterion and, consequently, for the private capacity of the quantum erasure channel throughout its parameter range.
Secret-key distillation from quantum states and channels is a central task of interest in quantum information theory, as it facilitates private communication over a quantum network. Here, we study the task of secret-key distillation from bipartite states and point-to-point quantum channels using local operations and one-way classical communication (one-way LOCC). We employ the resource theory of unextendible entanglement to study the transformation of a bipartite state under one-way LOCC, and we obtain several efficiently computable upper bounds on the number of secret bits that can be distilled from a bipartite state using one-way LOCC channels; these findings apply not only in the one-shot setting but also in some restricted asymptotic settings. We extend our formalism to private communication over a quantum channel assisted by forward classical communication. We obtain efficiently computable upper bounds on the one-shot forward-assisted private capacity of a channel, thus addressing a question in the theory of quantum-secured communication that has been open for some time now. Our formalism also provides upper bounds on the rate of private communication when using a large number of channels in such a way that the error in the transmitted private data decreases exponentially with the number of channel uses. Moreover, our bounds can be computed using semidefinite programs, thus providing a computationally feasible method to understand the limits of private communication over a quantum network.
We study the symmetric-side-channel-assisted private capacity of a quantum channel, for which we provide a single- letter formula. This capacity is additive, convex, and, for degradable channels, equal to the unassisted private capacity. While a channel's (unassisted) capacity for private classical communication may be strictly larger than its quantum capacity, we will show that these capacities are equal for degradable channels, thus demonstrating the equivalence of privacy and quantum coherence in this context. We use these ideas to find new bounds on the key rate of quantum key distribution protocols with one-way classical post-processing. For the Bennett-Brassard-84 (BB84) protocol, our results demonstrate that collective attacks are strictly stronger than individual attacks.