IEEE journal on selected areas in information theory最新文献_第3页

Quantum X-Secure T-Private Information Retrieval From MDS Coded Storage With Unresponsive and Byzantine Servers 量子x -安全t -私有信息检索从MDS编码存储与无响应和拜占庭服务器

IEEE journal on selected areas in information theory Pub Date : 2025-03-25 DOI: 10.1109/JSAIT.2025.3554625

Yuxiang Lu;Syed A. Jafar

{"title":"Quantum X-Secure T-Private Information Retrieval From MDS Coded Storage With Unresponsive and Byzantine Servers","authors":"Yuxiang Lu;Syed A. Jafar","doi":"10.1109/JSAIT.2025.3554625","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3554625","url":null,"abstract":"A communication-efficient protocol is introduced over a many-to-one quantum network for Q-E-B-MDS-X-TPIR, i.e., quantum private information retrieval with MDS-<italic>X</i>-secure storage and <italic>T</i>-private queries. The protocol is resilient to any set of up to <italic>E</i> unresponsive servers (erased servers or stragglers) and any set of up to <italic>B</i> Byzantine servers. The underlying coding scheme incorporates an enhanced version of a Cross Subspace Alignment (CSA) code, namely a Modified CSA (MCSA) code, into the framework of CSS codes. The error-correcting capabilities of CSS codes are leveraged to encode the dimensions that carry desired computation results from the MCSA code into the error space of the CSS code, while the undesired interference terms are aligned into the stabilized code space. The challenge is to do this efficiently while also correcting quantum erasures and Byzantine errors. The protocol achieves superdense coding gain over comparable classical baselines for Q-E-B-MDS-X-TPIR, recovers as special cases the state of art results for various other quantum PIR settings previously studied in the literature, and paves the way for applications in quantum coded distributed computation, where CSA code structures are important for communication efficiency, while security and resilience to stragglers and Byzantine servers are critical.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"59-73"},"PeriodicalIF":0.0,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143800744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Limits in Spectral Efficiency From Array Geometry 阵列几何对光谱效率的限制

IEEE journal on selected areas in information theory Pub Date : 2025-03-21 DOI: 10.1109/JSAIT.2025.3553733

Divyakumar Badheka;Jacob J. Adams;Brian L. Hughes

{"title":"Limits in Spectral Efficiency From Array Geometry","authors":"Divyakumar Badheka;Jacob J. Adams;Brian L. Hughes","doi":"10.1109/JSAIT.2025.3553733","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3553733","url":null,"abstract":"In MIMO communications, information about the transmitted signal is conveyed to the receiver through fields and currents on the surface of the receive antenna array. However, this information can only be observed indirectly through the ports of the array. This raises fundamental information-theoretic questions: How much useful information is contained in the fields and currents on the surface of the receiver array? How much of this information is captured by the array ports? Do conventional arrays efficiently extract the information contained in their conducting surfaces? In this paper, we consider these questions in the context of a multiuser MIMO (MU-MIMO) uplink where users are separated by spatial beamforming at the receiver. Our main results can be summarized as follows: To quantify the information contained in the EM fields and currents on the surface of the receiving antenna array, we first introduce a new model, the surface receiver model. We then use this model to derive upper bounds on the spectral efficiency that can be approached with any location of M ports on the surface of the receiving antenna array. We denote this the surface modal bound. Furthermore, we also derive upper bound on the spectral efficiency approached with any number or location of ports on the receiver array. We call it the surface spectral efficiency. Finally, we apply the analytical results to a MU-MIMO uplink with an array of patch antennas at the receiver. The results suggests that the conventional arrays of single and dual-polarized patches fails to capture most of the information contained in the surface currents. The results further suggest ways to modify the number of antenna ports, together with the receiver front-end, to extract the information in the surface currents more efficiently.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"34-48"},"PeriodicalIF":0.0,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10937211","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143792791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Blindness Property of the Min-Sum Decoding for the Toric Code 环面码最小和译码的盲性

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2025-03-19 DOI: 10.1109/JSAIT.2025.3571313

Julien Du Crest;Mehdi Mhalla;Valentin Savin

{"title":"A Blindness Property of the Min-Sum Decoding for the Toric Code","authors":"Julien Du Crest;Mehdi Mhalla;Valentin Savin","doi":"10.1109/JSAIT.2025.3571313","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3571313","url":null,"abstract":"Kitaev’s toric code is one of the most prominent models for fault-tolerant quantum computation, currently regarded as the leading solution for connectivity constrained quantum technologies. Significant effort has been recently devoted to improving the error correction performance of the toric code under message-passing decoding, a class of low-complexity, iterative decoding algorithms that play a central role in both theory and practice of classical low-density parity-check codes. Here, we provide a theoretical analysis of the toric code under min-sum (MS) decoding, a message-passing decoding algorithm known to solve the maximum-likelihood decoding problem in a localized manner, for codes defined by acyclic graphs. Our analysis reveals an intrinsic limitation of the toric code, which confines the propagation of local information during the message-passing process. We show that if the unsatisfied checks of an error syndrome are at distance <inline-formula> <tex-math>$ge 5$ </tex-math></inline-formula> from each other, then MS decoding is locally blind: the qubits in the direct neighborhood of an unsatisfied check are never aware of any other unsatisfied checks, except their direct neighbor. Moreover, we show that degeneracy is not the only cause of decoding failures for errors of weight at least 4, that is, the MS non-degenerate decoding radius is equal to 3, for any toric code of distance <inline-formula> <tex-math>$ge 9$ </tex-math></inline-formula>. Finally, complementing our theoretical analysis, we present a pre-processing method of practical relevance. The proposed method, referred to as stabiliser blowup, has linear complexity and allows correcting all (degenerate) errors of weight up to 3, providing quadratic improvement in the logical error rate performance, as compared to MS alone.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"138-149"},"PeriodicalIF":2.2,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144868344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Transversal Clifford and T-Gate Codes of Short Length and High Distance 短长高距离的横向Clifford和T-Gate码

IEEE journal on selected areas in information theory Pub Date : 2025-03-16 DOI: 10.1109/JSAIT.2025.3570832

Shubham P. Jain;Victor V. Albert

{"title":"Transversal Clifford and T-Gate Codes of Short Length and High Distance","authors":"Shubham P. Jain;Victor V. Albert","doi":"10.1109/JSAIT.2025.3570832","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3570832","url":null,"abstract":"The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to 31. First, we construct the smallest known doubly even codes, all of which admit a transversal implementation of the Clifford group. Applying a doubling procedure [<uri>https://arxiv.org/abs/1509.03239</uri>] to such codes yields the smallest known weak triply even codes for the same distances and number of encoded qubits. This second family of codes admit a transversal implementation of the logical T-gate. Relaxing the triply even property, we obtain our third family of triorthogonal codes with an even lower overhead at the cost of requiring additional Clifford gates to achieve the same logical operation. To our knowledge, these are the smallest known triorthogonal codes for their respective distances. While not qLDPC, the stabilizer generator weights of the code families with transversal <monospace>T</monospace>-gates scale roughly as the square root of their lengths.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"127-137"},"PeriodicalIF":0.0,"publicationDate":"2025-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mutual Coupling in Holographic MIMO: Physical Modeling and Information-Theoretic Analysis 全息MIMO中的互耦合：物理建模和信息论分析

IEEE journal on selected areas in information theory Pub Date : 2025-03-16 DOI: 10.1109/JSAIT.2025.3570804

Andrea Pizzo;Angel Lozano

引用次数: 0

Optimal Strategies for Winning Certain Coset-Guessing Quantum Games 量子游戏中获胜的最佳策略

IF 2.2

IEEE journal on selected areas in information theory Pub Date : 2025-03-07 DOI: 10.1109/JSAIT.2025.3567905

Michael Schleppy;Emina Soljanin;Nicolas Swanson

{"title":"Optimal Strategies for Winning Certain Coset-Guessing Quantum Games","authors":"Michael Schleppy;Emina Soljanin;Nicolas Swanson","doi":"10.1109/JSAIT.2025.3567905","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3567905","url":null,"abstract":"In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins with Alice preparing a <inline-formula> <tex-math>$2m$ </tex-math></inline-formula>-qubit quantum state based on a random selection of three parameters. She sends the first m qubits to Bob and the rest to Charlie, and then reveals to them her choice for one of the parameters. Bob is supposed to guess one of the hidden parameters, Charlie the other, and they win if both guesses are correct. From previous work, we know that the probability of Bob’s and Charlie’s guesses being simultaneously correct goes to zero exponentially as m increases. We derive a tight upper bound on this probability and show how Bob and Charlie can achieve it. While developing an optimal strategy, we devised an encoding circuit using only CNOT and Hadamard gates, which builds CSS codes from EPR pairs using only local operations. We found that the role of quantum information that Alice communicates to Bob and Charlie is to make their responses correlated rather than improve their individual (marginal) correct guessing rates.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"338-351"},"PeriodicalIF":2.2,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quantum Locally Recoverable Codes via Good Polynomials 基于好的多项式的量子局部可恢复码

IEEE journal on selected areas in information theory Pub Date : 2025-03-06 DOI: 10.1109/JSAIT.2025.3567480

Sandeep Sharma;Vinayak Ramkumar;Itzhak Tamo

{"title":"Quantum Locally Recoverable Codes via Good Polynomials","authors":"Sandeep Sharma;Vinayak Ramkumar;Itzhak Tamo","doi":"10.1109/JSAIT.2025.3567480","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3567480","url":null,"abstract":"Locally recoverable codes (LRCs) with locality parameter r can recover any erased code symbol by accessing r other code symbols. This local recovery property is of great interest in large-scale distributed classical data storage systems as it leads to efficient repair of failed nodes. A well-known class of optimal (classical) LRCs are subcodes of Reed-Solomon codes constructed using a special type of polynomials called good polynomials. Recently, Golowich and Guruswami initiated the study of quantum LRCs (qLRCs), which could have applications in quantum data storage systems of the future. The authors presented a qLRC construction based on good polynomials arising out of subgroups of the multiplicative group of finite fields. In this paper, we present a qLRC construction method that can employ any good polynomial. We also propose a new approach for designing good polynomials using subgroups of affine general linear groups. Golowich and Guruswami also derived a lower bound on the minimum distance of their qLRC under the restriction that <inline-formula> <tex-math>$r+1$ </tex-math></inline-formula> is prime. Using similar techniques in conjunction with the expander mixing lemma, we develop minimum distance lower bounds for our qLRCs without the <inline-formula> <tex-math>$r+1$ </tex-math></inline-formula> prime restriction.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"100-110"},"PeriodicalIF":0.0,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Energy Efficient Wireless Communications by Harnessing Huygens’ Metasurfaces 利用惠更斯的超表面进行节能无线通信

IEEE journal on selected areas in information theory Pub Date : 2025-03-01 DOI: 10.1109/JSAIT.2025.3566321

Maryam Rezvani;Raviraj Adve;Akram Bin Sediq;Amr El-Keyi

{"title":"Energy Efficient Wireless Communications by Harnessing Huygens’ Metasurfaces","authors":"Maryam Rezvani;Raviraj Adve;Akram Bin Sediq;Amr El-Keyi","doi":"10.1109/JSAIT.2025.3566321","DOIUrl":"https://doi.org/10.1109/JSAIT.2025.3566321","url":null,"abstract":"Ambitions for the next generation of wireless communication include high data rates, low latency, ubiquitous access, ensuring sustainability (in terms of consumption of energy and natural resources), all while maintaining a reasonable level of implementation complexity. Achieving these goals necessitates reforms in cellular networks, specifically in the physical layer and antenna design. The deployment of transmissive metasurfaces at basestations (BSs) presents an appealing solution, enabling beamforming in the radiated wave domain, minimizing the need for energy-hungry RF chains. Among various metasurface-based antenna designs, we propose using Huygens’ metasurface-based antennas (HMAs) at BSs. Huygens’ metasurfaces offer an attractive solution for antennas because, by utilizing Huygens’ equivalence principle, they allow independent control over both the amplitude and phase of the transmitted electromagnetic wave. In this paper, we investigate the fundamental limits of HMAs in wireless networks by integrating electromagnetic theory and information theory within a unified analytical framework. Specifically, we model the unique electromagnetic characteristics of HMAs and incorporate them into an information-theoretic optimization framework to determine their maximum achievable sum rate. By formulating an optimization problem that captures the impact of HMA’s hardware constraints and electromagnetic properties, we quantify the channel capacity of HMA-assisted systems. We then compare the performance of HMAs against phased arrays and other metasurface-based antennas in both rich scattering and realistic 3GPP channels, highlighting their potential in improving spectral and energy efficiency.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"85-99"},"PeriodicalIF":0.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143949157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

2024 Index IEEE Journal on Selected Areas in Information Theory Vol. 5 《信息理论的选择领域》第5卷

IEEE journal on selected areas in information theory Pub Date : 2025-01-13 DOI: 10.1109/JSAIT.2025.3528825

引用次数: 0

JSAIT Issue on Information-Theoretic Methods for Trustworthy and Reliable Machine Learning JSAIT关于可信和可靠机器学习的信息论方法

IEEE journal on selected areas in information theory Pub Date : 2025-01-07 DOI: 10.1109/JSAIT.2024.3508492

Lalitha Sankar;Oliver Kosut;Flavio Calmon;Ayfer Ozgur;Lele Wang;Ofer Shayevitz;Parastoo Sadeghi

引用次数: 0