Gaussian mean width strong converse bound on the classical identification capacity of quantum channels

• URL: http://arxiv.org/abs/2606.05032v1
• Date: Wed, 03 Jun 2026 16:00:02 GMT
• Title: Gaussian mean width strong converse bound on the classical identification capacity of quantum channels
• Abstract summary: 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.
• Score: 2.0305676256390934
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We establish a single-letter and efficiently computable strong converse bound on the classical identification capacity of quantum channels. 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. Using Sudakov's inequality, we bound the covering numbers of the $n$-fold channel outputs via their Gaussian mean widths in the weighted geometry, whose exponential growth in $n$ is governed by the operator norm of a single-letter positive operator. Upon optimizing over all weighing states $σ$, this yields a strong converse bound on the identification capacity of the channel, which also admits a semidefinite representation. Our method improves the best known converse bounds on the identification capacity of several important examples, such as depolarizing, Pauli, erasure, and amplitude damping channels. We also discuss extensions of this method to more general Euclidean geometries on the output space.

Related papers

• A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding [0.8594140167290097]
  An existing programming hierarchy based on symmetric extensions provides convergent upper bounds with an a priori error estimate that decays as the inverse square root of the extension level.<n>We construct a Hermitian sum-of-squares hierarchy for an arbitrary number of messages and prove quadratic convergence in its level.<n>For binary messages, the resulting bounds give a multiplicative approximation from above of the trace-norm-norm coefficient.
  arXiv  Detail & Related papers  (2026-09-09T02:40:37Z)
• 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)
• Hysteretic squashed entanglement in many-body quantum systems [42.085941481155295]
  Entanglement in many-body quantum systems is distributed across spatial regions.<n>We propose hysteretic entanglement $T_sq$, a conditional entanglement that measures the genuine quantum correlations between two subregions.<n>We show that $T_sq$ can detect genuine quantum correlations across both adjacent and long-range subsystems.
  arXiv  Detail & Related papers  (2026-03-10T17:00:49Z)
• Diagonal Unitary Covariant Superchannels [0.0]
  We present a complete characterization of diagonal unitary covariant (DU-covariant) superchannels.<n>The presented framework unifies and extends known families of covariant quantum channels.<n>Results provide a practical toolbox for symmetry-restricted higher-order quantum processes.
  arXiv  Detail & Related papers  (2025-12-30T18:08:55Z)
• 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)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• Rate-reliability tradeoff for deterministic identification [49.126395046088014]
  We find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents.<n>We also show that even if only one of the two errors is required to be exponentially small, the linearithmic scaling is lost.
  arXiv  Detail & Related papers  (2025-02-04T15:09:14Z)
• Quantum channel coding: Approximation algorithms and strong converse exponents [10.247079792798894]
  We study relaxations of entanglement-assisted quantum channel coding.<n>We present a rounding procedure that transforms any non-signaling-assisted strategy into an entanglement-assisted one.
  arXiv  Detail & Related papers  (2024-10-28T15:28:14Z)
• Exponents for classical-quantum channel simulation in purified distance [5.598487000369366]
  We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation. We critically use various properties of the quantum fidelity, additional auxiliary channel techniques, approximations via Chebyshev inequalities, and entropic continuity bounds.
  arXiv  Detail & Related papers  (2024-10-14T17:45:41Z)
• 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)
• Maximal-Capacity Discrete Memoryless Channel Identification [37.598696937684245]
  The problem of identifying the channel with the highest capacity among several memoryless channels (DMCs) is considered. A capacity estimator is proposed and tight confidence bounds on the estimator error are derived. A gap-elimination algorithm termed BestChanID is proposed, which is oblivious to the capacity-achieving input distribution. Two additional algorithms NaiveChanSel and MedianChanEl, that output with certain confidence a DMC with capacity close to the maximal, are introduced.
  arXiv  Detail & Related papers  (2024-01-18T18:44:10Z)
• Weyl channels for multipartite systems [42.37986459997699]
  Quantum channels describe unitary and non-unitary evolution of quantum systems. We show that these channels are completely characterized by elements drawn of finite cyclic groups.
  arXiv  Detail & Related papers  (2023-10-17T02:45:47Z)

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.