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

Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes

IF 2.2 3区计算机科学

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

Yuan-Hsun Lo;Tsai-Lien Wong;Kangkang Xu;Yijin Zhang

引用次数: 0

Coded Distributed Computing With Pre-Set Data Placement and Output Functions Assignment

IF 2.2 3区计算机科学

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

Yuhan Wang;Youlong Wu

{"title":"Coded Distributed Computing With Pre-Set Data Placement and Output Functions Assignment","authors":"Yuhan Wang;Youlong Wu","doi":"10.1109/TIT.2025.3528083","DOIUrl":"https://doi.org/10.1109/TIT.2025.3528083","url":null,"abstract":"Coded distributed computing can reduce the communication load for distributed computing systems by introducing redundant computation and creating multicasting opportunities. However, the existing schemes require delicate data placement and output function assignment, which is not feasible when distributed nodes fetch data without the orchestration of a central server. In this paper, we consider the general systems where the data placement and output function assignment are arbitrary but pre-set. We propose two coded computing schemes, One-shot Coded Transmission (OSCT) and Few-shot Coded Transmission (FSCT), to reduce the communication load. Both schemes first group the nodes into clusters and divide the transmission of each cluster into multiple rounds, and then design coded transmission in each round to maximize the multicast gain. The key difference between OSCT and FSCT is that the former uses a one-shot transmission where each encoded message can be decoded independently by the intended nodes, while the latter allows each node to jointly decode multiple received symbols to achieve potentially larger multicast gains. Furthermore, based on the lower bound proposed by Yu et al., we derive sufficient conditions for the optimality of OSCT and FSCT, respectively. This not only recovers the existing optimality results but also includes some cases where our schemes are optimal while others are not.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"2195-2217"},"PeriodicalIF":2.2,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455237","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

Quasi Complementary Sequence Sets: New Bounds and Optimal Constructions via Quasi-Florentine Rectangles

IF 2.2 3区计算机科学

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

Avik Ranjan Adhikary;Hui Zhang;Zhengchun Zhou;Qi Wang;Sihem Mesnager

引用次数: 0

On Nearly Perfect Covering Codes

IF 2.2 3区计算机科学

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

Avital Boruchovsky;Tuvi Etzion;Ron M. Roth

引用次数: 0

Universal Polarization for Processes With Memory

IF 2.2 3区计算机科学

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

Boaz Shuval;Ido Tal

{"title":"Universal Polarization for Processes With Memory","authors":"Boaz Shuval;Ido Tal","doi":"10.1109/TIT.2025.3528241","DOIUrl":"https://doi.org/10.1109/TIT.2025.3528241","url":null,"abstract":"A transform that is universally polarizing over a set of channels with memory is presented. Memory may be present in both the input to the channel and the channel itself. Both the encoder and the decoder are aware of the input distribution, which is fixed. However, only the decoder is aware of the actual channel being used. The transform can be used to design a universal code for this scenario. The code is to have vanishing error probability when used over any channel in the set, and achieve the infimal information rate over the set. The setting considered is, in fact, more general: we consider a set of processes with memory. Universal polarization is established for the case where each process in the set: 1) has memory in the form of an underlying hidden Markov state sequence that is aperiodic and irreducible; and 2) satisfies a ‘forgetfulness’ property. Forgetfulness, which we believe to be of independent interest, occurs when two hidden Markov states become approximately independent of each other given a sufficiently long sequence of observations between them. We show that aperiodicity and irreducibility of the underlying Markov chain is not sufficient for forgetfulness, and develop a sufficient condition for a hidden Markov process to be forgetful.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1705-1757"},"PeriodicalIF":2.2,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465616","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

Continuity of Entropies via Integral Representations

IF 2.2 3区计算机科学

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

Mario Berta;Ludovico Lami;Marco Tomamichel

引用次数: 0

Multipartite Entanglement Theory With Entanglement-Nonincreasing Operations

IF 2.2 3区计算机科学

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

Alexander Streltsov

引用次数: 0

Lower Bounds on Learning Pauli Channels With Individual Measurements

IF 2.2 3区计算机科学

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

Omar Fawzi;Aadil Oufkir;Daniel Stilck França

{"title":"Lower Bounds on Learning Pauli Channels With Individual Measurements","authors":"Omar Fawzi;Aadil Oufkir;Daniel Stilck França","doi":"10.1109/TIT.2025.3527902","DOIUrl":"https://doi.org/10.1109/TIT.2025.3527902","url":null,"abstract":"Understanding the noise affecting a quantum device is of fundamental importance for scaling quantum technologies. A particularly important class of noise models is that of Pauli channels, as randomized compiling techniques can effectively bring any quantum channel to this form and are significantly more structured than general quantum channels. In this paper, we show fundamental lower bounds on the sample complexity for learning Pauli channels in diamond norm. We consider strategies that may not use auxiliary systems entangled with the input to the unknown channel and have to perform a measurement before reusing the channel. For non-adaptive algorithms, we show a lower bound of <inline-formula> <tex-math>$Omega (2^{3n}varepsilon ^{-2})$ </tex-math></inline-formula> to learn an n-qubit Pauli channel. In particular, this shows that the recently introduced learning procedure by Flammia and Wallman (2020) is essentially optimal. In the adaptive setting, we show a lower bound of <inline-formula> <tex-math>$Omega (2^{2.5n}varepsilon ^{-2})$ </tex-math></inline-formula> for <inline-formula> <tex-math>$varepsilon ={mathcal {O}}(2^{-n})$ </tex-math></inline-formula>, and a lower bound of <inline-formula> <tex-math>$Omega (2^{2n}varepsilon ^{-2})$ </tex-math></inline-formula> for any <inline-formula> <tex-math>$varepsilon gt 0$ </tex-math></inline-formula>. This last lower bound holds even in a stronger model where in each step, before performing the measurement, the unknown channel may be used arbitrarily many times sequentially interspersed with unital operations.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2642-2661"},"PeriodicalIF":2.2,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676081","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

Contraction of Private Quantum Channels and Private Quantum Hypothesis Testing

IF 2.2 3区计算机科学

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

Theshani Nuradha;Mark M. Wilde

{"title":"Contraction of Private Quantum Channels and Private Quantum Hypothesis Testing","authors":"Theshani Nuradha;Mark M. Wilde","doi":"10.1109/TIT.2025.3527859","DOIUrl":"https://doi.org/10.1109/TIT.2025.3527859","url":null,"abstract":"A quantum generalized divergence by definition satisfies the data-processing inequality; as such, the relative decrease in such a divergence under the action of a quantum channel is at most one. This relative decrease is formally known as the contraction coefficient of the channel and the divergence. Interestingly, there exist combinations of channels and divergences for which the contraction coefficient is strictly less than one. Furthermore, understanding the contraction coefficient is fundamental for the study of statistical tasks under privacy constraints. To this end, here we establish upper bounds on contraction coefficients for the hockey-stick divergence under privacy constraints, where privacy is quantified with respect to the quantum local differential privacy (QLDP) framework, and we fully characterize the contraction coefficient for the trace distance under privacy constraints. Using the machinery developed, we also determine an upper bound on the contraction of both the Bures distance and quantum relative entropy relative to the normalized trace distance, under QLDP constraints. Next, we apply our findings to establish bounds on the sample complexity of quantum hypothesis testing under privacy constraints. Furthermore, we study various scenarios in which the sample complexity bounds are tight while providing order-optimal quantum channels that achieve those bounds. Lastly, we show how private quantum channels provide fairness and Holevo information stability in quantum learning settings.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"1851-1873"},"PeriodicalIF":2.2,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465603","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

Maximizing Weighted Energy Efficiency Over Parallel Gaussian Broadcast Channels

IF 2.2 3区计算机科学

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

Peng-Jun Wan;Pengpeng Chen

{"title":"Maximizing Weighted Energy Efficiency Over Parallel Gaussian Broadcast Channels","authors":"Peng-Jun Wan;Pengpeng Chen","doi":"10.1109/TIT.2025.3527887","DOIUrl":"https://doi.org/10.1109/TIT.2025.3527887","url":null,"abstract":"A power assignment over parallel Gaussian broadcast channels splits a power budget at the access point among all channel-user pairs subject to per-channel upper-bounds on the sum-power, and yields a rate allocation to all channel-user pairs. Its weighted energy efficiency (WEE) is the ratio of its weighted sum-rate over its sum-power plus a fixed positive overhead. The problem Max-WEE seeks a power assignment maximizing the WEE. Special variants of Max-WEE with unit weights or two users per channel have been extensively studied in the literature. But none of the existing algorithms for those special variants have known bounds on running time, mainly because they follow the general-purposed methods for fractional programming. In this paper, we first derive fundamental properties and closed-form expressions of maximum WEE. Then we devise a simple water-filling algorithm for Max-WEE. Assuming all users are presorted by weight, the water-filling algorithm has linear complexity in the number of channel-user pairs. Under a mild presorting condition, we further develop a linear-complexity algorithm for Max-WEE subject to rate demand.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 3","pages":"2245-2256"},"PeriodicalIF":2.2,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455272","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