arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.24633quant-ph
收藏

利用局部量子解码器进行优化

Optimization Using Locally-Quantum Decoders

Google Quantum AI(Google量子人工智能);Department of Electrical and Computer Engineering, Duke University(杜克大学电气与计算机工程系);Computer Science and Artificial Intelligence Laboratory, MIT(麻省理工学院计算机科学和人工智能实验室);Inria(法国国家数字科学研究所);Global Technology Applied Research, JPMorganChase(摩根大通全球技术应用研究部);University of Technology Sydney(悉尼科技大学)

Noah Shutty, Avijit Mandal, Seyoon Ragavan, Quentin Buzet, André Chailloux, Nicholas C. Rubin, Abid Khan, Sami Boulebnane, Ruslan Shaydulin, John Azariah, Stephen P. Jordan

AI总结:

本文提出一种内在量子解码技术,用于解码受位翻转错误相干叠加影响的经典LDPC码,对D-regular max-k-XORSAT问题在某些(k,D)值下优于经典belief propagation,但因改进Prange算法而未实现量子优势。

摘要:

在[JSW+25]中指出,广泛研究的优化问题如D-regular max-k-XORSAT可通过量子算法相关于Regev的还原转换为LDPC码解码。LDPC码具有很好的解码器,如Belief Propagation (BP),因此D-regular max-k-XORSAT成为此类量子算法的有吸引力目标。然而,BP被发现不足以实现量子优势。本文开发了一种内在量子解码技术,该技术解码受相干位翻转错误叠加影响的经典LDPC码。对于从Gallager集合中抽取的D-regular max-k-XORSAT的平均情况实例,在许多k和D值下,该量子解码器显著优于经典belief propagation。对于某些(k,D),使用该解码器可达到的近优解优于Prange算法和模拟退火。然而,由于我们识别出改进Prange算法以恢复精确平局, much as a precise tie was observed between the standard version of Prange's algorithm and a more limited version of locally-quantum decoding in [CT24],我们未实现量子优势。

英文摘要:

It was pointed out in [JSW+25] that widely-studied optimization problems such as D-regular max-k-XORSAT can be reduced to decoding of LDPC codes, using quantum algorithms related to Regev's reduction. LDPC codes have very good decoders, such as Belief Propagation (BP), and this therefore makes D-regular max-k-XORSAT an enticing target for this class of quantum algorithms. However, BP was found insufficient to achieve quantum advantage. Here, we develop an intrinsically quantum decoding technique, which decodes classical LDPC codes subject to coherent superpositions of bit flip errors. For average-case instances of D-regular max-k-XORSAT drawn from Gallager's ensemble, this quantum decoder strongly outperforms classical belief propagation at many values of k and D. For some (k,D) the approximate optima achievable using this decoder surpass both Prange's algorithm and simulated annealing. However, we stop short of achieving quantum advantage because we identify an enhancement to Prange's algorithm that recovers a precise tie, much as a precise tie was observed between the standard version of Prange's algorithm and a more limited version of locally-quantum decoding in [CT24].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑