Information Theory

Rui Okayasu

For researchers in operator algebras and quantum information, this provides a novel theoretical framework unifying known decompositions, though the results are theoretical and no concrete numerical improvements are reported.

Sk Asfaq Hossain, Angshuman Bhattacharya

This work addresses a theoretical problem in quantum information theory, offering an incremental advancement in graphical representations for quantum channels.

Levin Maier

This work provides a theoretical foundation for geometric methods in probability and optimization, potentially impacting fields like machine learning and statistics, though it appears incremental in extending existing geometric frameworks.

Haimeng Zhao, Alexander Zlokapa, Hartmut Neven et al.

This work establishes machine learning on classical data as a broad domain of quantum advantage, potentially impacting fields like bioinformatics and natural language processing, but it is foundational rather than incremental.

Thomas Schuster, Dominik Kufel, Norman Y. Yao et al.

This establishes fundamental computational limits for quantum phase recognition, impacting quantum physics and materials science, but is incremental as it builds on pseudorandom unitaries and leaves open questions about constant-locality Hamiltonians.

Wei Xu, Lipeng Zhu, Wenyan Ma et al.

This work addresses the challenge of improving beamforming gain in antenna arrays for applications like wireless communications, representing an incremental advance by optimizing antenna positions to harness mutual coupling.

Lorenzo Bardone, Claudia Merger, Sebastian Goldt

This provides foundational insights into how diffusion models learn complex distributions, which is incremental but clarifies a key mechanism for the AI/ML community.

Zimu Li, Yuguo Shao, Fuchuan Wei et al.

For quantum error correction and fault tolerance, this provides a general methodology to compute and lift logical invariants from small codes to infinite families, enabling efficient verification and new logical gate constructions.

Zhuang Li, Wenyi Zhang

This work provides a theoretical guarantee that ORBGRAND-based decoding can achieve channel capacity, which is a fundamental result for coding theory and practical decoder design.

Hengfeng Liu, Chunming Tang, Zhengchun Zhou et al.

This solves a long-standing open problem in coding theory by providing a method to construct NMDS codes supporting 2-designs beyond the previously known length limit of q+1.

Zixuan Liu, Zhiyong Chen, Nan Xue et al.

For edge-deployed LLM inference, WISV addresses the bottleneck of token-level verification under fluctuating wireless conditions, offering a practical solution to improve efficiency.

Mohammad Javad Khojasteh, Massimo Franceschetti, Gireeja Ranade

This work addresses the challenge of event-triggering control with zero-payload rate for systems like phone call networks, generalizing previous strategies and revealing fundamental limits in using timing information for stabilization.

Haiyun He, Yepeng Liu, Zhuoer Shen et al.

For researchers and practitioners designing watermarking schemes for high-stakes generative AI, this work provides rigorous theoretical benchmarks that quantify unavoidable performance trade-offs.

Weihua Zhu, Beixiong Zheng, Lipeng Zhu et al.

This work addresses fairness issues in multicast communication systems for users, but it is incremental as it builds on existing rotatable antenna technology with optimization methods.

Zeyu Guo, Roshan Raj, Chong Shangguan et al.

For researchers in pseudorandomness and combinatorics, this gives the first explicit constructions in the small-field regime with near-optimal parameters, significantly improving prior work.

Xinyuanmeng Yao, Xiao Ma

This work addresses the problem of achieving capacity with low-latency decoding for polar codes, which is incremental but important for practical communication systems.

Ohad Kimelfeld, Boulat A. Bash, Uzi Pereg

This work provides fundamental limits for covert quantum communication, which is important for ensuring undetectable quantum information transmission in adversarial settings.

Xingyu Zhou, Le Liang, Hao Ye et al.

This work addresses the problem of efficient and reliable channel estimation for wireless communication systems, representing an incremental improvement over prior AI-based solutions by enhancing robustness and cross-scenario transferability.

Xiaoqiang Wang, Xun Song, Dabin Zheng et al.

For coding theorists, this resolves a long-standing open problem by providing the first infinite families of self-dual binary cyclic codes exceeding the square-root bound.

Peng Zhang, Jian Dang, Miaowen Wen et al.

This work addresses performance limitations in reconfigurable intelligent surfaces for wireless communication, offering an incremental improvement through a novel integration of fluid antennas.