paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Accelerating Computation in Quantum LDPC Code

加速量子 LDPC 码中的计算
ASPLOS Proceedings of the 31st ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 22026匹配度 1/10 · 论文聚焦容错量子计算中 qLDPC 码的软硬件协同设计、分解-布局优化与量子码布局,属于量子体系结构/编译方向,与用户关注的 PL→AI、AI→PL、浮点程序分析和贝叶斯程序分析等核心方向无直接关联。引用 0 inbox
Jungmin Cho, Hyeonseong Jeong, Junpyo Kim, Junhyuk Choi, Juwon Hong, Jangwoo Kim
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出软硬件协同设计方法 ACQC,通过分解–布局协同设计与优化布局,大幅加速 qLDPC 码上的容错量子计算。

容错量子计算依赖量子纠错码在含噪量子计算机上运行大规模量子程序。量子低密度奇偶校验(qLDPC)码相比表面码可节省一个数量级的量子比特,但其仅支持有限的操作集合,程序必须被分解为大量 qLDPC 支持的操作,导致执行时间长达数十天,严重阻碍其实用化。本文提出 ACQC——一种软硬件协同设计方法,以加速 qLDPC 码中的计算。作者首先提出新颖的分解–布局协同设计,以量子比特开销为代价显著缩短执行时间;随后利用 qLDPC 码特性与所提分解技术降低量子比特开销;最后通过设计最优的 qLDPC 码布局来减少魔态蒸馏的开销。由于目前尚无 qLDPC 码硬件,作者采用全面的模拟进行评估。结果表明,ACQC 相对基线 qLDPC 码容错量子计算平均取得 4.4 倍加速,并相对表面码容错量子计算平均减少 18.3 倍量子比特。

问题
qLDPC 码仅支持有限操作集合,迫使程序分解为大量受支持操作,使容错量子应用执行时间增至数十天,难以实用。
方法
提出 ACQC 软硬件协同设计:分解–布局协同设计缩短执行时间,利用 qLDPC 码特性降低量子比特开销,并设计最优布局以减少魔态蒸馏开销。
评估
因缺少 qLDPC 码硬件,采用全面模拟评估;结果显示相对基线 qLDPC 容错量子计算平均加速 4.4 倍,相对表面码方案平均减少 18.3 倍量子比特。
原文摘要(Abstract)

Fault-tolerant quantum computing (FTQC) uses quantum error correction (QEC) codes to execute large-scale quantum programs on noisy quantum computers. Quantum low-density parity-check (qLDPC) codes are promising as they use an order of magnitude fewer qubits than widely used surface codes. However, as qLDPC codes support only a limited set of operations, they require programs to be decomposed into many qLDPC-supported operations. This prohibitively increases the execution time of FTQC applications to tens of days, hindering the practical viability of qLDPC codes. In this paper, we propose ACQC, a software–hardware co-design approach to accelerate computation in qLDPC codes, realizing the practical use of qLDPC codes for FTQC. To achieve this goal, we first introduce a novel decomposition–layout co-design that significantly reduces execution time at the cost of qubit overhead. Then, we reduce the qubit overhead by exploiting characteristics of qLDPC codes and our decomposition technique. Lastly, we reduce the qubit overhead of magic state distillation by designing an optimal qLDPC code layout. As there is currently no available hardware for qLDPC codes, we evaluate ACQC with a comprehensive simulation. The results show that ACQC achieves 4.4× speedup over the baseline qLDPC code FTQC and 18.3× qubit reduction over the surface code FTQC on average.

链接与引用

DOI 原文 · PDF(开放获取) · DBLP

BibTeX
@inproceedings{ChoJKCHK26,
  title = {Accelerating Computation in Quantum LDPC Code},
  author = {Jungmin Cho and Hyeonseong Jeong and Junpyo Kim and Junhyuk Choi and Juwon Hong and Jangwoo Kim},
  booktitle = {ASPLOS},
  year = {2026},
  doi = {10.1145/3779212.3790122}
}