多智能体发现实用量子低密度奇偶校验码
Multi-agent discovery of practical quantum LDPC codes
浏览论文内容
中文总结 AI 辅助
该研究开发多智能体框架，在块长不超过400、总重量不超过10的二元CSS码范围内，发现了多种高性能实用量子LDPC码，为实验评估提供了硬件相关候选。
中文摘要 AI 辅助
量子低密度奇偶校验（qLDPC）码可利用稀疏奇偶校验编码多个逻辑量子比特，但寻找有用的有限长度实例仍是一项具有挑战性的设计问题，因为必须在满足实际约束的同时优化码的性能。受人工智能智能体用于科学发现的最新进展的启发，我们开发了一种用于发现实用qLDPC码的多智能体框架。该框架结合了专业提案与评审、持久科学记忆、可执行程序的长时程演化以及闭环搜索内的确定性构建与评估。这些程序实例化陪集轨道平衡积码，提供的搜索空间包含自行车码、提升积码构造以及非正规子群作用。为纳入实际约束，我们将搜索限制在块长 $n\leq400$、总重量 $w\leq10$ 的二元CSS码范围内。在该范围内，框架在所有考虑的重量类别中都发现了具有领先或可比率-距离性能的码，代表性实例包括 $w=7$ 时的 $[[288,16,18]]$、$w=9$ 时的 $[[288,18,18]]$ 以及 $w=10$ 时的 $[[234,28,18]]$。搜索还发现了结构独特的高性能构造，包括 $[[336,12,\leq24]]$ 候选码和 $[[368,18,16]]$ 码，二者均为具有非正规子群作用的真正平衡积码。在采用常见BP-OSD解码协议的码容量去极化噪声下评估时，所发现的码还表现出低逻辑失败率。这些结果共同提供了与硬件相关的有限长度候选码以供进一步实验评估，并展示了结构化智能体搜索如何助力科学发现。
英文摘要
Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks, yet searching for useful finite-length instances remains a challenging design problem because code performance must be optimized while satisfying practical constraints. Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes. The framework combines specialist proposal and review, persistent scientific memory, long-horizon evolution of executable programs, and deterministic construction and evaluation within a closed-loop search. These programs instantiate coset-orbit balanced-product codes, providing a search space that includes bicycle and lifted-product constructions as well as non-normal subgroup actions. To incorporate practical constraints, we restrict the search to binary CSS codes with block length $n\leq400$ and overall weight $w\leq10$. Within this regime, the framework discovers codes with leading or competitive rate--distance performance in every weight class considered, with representative instances including $[[288,16,18]]$ at $w=7$, $[[288,18,18]]$ at $w=9$, and $[[234,28,18]]$ at $w=10$. The search also uncovers structurally distinct, high-performing constructions, including a $[[336,12,\leq24]]$ candidate and a $[[368,18,16]]$ code, both of which are genuine balanced-product constructions with non-normal subgroup actions. When evaluated under code-capacity depolarizing noise using a common BP-OSD decoding protocol, the discovered codes also exhibit low logical failure rates. Together, these results provide hardware-relevant finite-length candidates for further experimental evaluation and show how structured agentic search can contribute to scientific discovery.
发表机构
- Fudan University（复旦大学）
- Shanghai Research Center for Quantum Sciences（上海量子科学研究中心）
- University of Wisconsin–Madison（威斯康星大学麦迪逊分校）
机构由 AI 辅助整理，请以论文原文为准。
