Quantum capacity amplification via privacy

• URL: http://arxiv.org/abs/2510.04527v2
• Date: Tue, 28 Oct 2025 03:47:53 GMT
• Title: Quantum capacity amplification via privacy
• Authors: Peixue Wu, Yunkai Wang,
• Abstract summary: We investigate superadditivity of quantum capacity through private channels whose Choi-Jamiolkowski operators are private states.<n>This perspective links the security structure of private states to quantum capacity and clarifies the role of the shield system.
• Score: 3.126118485851773
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Extreme Capacities in Generalized Direct Sum Channels [9.35201227314384]
  We construct the generalized direct sum (GDS) channel, extending conventional direct sum channels through a direct sum structure in their Kraus operators.<n>This construction forms the basis of the GDS framework, encompassing classes of channels with single-letter formula for quantum capacities and others exhibiting striking capacity features.
  arXiv  Detail & Related papers  (2025-10-12T17:25:18Z)
• Exact Quantum Capacity of Decohering Channels in Arbitrary Dimensions [0.0]
  We derive exact analytical expressions for the quantum capacity of a broad class of decohering quantum channels of the form $Lambda(rho)= (1-x)rho + x D(rho)$, where $D(rho)$ represents a structured decoherence process.<n>These channels are shown to be degradable for all noise parameters and in arbitrary dimensions, yielding closed-form, single-letter capacity formulas.
  arXiv  Detail & Related papers  (2025-06-16T12:06:26Z)
• Additivity of quantum capacities in simple non-degradable quantum channels [3.9901365062418312]
  We show that channels capable of outperforming" their environment can exhibit either strong or weak additivity of coherent information.<n>We explore a complementary construction that modifies a channel to preserve coherent information additivity while destroying the outperforming" property.
  arXiv  Detail & Related papers  (2024-09-05T22:17:29Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.<n>Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$.<n>We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel [1.5070870469725095]
  We propose a new proof method for direct coding theorems for wiretap channels.<n>The method yields errors that decay exponentially with increasing block lengths.<n>It provides a guarantee of a quantum version of semantic security.
  arXiv  Detail & Related papers  (2022-05-16T13:25:56Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Unital Qubit Queue-channels: Classical Capacity and Product Decoding [4.971638713979981]
  Quantum queue-channels arise naturally in the context of buffering in quantum networks. We show that the upper-bound on the capacity of an additive queue-channel has a simple expression, and is achievable for the erasure and depolarizing channels. Our results provide useful insights towards designing practical quantum communication networks.
  arXiv  Detail & Related papers  (2021-10-06T14:20:00Z)
• Quantum Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)
• Semantic Security for Quantum Wiretap Channels [68.24747267214373]
  We consider the problem of semantic security via classical-quantum and quantum wiretap channels. We use explicit constructions to transform a non-secure code into a semantically secure code, achieving capacity by means of biregular irreducible functions.
  arXiv  Detail & Related papers  (2020-01-16T09:55:49Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)
• Quantum and private capacities of low-noise channels [10.098114696565863]
  We determine both the quantum and the private capacities of low-noise quantum channels to leading orders. Super-additivity and degenerate codes have negligible benefit for the quantum capacity. shielding does not improve the private capacity beyond the quantum capacity.
  arXiv  Detail & Related papers  (2017-05-11T18:01:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.