IEEE Transactions on Information Theory最新文献_第10页

Corrections to “From Classical to Quantum: Uniform Continuity Bounds on Entropies in Infinite Dimensions” 对“从经典到量子：无限维中熵的一致连续界”的修正

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-22 DOI: 10.1109/TIT.2025.3532776

Simon Becker;Nilanjana Datta;Michael G. Jabbour

引用次数: 0

Entanglement Cost of Discriminating Quantum States Under Locality Constraints 局域约束下判别量子态的纠缠代价

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-22 DOI: 10.1109/TIT.2025.3532701

Chenghong Zhu;Chengkai Zhu;Zhiping Liu;Xin Wang

{"title":"Entanglement Cost of Discriminating Quantum States Under Locality Constraints","authors":"Chenghong Zhu;Chengkai Zhu;Zhiping Liu;Xin Wang","doi":"10.1109/TIT.2025.3532701","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532701","url":null,"abstract":"The unique features of entanglement and non-locality in quantum systems, where there are pairs of bipartite states perfectly distinguishable by general entangled measurements yet indistinguishable by local operations and classical communication, hold significant importance in quantum entanglement theory, distributed quantum information processing, and quantum data hiding. This paper delves into the entanglement cost for discriminating two bipartite quantum states, employing positive operator-valued measures (POVMs) with positive partial transpose (PPT) to achieve optimal success probability through general entangled measurements. We first introduce two quantities called the spectral PPT-distance and relative spectral PPT-distance of a POVM to quantify the localness of a general measurement. We show these quantities are related to the entanglement cost of optimal discrimination by PPT POVMs. Following this, we establish bounds and develop SDP hierarchies to estimate the entanglement cost of optimal discrimination by PPT POVMs for any pair of states. Leveraging these results, we show that a pure state can be optimally discriminated against any other state with the assistance of a single Bell state. This study advances our understanding of the pivotal role played by entanglement in quantum state discrimination, serving as a crucial element in unlocking quantum data hiding against locally constrained measurements.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2826-2837"},"PeriodicalIF":2.2,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Efficient Solvers for Wyner Common Information With Application to Multi-Modal Clustering Wyner公共信息的高效求解及其在多模态聚类中的应用

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-20 DOI: 10.1109/TIT.2025.3532280

Teng-Hui Huang;Hesham El Gamal

引用次数: 0

Intersection and Union of Subspaces With Applications to Communication Over Authenticated Classical-Quantum Channels and Composite Hypothesis Testing 子空间的交并及其在经典量子信道通信中的应用及复合假设检验

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-20 DOI: 10.1109/TIT.2025.3531565

Naqueeb Ahmad Warsi;Ayanava Dasgupta

引用次数: 0

Asymptotically Optimal Codes for (t, s)-Burst Error （t, s）-突发错误的渐近最优码

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-20 DOI: 10.1109/TIT.2025.3531915

Yubo Sun;Ziyang Lu;Yiwei Zhang;Gennian Ge

{"title":"Asymptotically Optimal Codes for (t, s)-Burst Error","authors":"Yubo Sun;Ziyang Lu;Yiwei Zhang;Gennian Ge","doi":"10.1109/TIT.2025.3531915","DOIUrl":"https://doi.org/10.1109/TIT.2025.3531915","url":null,"abstract":"Recently, codes for correcting a burst of errors have attracted significant attention. One of the most important reasons is that bursts of errors occur in certain emerging techniques, such as DNA storage. In this paper, we investigate a type of error, called a <inline-formula> <tex-math>$(t,s)$ </tex-math></inline-formula>-burst, which deletes t consecutive symbols and inserts s arbitrary symbols at the same coordinate. Note that a <inline-formula> <tex-math>$(t,s)$ </tex-math></inline-formula>-burst error can be seen as a generalization of a burst of insertions (<inline-formula> <tex-math>$t=0$ </tex-math></inline-formula>), a burst of deletions (<inline-formula> <tex-math>$s=0$ </tex-math></inline-formula>), and a burst of substitutions (<inline-formula> <tex-math>$t=s$ </tex-math></inline-formula>). Our main contribution is to give explicit constructions of q-ary <inline-formula> <tex-math>$(t,s)$ </tex-math></inline-formula>-burst correcting codes with <inline-formula> <tex-math>$log n + O(1)$ </tex-math></inline-formula> bits of redundancy for any given constant non-negative integers t, s, and <inline-formula> <tex-math>$q geq 2$ </tex-math></inline-formula>. These codes have optimal redundancy up to an additive constant. Furthermore, we apply our <inline-formula> <tex-math>$(t,s)$ </tex-math></inline-formula>-burst correcting codes to combat other various types of errors and improve the corresponding results. In particular, one of our byproducts is a permutation code capable of correcting a burst of t stable deletions with <inline-formula> <tex-math>$log n + O(1)$ </tex-math></inline-formula> bits of redundancy, which is optimal up to an additive constant.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1570-1584"},"PeriodicalIF":2.2,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences 二值序列自相关缺陷因子的极限矩

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-20 DOI: 10.1109/TIT.2025.3532557

Daniel J. Katz;Miriam E. Ramirez

{"title":"Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences","authors":"Daniel J. Katz;Miriam E. Ramirez","doi":"10.1109/TIT.2025.3532557","DOIUrl":"https://doi.org/10.1109/TIT.2025.3532557","url":null,"abstract":"Various problems in engineering and natural science demand binary sequences that do not resemble translates of themselves, that is, the sequences must have small aperiodic autocorrelation at every nonzero shift. If f is a sequence, then the demerit factor of f is the sum of the squared magnitudes of the autocorrelations at all nonzero shifts for the sequence obtained by normalizing f to unit Euclidean norm. The demerit factor is the reciprocal of Golay’s merit factor, and low demerit factor indicates low self-similarity of a sequence under translation. We endow the <inline-formula> <tex-math>$2^{ell } $ </tex-math></inline-formula> binary sequences of length <inline-formula> <tex-math>$ell $ </tex-math></inline-formula> with uniform probability measure and consider the distribution of their demerit factors. Earlier works used combinatorial techniques to find exact formulas for the mean, variance, skewness, and kurtosis of the distribution as a function of <inline-formula> <tex-math>$ell $ </tex-math></inline-formula>. These revealed that for <inline-formula> <tex-math>$ell geq 4$ </tex-math></inline-formula>, the pth central moment of this distribution is strictly positive for every <inline-formula> <tex-math>$p geq 2$ </tex-math></inline-formula>. This article shows that for every p, the pth central moment is <inline-formula> <tex-math>$ell ^{-2 p}$ </tex-math></inline-formula> times a quasi-polynomial function of <inline-formula> <tex-math>$ell $ </tex-math></inline-formula> with rational coefficients. It also shows that, in the limit as <inline-formula> <tex-math>$ell $ </tex-math></inline-formula> tends to infinity, the pth standardized moment is the same as that of the standard normal distribution.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"3181-3193"},"PeriodicalIF":2.2,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Generalization Performance of Empirical Risk Minimization on Over-Parameterized Deep ReLU Nets 过参数化深度ReLU网络经验风险最小化的泛化性能

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-17 DOI: 10.1109/TIT.2025.3531048

Shao-Bo Lin;Yao Wang;Ding-Xuan Zhou

引用次数: 0

Semantic Security With Infinite-Dimensional Quantum Eavesdropping Channel 无限维量子窃听信道的语义安全性

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-17 DOI: 10.1109/TIT.2025.3531250

Matthias Frey;Igor Bjelaković;Janis Nötzel;Sławomir Stańczak

{"title":"Semantic Security With Infinite-Dimensional Quantum Eavesdropping Channel","authors":"Matthias Frey;Igor Bjelaković;Janis Nötzel;Sławomir Stańczak","doi":"10.1109/TIT.2025.3531250","DOIUrl":"https://doi.org/10.1109/TIT.2025.3531250","url":null,"abstract":"We propose a new proof method for direct coding theorems for wiretap channels where the eavesdropper has access to a quantum version of the transmitted signal on an infinite-dimensional Hilbert space and the legitimate parties communicate through a classical channel or a classical input, quantum output (cq) channel. The transmitter input can be subject to an additive cost constraint, which specializes to the case of an average energy constraint. This method yields errors that decay exponentially with increasing block lengths. Moreover, it provides a guarantee of a quantum version of semantic security, which is an established concept in classical cryptography and physical layer security. Therefore, it complements existing works which either do not prove the exponential error decay or use weaker notions of security. The main part of this proof method is a direct coding result on channel resolvability which states that there is only a doubly exponentially small probability that a standard random codebook does not solve the channel resolvability problem for the cq channel. Semantic security has strong operational implications meaning essentially that the eavesdropper cannot use its quantum observation to gather any meaningful information about the transmitted signal. We also discuss the connections between semantic security and various other established notions of secrecy.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2662-2697"},"PeriodicalIF":2.2,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Proving Information Inequalities by Gaussian Elimination 用高斯消去法证明信息不等式

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-17 DOI: 10.1109/TIT.2025.3531133

Laigang Guo;Raymond W. Yeung;Xiao-Shan Gao

引用次数: 0

Deterministic Identification Over Channels With Finite Output: A Dimensional Perspective on Superlinear Rates 有限输出信道上的确定性辨识：超线性速率的维度视角

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-01-17 DOI: 10.1109/TIT.2025.3531301

Pau Colomer;Christian Deppe;Holger Boche;Andreas Winter

{"title":"Deterministic Identification Over Channels With Finite Output: A Dimensional Perspective on Superlinear Rates","authors":"Pau Colomer;Christian Deppe;Holger Boche;Andreas Winter","doi":"10.1109/TIT.2025.3531301","DOIUrl":"https://doi.org/10.1109/TIT.2025.3531301","url":null,"abstract":"Following initial work by JaJa, Ahlswede and Cai, and inspired by a recent renewed surge in interest in deterministic identification (DI) via noisy channels, we consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Such a channel is essentially given by its output distributions as a subset in the probability simplex. Our main findings are that the maximum length of messages thus identifiable scales superlinearly as <inline-formula> <tex-math>$R,nlog n$ </tex-math></inline-formula> with the block length n, and that the optimal rate R is bounded in terms of the covering (aka Minkowski, or Kolmogorov, or entropy) dimension d of a certain algebraic transformation of the output set: <inline-formula> <tex-math>$frac {1}{4} d leq R leq frac {1}{2} d$ </tex-math></inline-formula>. Remarkably, both the lower and upper Minkowski dimensions play a role in this result. Along the way, we present a Hypothesis Testing Lemma showing that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code. Although we do not know the exact capacity formula, we can conclude that the DI capacity exhibits superactivation: there exist channels whose capacities individually are zero, but whose product has positive capacity. We also generalise these results to classical-quantum channels with finite-dimensional output quantum system, in particular to quantum channels on finite-dimensional quantum systems under the constraint that the identification code can only use tensor product inputs.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3373-3396"},"PeriodicalIF":2.2,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10844897","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143875155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0