arXiv:2604. 08485v2 Announce Type: replace-cross Abstract: The purpose of this paper is two-fold.
By Jae-Hyun Baek, Jon-Lark Kim
arXiv:2607. 09632v1 Announce Type: cross Abstract: Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error correction.
By Chengkai Zhu, Ziao Tang, Guocheng Zhen, Yimeng Cao, Yusheng Zhao, Ranyiliu Chen, Xuanqiang Zhao, Lei Zhang, Xin Wang
arXiv:2608. 30273v1 Announce Type: cross Abstract: The exact Shannon capacity is unknown for every odd cycle beyond the five-cycle $C_5$, making odd cycles a central open problem in zero-error information theory.
By Ravi Tandon
arXiv:2607. 23500v1 Announce Type: cross Abstract: Razborov's flag algebra method is a powerful tool for proving asymptotic inequalities in extremal graph theory, often reducing the task to finding a finite certificate by semidefinite programming.
By Gyeongwon Jeong, Seonghun Park, Jihoon Hyun, Sang-il Oum, Hongseok Yang
FormalFlow is a system that coordinates AI proving agents under human supervision to tackle long‑horizon formalizations, using a shared blueprint for nested planning, proving, and review loops. The team used it to produce a machine‑checked Lean 4 proof of the quantum soundness of the classical low‑individual‑degree test, a core theorem underlying MIP* = RE, in 63 days. The resulting library contains 126,367 lines of Lean code, all generated by agents, and corrects side conditions while preserving the published error bound under corrected assumptions.
By Sirui Lu, Ruixuan Deng, Yanqiao Zhu, Zhengfeng Ji
arXiv:2606. 24808v1 Announce Type: cross Abstract: Quantum computers could outperform classical machines on important problems, but only if the errors that pervade quantum hardware can be corrected at scale.
By Zidu Liu, Florian Marquardt