Gaussian mean width strong converse bound on the classical identification capacity of quantum channels
Provides a tighter theoretical limit on identification capacity for quantum channels, relevant to quantum information theory.
The authors derive a single-letter, efficiently computable strong converse bound on the classical identification capacity of quantum channels, improving known bounds for depolarizing, Pauli, erasure, and amplitude damping channels.
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.