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

Quantum capacity amplification via privacy

Peixue Wu, Yunkai Wang

Published Oct 6, 2025• 2 citations
arXivHTMLPDF

Abstract

We investigate superadditivity of quantum capacity through private channels whose Choi-Jamiolkowski operators are private states. This perspective links the security structure of private states to quantum capacity and clarifies the role of the shield system: information encoded in the shield system that would otherwise leak to the environment can be recycled when paired with an assisting channel, thereby boosting capacity. Our main contributions are threefold: Firstly, we develop a general framework that provides a sufficient condition for capacity amplification, which is formulated in terms of the assisting channel's Holevo information. As examples, we give explicit, dimension and parameter dependent amplification thresholds for erasure and depolarizing channels. Secondly, assuming the Spin alignment conjecture, we derive a single-letter expression for the quantum capacity of a family of private channels that are neither degradable, anti-degradable, nor PPT; as an application, we construct channels with vanishing quantum capacity yet unbounded private capacity. Thirdly, we further analyze approximate private channels: we give an alternative proof of superactivation that extends its validity to a broader parameter regime, and, by combining amplification bounds with continuity estimates, we establish a metric separation showing that channels exhibiting capacity amplification have nonzero diamond distance from the set of anti-degradable channels, indicating that existing approximate (anti-)degradability bounds are not tight. We also revisit the computability of the regularized quantum capacity and modestly suggest that this fundamental question still remains open.

DOI
10.48550/arxiv.2510.04527

Related papers

Quantum Capacity Amplification via Privacy

Peixue Wu, Yunkai Wang

Quantum capacity exhibits intriguing phenomena such as super-activation, amplification, and super-amplification, which can be explored using constructions based on private channels. In this work, we refine the connection between private channels and additivity questions in quantum channel capacity. Specifically, the shield system, which safeguards the key system's privacy by leaking quantum information, can recover some of this lost information when paired with an auxiliary channel like the erasure channel$\mathcal{E}_{p}$, thereby enhancing overall capacity. Building on this insight, we construct new and simple examples of super-amplification for the erasure channel$\mathcal{E}_{p}$with any erasure probability$p$. In addition, we provide a refined version of the Smith-Yard argument that also applies for arbitrary$p$. Finally, we revisit the fundamental question of whether regularization in channel capacity formulas requires infinitely many channel uses, showing that the necessary number may instead depend on the channel's dimension.

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•0 citations

Superadditivity of quantum channel capacity

Fatih Özaydin, Şahin Kaya Özdemir, Masato Koashi +1 more

Superadditivity of quantum capacity of communication channels is one of the most interesting findings of the field. Yard and Smith, finding a relation between the private capacity and the assisted quantum capacity, showed a striking example of superadditivity, i.e. two channels of zero quantum capacity could achieve a positive quantum capacity when used together [1]. The four dimensional channels they used are a 50% erasure channel (therefore zero quantum capacity, due to no-cloning theorem) and a Horodecki channel (again zero quantum capacity due to incapability of sharing free entanglement). In this work we present the more general cases of superadditivity. Directly calculating the lower bounds of joint quantum capacities without using the relation between private capacity and assisted quantum capacity, we examine scenarios considering erasure channels of arbitrary probabilities and different Horodecki channels, and discuss the roles of degradability and anti-degradability as well as the role of the private capacity in superadditivity. We also derive an upper bound for the joint quantum capacity for the superactivation case.

AIP conference proceedings•Jan 1, 2012•0 citations

Quantum and Private Capacities of Low-Noise Channels

Felix Leditzky, Debbie Leung, Graeme Smith

We determine both the quantum and the private capacities of low-noise quantum channels to leading orders in the channel's distance to the perfect channel. It has been an open problem for more than 20 yr to determine the capacities of some of these low-noise channels such as the depolarizing channel. We also show that both capacities are equal to the single-letter coherent information of the channel, again to leading orders. We thus find that, in the low-noise regime, superadditivity and degenerate codes have a negligible benefit for the quantum capacity, and shielding does not improve the private capacity beyond the quantum capacity, in stark contrast to the situation when noisier channels are considered.

arXiv:1705.04335•Physical Review Letters•Apr 20, 2018•47 citations

Quantum Capacity Can Be Greater Than Private Information for Arbitrarily Many Uses

David Elkouss, Sergii Strelchuk

The quantum capacity of a quantum channel is always smaller than the capacity of the channel for private communication. However, both quantities are given by the infinite regularization of respectively the coherent and the private information. Here, we construct a family of channels for which the private and coherent information can remain strictly superadditive for unbounded number of uses. We prove this by showing that the coherent information is strictly larger than the private information of a smaller number of uses of the channel. It turns out that even though the quantum capacity is upper bounded by the private capacity, the non-regularized quantities can be interleaved. From an operational point of view, the private capacity can be used for gauging the practical value of quantum channels for secure communication and, consequently, for key distribution. We thus show that in order to evaluate the interest a channel for this task it is necessary to optimize the private information over an unlimited number of uses of the channel.

Leibniz international proceedings in informatics•Jan 1, 2015•0 citations

Pursuing the Fundamental Limits for Quantum Communication

Xin Wang

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels, since the extensions of the channel can be considered as assistance from the environment. By optimizing the parametrized extended channels with specific structures such as the flag structure, we obtain new upper bounds on the quantum capacity of the original quantum channel. Furthermore, we extend our approach to estimating the fundamental limits of private communication and one-way entanglement distillation. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds for certain regimes.

arXiv:1912.00931•IEEE Transactions on Information Theory•Mar 24, 2021•24 citations

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
We investigate superadditivity of quantum capacity through private channels whose Choi-Jamiolkowski operators are private states. This perspective links the security structure of private states to quantum capacity and clarifies the role of the shield system: information encoded in the shield system that would otherwise leak to the environment can be recycled when paired with an assisting channel, thereby boosting capacity. Our main contributions are threefold: Firstly, we develop a general framework that provides a sufficient condition for capacity amplification, which is formulated in terms of the assisting channel's Holevo information. As examples, we give explicit, dimension and parameter dependent amplification thresholds for erasure and depolarizing channels. Secondly, assuming the Spin alignment conjecture, we derive a single-letter expression for the quantum capacity of a family of private channels that are neither degradable, anti-degradable, nor PPT; as an application, we construct channels with vanishing quantum capacity yet unbounded private capacity. Thirdly, we further analyze approximate private channels: we give an alternative proof of superactivation that extends its validity to a broader parameter regime, and, by combining amplification bounds with continuity estimates, we establish a metric separation showing that channels exhibiting capacity amplification have nonzero diamond distance from the set of anti-degradable channels, indicating that existing approximate (anti-)degradability bounds are not tight. We also revisit the computability of the regularized quantum capacity and modestly suggest that this fundamental question still remains open.
Quantum capacity exhibits intriguing phenomena such as super-activation, amplification, and super-amplification, which can be explored using constructions based on private channels. In this work, we refine the connection between private channels and additivity questions in quantum channel capacity. Specifically, the shield system, which safeguards the key system's privacy by leaking quantum information, can recover some of this lost information when paired with an auxiliary channel like the erasure channelEp\mathcal{E}_{p}Ep​, thereby enhancing overall capacity. Building on this insight, we construct new and simple examples of super-amplification for the erasure channelEp\mathcal{E}_{p}Ep​with any erasure probabilityppp. In addition, we provide a refined version of the Smith-Yard argument that also applies for arbitraryppp. Finally, we revisit the fundamental question of whether regularization in channel capacity formulas requires infinitely many channel uses, showing that the necessary number may instead depend on the channel's dimension.
Superadditivity of quantum capacity of communication channels is one of the most interesting findings of the field. Yard and Smith, finding a relation between the private capacity and the assisted quantum capacity, showed a striking example of superadditivity, i.e. two channels of zero quantum capacity could achieve a positive quantum capacity when used together [1]. The four dimensional channels they used are a 50% erasure channel (therefore zero quantum capacity, due to no-cloning theorem) and a Horodecki channel (again zero quantum capacity due to incapability of sharing free entanglement). In this work we present the more general cases of superadditivity. Directly calculating the lower bounds of joint quantum capacities without using the relation between private capacity and assisted quantum capacity, we examine scenarios considering erasure channels of arbitrary probabilities and different Horodecki channels, and discuss the roles of degradability and anti-degradability as well as the role of the private capacity in superadditivity. We also derive an upper bound for the joint quantum capacity for the superactivation case.
We determine both the quantum and the private capacities of low-noise quantum channels to leading orders in the channel's distance to the perfect channel. It has been an open problem for more than 20 yr to determine the capacities of some of these low-noise channels such as the depolarizing channel. We also show that both capacities are equal to the single-letter coherent information of the channel, again to leading orders. We thus find that, in the low-noise regime, superadditivity and degenerate codes have a negligible benefit for the quantum capacity, and shielding does not improve the private capacity beyond the quantum capacity, in stark contrast to the situation when noisier channels are considered.
The quantum capacity of a quantum channel is always smaller than the capacity of the channel for private communication. However, both quantities are given by the infinite regularization of respectively the coherent and the private information. Here, we construct a family of channels for which the private and coherent information can remain strictly superadditive for unbounded number of uses. We prove this by showing that the coherent information is strictly larger than the private information of a smaller number of uses of the channel. It turns out that even though the quantum capacity is upper bounded by the private capacity, the non-regularized quantities can be interleaved. From an operational point of view, the private capacity can be used for gauging the practical value of quantum channels for secure communication and, consequently, for key distribution. We thus show that in order to evaluate the interest a channel for this task it is necessary to optimize the private information over an unlimited number of uses of the channel.
The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels, since the extensions of the channel can be considered as assistance from the environment. By optimizing the parametrized extended channels with specific structures such as the flag structure, we obtain new upper bounds on the quantum capacity of the original quantum channel. Furthermore, we extend our approach to estimating the fundamental limits of private communication and one-way entanglement distillation. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds for certain regimes.
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.