Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.03706

Quantum estimation, channel orders, and private capacity

Christoph Hirche

quant-phcs.ITSubmitted Oct 2, 2026• Announced Oct 5, 2026• 0 citations
arXivHTMLPDF

Abstract

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\le 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.

AI Summary

The paper asks how estimation-based channel comparisons certify zero private capacity beyond antidegradability, and why some zero-capacity channels activate with antidegradable helpers while others cannot. It connects binary minimum mean-square estimation, measured $\chi^2$ divergence, signed observable lifts, and entropic channel orders. A coherent-qubit integral representation proves that complete measured-$\chi^2$ ordering implies complete BKM-$\chi^2$, relative-entropy, and less-noisy ordering. A Hermitian-smoothed measured-$\chi^2$ comparison characterizes complete variance-dominating signed lifts; the converse uses coupled quadratic tests and minimax. Environmental MMSE dominance for every binary encoding at every blocklength yields the finite-code bound $(1-2\eta)^2\le2\delta$, relating decoding error $\eta$ and trace-distance secrecy error $\delta$. Complete anti-less-noisiness is also characterized by zero private capacity after pairing with every finite-dimensional half-erasure channel. For noisy qutrit Werner–Holevo channels $\Lambda_x$, private capacity vanishes exactly for $x\ge1/2$, whereas antidegradability begins at $x=4/7$. Their complements have exact capacities $P=Q=h_2(x)-(1-x)\log_2 3$ for $x\ge1/2$, including a nondegradable interval. These conclusions use inherited signed-lift certificates, symmetric extensions, covariance, and coherent-information concavity. For a previously constructed two-qubit Pauli channel, erasure-assisted activation extends to every $1/2\le p<1$, with rate at least $\ln2(1-p)^2/[216p(1+\sqrt3)]$. A continuous four-level ladder family activates throughout the same range. Transpose simulation certifies zero individual capacity; receiver support asymmetry supplies linear signal gain against quadratic environmental leakage. Open limitations include whether complete unsmoothed measured-$\chi^2$ ordering generally implies a signed lift, and whether every non-antidegradable transpose-antidegradable channel admits an antidegradable activator. Activation rates are lower bounds, not optimized capacities.

Likely largely AI-generatedAI use disclosed
contributed to the mathematical proofs in this work, including proposing proof strategies, deriving intermediate results, and drafting and revising proof arguments. It also assisted with literature searches, numerical checks, exposition, figures, and \LaTeX{} production.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
40 pages

Related papers

Private communication via zero-private-capacity quantum channels

Chengkai Zhu, Xin Wang

Private communication over a noisy quantum channel requires reliable transmission to the receiver and secrecy from the environment. Whether two channels with zero private capacity can jointly enable private communication is a longstanding open problem in quantum information theory. Here we resolve this problem by exhibiting a four-level channel and a qubit erasure channel with half erasure probability, each with zero private capacity, whose joint use achieves more than 0.0001903 private bits per product use. The encoding gives the receiver a linear information gain with at most quadratic environmental leakage, enabling privacy through a fixed joint measurement and classical coding. This superactivation, impossible for independent classical memoryless wiretap channels, shows that a channel's private capacity alone does not determine its value for secure communication. The initial activation example was identified through interactions with large language models, and the result has been formalized in Lean 4.

quant-pharXiv:2609.10520•Sep 10, 2026•2 citations

Private communication from Pauli channels with no privacy

Uthirakalyani G, Pritam Halder, David Elkouss

A channel capacity quantifies the communication capability of a noisy physical process. In contrast to communication channels in the classical world, quantum theory makes this capability contextual. We show that two Pauli two-qubit channels, each with zero private classical capacity, can be used to transmit private information when used together. One is a two-qubit Pauli channel whose environment can reconstruct the receiver output up to matrix transposition; the other is an antidegradable channel. We obtain a similar result when the second channel is the 50% qubit erasure channel. A simple binary code built from rank-three mixtures of Bell states activates private communication. The main ingredient in our construction is a transpose-antidegradable channel that is not antidegradable.

quant-pharXiv:2609.20133•Sep 18, 2026•1 citation

An exponential strong converse for private communication over degradable quantum channels

Mark M. Wilde

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 $d_C$ have overlap at most $d_C/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.

quant-pharXiv:2609.32515•Sep 29, 2026•2 citations

Complete information orders of quantum channels: equivalence and undecidability

Harjas Sandhu

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.

•Oct 14, 2026•2 citations

From complete channel order to capacity and one-way distillation

Harjas Sandhu

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.

•Oct 14, 2026•0 citations

Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels

Tulja Varun Kondra, Raphael Brinster, Hermann Kampermann +2 more

The quantum capacity of a noisy channel quantifies the maximum rate at which quantum information can be transmitted reliably. For general channels, its evaluation requires an optimization over arbitrarily many channel uses. Degradable channels form a central exception: their capacity is given by the single-letter coherent information, while antidegradable channels have zero capacity. Nevertheless, even for these fundamental classes, it has remained open whether communication above capacity becomes possible when a fixed non-maximal error is tolerated. Here we resolve this problem by proving an exponential strong converse for every finite-dimensional degradable and antidegradable channel: at any rate above capacity, the fidelity of every coding scheme decays exponentially with the number of channel uses. As an immediate consequence, we establish the first all-code exponential strong converse for the quantum erasure channel throughout its full parameter range, strengthening previous results that applied only to almost all codes. We also show that exponential strong-converse bounds are preserved under receiver post-processing. This yields efficiently computable semidefinite-programming bounds for arbitrary finite-dimensional channels, improved bounds for Pauli channels, and an exact exponential strong converse for a nondegradable multilevel amplitude-damping family.

quant-pharXiv:2608.01308•Aug 4, 2026•6 citations
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χ^2χ2 divergence. A new integral representation shows how measured χ2χ^2χ2 on a qubit extension recovers quantum χ2χ^2χ2. It lets us pass from complete measured-χ2χ^2χ2 ordering to complete quantum-χ2χ^2χ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χ^2χ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<11/2\le p<11/2≤p<1 and establish the same range for a new four-level family. Reference-assisted measured-χ2χ^2χ2 witnesses show why these activating constructions lack complete comparison.
The paper asks how estimation-based channel comparisons certify zero private capacity beyond antidegradability, and why some zero-capacity channels activate with antidegradable helpers while others cannot. It connects binary minimum mean-square estimation, measured χ2\chi^2χ2 divergence, signed observable lifts, and entropic channel orders.
A coherent-qubit integral representation proves that complete measured-χ2\chi^2χ2 ordering implies complete BKM-χ2\chi^2χ2, relative-entropy, and less-noisy ordering. A Hermitian-smoothed measured-χ2\chi^2χ2 comparison characterizes complete variance-dominating signed lifts; the converse uses coupled quadratic tests and minimax. Environmental MMSE dominance for every binary encoding at every blocklength yields the finite-code bound (1−2η)2≤2δ(1-2\eta)^2\le2\delta(1−2η)2≤2δ, relating decoding error η\etaη and trace-distance secrecy error δ\deltaδ. Complete anti-less-noisiness is also characterized by zero private capacity after pairing with every finite-dimensional half-erasure channel.
For noisy qutrit Werner–Holevo channels Λx\Lambda_xΛx​, private capacity vanishes exactly for x≥1/2x\ge1/2x≥1/2, whereas antidegradability begins at x=4/7x=4/7x=4/7. Their complements have exact capacities P=Q=h2(x)−(1−x)log⁡23P=Q=h_2(x)-(1-x)\log_2 3P=Q=h2​(x)−(1−x)log2​3 for x≥1/2x\ge1/2x≥1/2, including a nondegradable interval. These conclusions use inherited signed-lift certificates, symmetric extensions, covariance, and coherent-information concavity.
For a previously constructed two-qubit Pauli channel, erasure-assisted activation extends to every 1/2≤p<11/2\le p<11/2≤p<1, with rate at least ln⁡2(1−p)2/[216p(1+3)]\ln2(1-p)^2/[216p(1+\sqrt3)]ln2(1−p)2/[216p(1+3​)]. A continuous four-level ladder family activates throughout the same range. Transpose simulation certifies zero individual capacity; receiver support asymmetry supplies linear signal gain against quadratic environmental leakage.
Open limitations include whether complete unsmoothed measured-χ2\chi^2χ2 ordering generally implies a signed lift, and whether every non-antidegradable transpose-antidegradable channel admits an antidegradable activator. Activation rates are lower bounds, not optimized capacities.
Private communication over a noisy quantum channel requires reliable transmission to the receiver and secrecy from the environment. Whether two channels with zero private capacity can jointly enable private communication is a longstanding open problem in quantum information theory. Here we resolve this problem by exhibiting a four-level channel and a qubit erasure channel with half erasure probability, each with zero private capacity, whose joint use achieves more than 0.0001903 private bits per product use. The encoding gives the receiver a linear information gain with at most quadratic environmental leakage, enabling privacy through a fixed joint measurement and classical coding. This superactivation, impossible for independent classical memoryless wiretap channels, shows that a channel's private capacity alone does not determine its value for secure communication. The initial activation example was identified through interactions with large language models, and the result has been formalized in Lean 4.
A channel capacity quantifies the communication capability of a noisy physical process. In contrast to communication channels in the classical world, quantum theory makes this capability contextual. We show that two Pauli two-qubit channels, each with zero private classical capacity, can be used to transmit private information when used together. One is a two-qubit Pauli channel whose environment can reconstruct the receiver output up to matrix transposition; the other is an antidegradable channel. We obtain a similar result when the second channel is the 50% qubit erasure channel. A simple binary code built from rank-three mixtures of Bell states activates private communication. The main ingredient in our construction is a transpose-antidegradable channel that is not antidegradable.
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 dCd_CdC​ have overlap at most dC/Md_C/MdC​/M, where MMM 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.
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.
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.
The quantum capacity of a noisy channel quantifies the maximum rate at which quantum information can be transmitted reliably. For general channels, its evaluation requires an optimization over arbitrarily many channel uses. Degradable channels form a central exception: their capacity is given by the single-letter coherent information, while antidegradable channels have zero capacity. Nevertheless, even for these fundamental classes, it has remained open whether communication above capacity becomes possible when a fixed non-maximal error is tolerated. Here we resolve this problem by proving an exponential strong converse for every finite-dimensional degradable and antidegradable channel: at any rate above capacity, the fidelity of every coding scheme decays exponentially with the number of channel uses. As an immediate consequence, we establish the first all-code exponential strong converse for the quantum erasure channel throughout its full parameter range, strengthening previous results that applied only to almost all codes. We also show that exponential strong-converse bounds are preserved under receiver post-processing. This yields efficiently computable semidefinite-programming bounds for arbitrary finite-dimensional channels, improved bounds for Pauli channels, and an exact exponential strong converse for a nondegradable multilevel amplitude-damping family.