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:2609.20133

Private communication from Pauli channels with no privacy

Uthirakalyani G, Pritam Halder, David Elkouss

quant-phSubmitted Sep 17, 2026• Announced Sep 18, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

Can two channels with zero private classical capacity jointly transmit private information? This paper establishes that they can, using two explicit two-qubit Pauli channels $\mathcal F$ and $\mathcal G$. It proves $P(\mathcal F)=P(\mathcal G)=0$ while $P(\mathcal F\otimes\mathcal G)\geq 0.00338974$ bits per joint use. The same private-information bound holds when $\mathcal G$ is replaced by the 50% qubit erasure channel. The channel $\mathcal F$ uniformly mixes six Pauli errors and has input, output, and environment dimensions $(4,4,6)$. An explicit isometric construction shows that its environment can reconstruct the receiver’s output up to matrix transposition. Spectrum preservation under full transposition, together with data processing, proves zero private capacity for arbitrary block lengths. The helper $\mathcal G$ is explicitly shown to be antidegradable. A binary ensemble of rank-three states, built from computational-basis states and Bell-state mixtures, yields positive private information; the bound follows from exact output spectra and entropy calculations. Positivity also proves that $\mathcal F$ is neither antidegradable nor anti-completely-less-noisy. Coherentizing this code with an additional six-dimensional 50% erasure channel gives quantum-capacity superactivation in which both constituent channels have zero private capacity. An analogous independent construction is acknowledged, with dimensions $(4,4,8)$ for its transpose-antidegradable channel. The paper leaves open smaller-dimensional examples and whether every transpose-antidegradable but non-antidegradable channel admits an antidegradable partner activating private capacity; exact capacities are not determined.

No sign of AI-generated text

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

Comments
11 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

Quantum estimation, channel orders, and private capacity

Christoph Hirche

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.

quant-pharXiv:2610.03706•Oct 5, 2026•0 citations

Polar Codes for Private and Quantum Communication Over Arbitrary Channels

Joseph M. Renes, Mark M. Wilde

We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information, and in the latter, the symmetric private information. Both schemes are built from a polar coding construction capable of transmitting classical information over a quantum channel. Appropriately merging two such classical-quantum schemes, one for transmitting amplitude information and the other for transmitting phase, leads to the new private and quantum coding schemes, similar to the construction for Pauli and erasure channels of Renes et al. The encoding is entirely similar to the classical case, and thus efficient. The decoding can also be performed by successive cancellation, as in the classical case, but no efficient successive cancellation scheme is yet known for arbitrary quantum channels. An efficient code construction is unfortunately still unknown. Generally, our two coding schemes require entanglement or secret-key assistance, respectively, but we extend two known conditions under which the needed assistance rate vanishes. Finally, although our results are formulated for qubit channels, we show how the scheme can be extended to multiple qubits. This then demonstrates a near-explicit coding method for realizing one of the most striking phenomena in quantum information theory: the superactivation effect, whereby two quantum channels, which individually have zero quantum capacity can have a nonzero quantum capacity when used together.

arXiv:1212.2537•IEEE Transactions on Information Theory•Mar 31, 2014•55 citations

Extensive Nonadditivity of Privacy

Graeme Smith, John A. Smolin

Quantum information theory establishes the ultimate limits on communication and cryptography in terms of channel capacities for various types of information. The private capacity is particularly important because it quantifies achievable rates of quantum key distribution. We study the power of quantum channels with limited private capacity, focusing on channels that dephase in random bases. These display extensive nonadditivity of private capacity: a channel with 2logd input qubits that has a private capacity less than 2, but when used together with a second channel with zero private capacity, the joint capacity jumps to (1/2)logd. In contrast to earlier work which found nonadditivity vanishing as a fraction of input size or conditional on unproven mathematical assumptions, this provides a natural setting manifesting nonadditivity of privacy of the strongest possible sort.

arXiv:0904.4050•Physical Review Letters•Sep 18, 2009•59 citations

Parameter Regime Giving Zero Quantum Coherent Information of A Non-Pauli Quantum Channel

Tong Liu

In quantum information theory, in order for two (or more) parties to communicate, there must be a communication channel. The two central quantities that must be considered are quantum channel capacity and the quantum coherent information. The first describes the capability for a given channel to communicate the required quantum information and the latter describes the amount of information that has been successfully transmitted through the corresponding quantum channel. The capacity of a quantum channel is actually a function of the coherent information, and so the basic step for getting the channel capacity is to calculate its coherent information which serves as a lower bound on the capacity. Generally speaking, it is hard to find the capacity of a given quantum channel, this is because of regularization which is to introduce additional process to solve an ill-conditioned problem. Comparing to general quantum channels, the capacity is easily achieved for the two fundamental classes of quantum channels, degradable and antidegradable, in such a way that degradable channels have capacity given exactly by the coherent information and antidegradable channels have zero coherent information. However, this is not true for general quantum channels, by all means that, under certain restrictions, it is possible to find a non-Pauli quantum channel such that its coherent information is zero but its capacity is non-zero.

•Dec 1, 2015•0 citations

The Private Classical Capacity and Quantum Capacity of a Quantum Channel

Igor Devetak

A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward public classical communication. Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical information and quantum information are exploited to obtain an expression for the capacity of a quantum channel for generating pure bipartite entanglement. The latter implies a new proof of the quantum channel coding theorem and a simple proof of the converse. The coherent information plays a role in all of the above mentioned capacities

arXiv:quant-ph/0304127•IEEE Transactions on Information Theory•Jan 1, 2005•840 citations
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.
Can two channels with zero private classical capacity jointly transmit private information? This paper establishes that they can, using two explicit two-qubit Pauli channels F\mathcal FF and G\mathcal GG. It proves P(F)=P(G)=0P(\mathcal F)=P(\mathcal G)=0P(F)=P(G)=0 while P(F⊗G)≥0.00338974P(\mathcal F\otimes\mathcal G)\geq 0.00338974P(F⊗G)≥0.00338974 bits per joint use. The same private-information bound holds when G\mathcal GG is replaced by the 50% qubit erasure channel.
The channel F\mathcal FF uniformly mixes six Pauli errors and has input, output, and environment dimensions (4,4,6)(4,4,6)(4,4,6). An explicit isometric construction shows that its environment can reconstruct the receiver’s output up to matrix transposition. Spectrum preservation under full transposition, together with data processing, proves zero private capacity for arbitrary block lengths. The helper G\mathcal GG is explicitly shown to be antidegradable. A binary ensemble of rank-three states, built from computational-basis states and Bell-state mixtures, yields positive private information; the bound follows from exact output spectra and entropy calculations. Positivity also proves that F\mathcal FF is neither antidegradable nor anti-completely-less-noisy.
Coherentizing this code with an additional six-dimensional 50% erasure channel gives quantum-capacity superactivation in which both constituent channels have zero private capacity. An analogous independent construction is acknowledged, with dimensions (4,4,8)(4,4,8)(4,4,8) for its transpose-antidegradable channel. The paper leaves open smaller-dimensional examples and whether every transpose-antidegradable but non-antidegradable channel admits an antidegradable partner activating private capacity; exact capacities are not determined.
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.
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.
We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information, and in the latter, the symmetric private information. Both schemes are built from a polar coding construction capable of transmitting classical information over a quantum channel. Appropriately merging two such classical-quantum schemes, one for transmitting amplitude information and the other for transmitting phase, leads to the new private and quantum coding schemes, similar to the construction for Pauli and erasure channels of Renes et al. The encoding is entirely similar to the classical case, and thus efficient. The decoding can also be performed by successive cancellation, as in the classical case, but no efficient successive cancellation scheme is yet known for arbitrary quantum channels. An efficient code construction is unfortunately still unknown. Generally, our two coding schemes require entanglement or secret-key assistance, respectively, but we extend two known conditions under which the needed assistance rate vanishes. Finally, although our results are formulated for qubit channels, we show how the scheme can be extended to multiple qubits. This then demonstrates a near-explicit coding method for realizing one of the most striking phenomena in quantum information theory: the superactivation effect, whereby two quantum channels, which individually have zero quantum capacity can have a nonzero quantum capacity when used together.
Quantum information theory establishes the ultimate limits on communication and cryptography in terms of channel capacities for various types of information. The private capacity is particularly important because it quantifies achievable rates of quantum key distribution. We study the power of quantum channels with limited private capacity, focusing on channels that dephase in random bases. These display extensive nonadditivity of private capacity: a channel with 2logd input qubits that has a private capacity less than 2, but when used together with a second channel with zero private capacity, the joint capacity jumps to (1/2)logd. In contrast to earlier work which found nonadditivity vanishing as a fraction of input size or conditional on unproven mathematical assumptions, this provides a natural setting manifesting nonadditivity of privacy of the strongest possible sort.
In quantum information theory, in order for two (or more) parties to communicate, there must be a communication channel. The two central quantities that must be considered are quantum channel capacity and the quantum coherent information. The first describes the capability for a given channel to communicate the required quantum information and the latter describes the amount of information that has been successfully transmitted through the corresponding quantum channel. The capacity of a quantum channel is actually a function of the coherent information, and so the basic step for getting the channel capacity is to calculate its coherent information which serves as a lower bound on the capacity. Generally speaking, it is hard to find the capacity of a given quantum channel, this is because of regularization which is to introduce additional process to solve an ill-conditioned problem. Comparing to general quantum channels, the capacity is easily achieved for the two fundamental classes of quantum channels, degradable and antidegradable, in such a way that degradable channels have capacity given exactly by the coherent information and antidegradable channels have zero coherent information. However, this is not true for general quantum channels, by all means that, under certain restrictions, it is possible to find a non-Pauli quantum channel such that its coherent information is zero but its capacity is non-zero.
A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward public classical communication. Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical information and quantum information are exploited to obtain an expression for the capacity of a quantum channel for generating pure bipartite entanglement. The latter implies a new proof of the quantum channel coding theorem and a simple proof of the converse. The coherent information plays a role in all of the above mentioned capacities