Search arXivSearch

arXiv · 2401.16312

Symmetry-Enforced Quadratic Degradability Beyond Low Dimensions

Abstract

Approximate degradability provides a powerful framework for bounding the quantum and private capacities of noisy quantum channels in regimes where exact degradability fails. While generic low-noise channels exhibit a non-degradability parameter that decays as a fractional power of the noise strength, certain symmetric channels are known to display an enhanced quadratic suppression. In this work, we investigate the structural origin of this phenomenon through a family of high-dimensional, rotationally symmetric noise models constructed from angular momentum operators. We first establish that the pure noise component of these channels is maximally distinguishable from the identity channel in diamond norm, revealing a geometric orthogonality between signal and noise. Building on this structure, we construct an explicit symmetric degrading map and prove that the approximate degradability parameter scales quadratically with the noise parameter for all system dimensions. To clarify the mechanism behind this behavior, we identify algebraic conditions on the noise operators that guarantee the cancellation of leading-order non-degradability terms. These conditions apply not only to the rotationally symmetric model studied here, but also to a distinct family of high-dimensional depolarizing channels based on discrete unitary operator bases. Numerical evaluations of capacity lower bounds further illustrate the practical impact of the quadratic suppression. Together, these results demonstrate that enhanced approximate degradability arises from symmetry-induced orthogonality and invariance properties, rather than from low-dimensional or model-specific effects.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yun-Feng Lo, Yen-Chi Lee, Min-Hsiu Hsieh. 2026-01-30. Symmetry-Enforced Quadratic Degradability Beyond Low Dimensions. https://arxiv.org/abs/2401.16312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT