Strong converse bounds on the classical identification capacity of the qubit depolarizing channel

• URL: http://arxiv.org/abs/2603.29987v1
• Date: Tue, 31 Mar 2026 16:51:25 GMT
• Title: Strong converse bounds on the classical identification capacity of the qubit depolarizing channel
• Abstract summary: A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the identification rate of classical messages sent through the channel.<n>We derive strong converse bounds for the qubit depolarizing channel with noise parameter $p$, that vanish as $pto 1$.<n>In the setting of simultaneous classical identification under the constraint of complete product measurements, our converse bound matches the corresponding achievability bound.
• Score: 8.921166277011347
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an identification error necessarily converges to one. Converse bounds for identification are notoriously difficult to obtain for fully quantum channels. The only previously known converse bound, due to Atif, Pradhan and Winter [Int.~J.~Quantum Inf.~22(5):2440013, 2024], has the unsatisfactory feature of remaining strictly positive even for a completely noisy channel, for which identification is clearly impossible. We derive strong (and hence also weak) converse bounds, for the qubit depolarizing channel with noise parameter $p$, that vanish as $p\to 1$, thereby yielding the correct behavior in the completely noisy limit. Moreover, in the setting of simultaneous classical identification under the constraint of complete product measurements, our converse bound matches the corresponding achievability bound, and establishes that in this case the identification capacity equals the classical capacity of the channel.

Related papers

• A pretty-tight converse on the classical capacity of generalized amplitude-damping channels [2.3738674379518128]
  capacity of the generalized amplitude-damping channel remains an open problem in quantum Shannon theory.<n>We derive a relaxation of this measure that makes the converse bound efficiently computable.<n>Our bound is pretty tight in general and nearly coincides with the Holevo information at nonzero temperatures.
  arXiv  Detail & Related papers  (2026-09-13T15:50:01Z)
• Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels [0.0]
  We prove an exponential strong converse for every finite-dimensional degradable and antidegradable channel.<n>We also show that exponential strong-converse bounds are preserved under receiver post-processing.
  arXiv  Detail & Related papers  (2026-08-02T15:23:46Z)
• Gaussian mean width strong converse bound on the classical identification capacity of quantum channels [2.0305676256390934]
  We establish a single-letter and efficiently computable strong converse bound on the identification capacity of quantum channels.<n>By equipping the $n$-fold channel output space with a product state-weighted $$-Euclidean geometry, we allow trace-distance separation constraints for identification codes to be controlled by Euclidean covering estimates.
  arXiv  Detail & Related papers  (2026-06-03T16:00:02Z)
• Asymptotic Limits of Entanglement Distribution [43.748379918040854]
  We investigate the limits of entanglement distribution across quantum networks utilizing intermediate stations and local operations.<n>We establish a strict dichotomy: the preservation of entanglement over arbitrarily long distances is possible if the underlying quantum channel admits a correctable subspace.<n>We derive a fundamental lower bound on the physical resource requirements, proving that for channels without a correctable subspace, the number of parallel channels per link must scale at least logarithmically with the number of intermediate stations to sustain a non-zero amount of entanglement.
  arXiv  Detail & Related papers  (2026-05-22T09:56:38Z)
• Discriminating idempotent quantum channels [1.7188280334580195]
  We study binary discrimination of idempotent quantum channels.<n>We show that a simple image inclusion condition completely determines the behavior.<n>All error exponents (Stein/Chernoff/strong-converse) are explicitly computable with no adaptive advantage.
  arXiv  Detail & Related papers  (2026-03-30T15:31:40Z)
• Superadditivity of Zero-Error Capacity in Noisy Classical and Perfect Quantum Channel Pairs [0.6524460254566904]
  We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting.<n>We show that replacing the perfect quantum channel with a perfect classical channel eliminates the effect.
  arXiv  Detail & Related papers  (2026-01-13T19:00:08Z)
• Communicating Properties of Quantum States over Classical Noisy Channels [29.003268364998927]
  We introduce shadow tomography-based transmission with unequal error protection (STT-UEP)<n>It enables efficient transmission of properties of quantum states, allowing decoder-side estimation of arbitrary observables.<n>We provide theoretical guarantees on estimation accuracy as a function of the bit error probability of the classical channel.
  arXiv  Detail & Related papers  (2025-12-04T15:42:27Z)
• Achievable Identification Rates in Noisy Bosonic Broadcast Channels [3.0468273116892752]
  This work analyses identification over noisy bosonic broadcast channels using coherent states.<n>We derive achievable identification rate regions while ensuring error probabilities remain bounded, even in an infinite-dimensional setting.
  arXiv  Detail & Related papers  (2025-12-01T16:13:53Z)
• Crosstalk-Resilient Quantum MIMO for Scalable Quantum Communications [40.44880302154388]
  Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity.<n>We propose a mitigation strategy based on encoding discrete-variable quantum information into continuous-variable modes.<n>We prove the existence of a gauge-fixing decoder enabling recovery of the logical information.
  arXiv  Detail & Related papers  (2025-06-26T18:40:26Z)
• Flagged Extensions and Numerical Simulations for Quantum Channel Capacity: Bridging Theory and Computation [0.0]
  I will investigate the capacities of noisy quantum channels through a combined analytical and numerical approach.<n>I introduce novel flagged extension techniques that embed a channel into a higher-dimensional space.<n>My results refine previous bounds and clarify noise thresholds beyond which quantum transmission vanishes.
  arXiv  Detail & Related papers  (2025-06-03T22:21:08Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Zero-entropy encoders and simultaneous decoders in identification via quantum channels [49.126395046088014]
  We show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size. We show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings.
  arXiv  Detail & Related papers  (2024-02-14T11:59:23Z)
• 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)
• 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)

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.