跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.25448 · v1

Atlas: Accelerating Quantum FTQC Compilation with Optimized Algebraic Rotation Synthesis

首次提交 2026-11-19 11:27
版本更新 2026-11-19 11:27
雷达观测 2026-11-20 10:50
arXiv ↗PDF ↗

摘要

As fault-tolerant quantum computing emerges, Clifford+T gate basis becomes a popular choice where we need to decompose single-qubit rotation gates into gates in this gate basis. Quantum rotation synthesis may lead to remarkable overhead in quantum circuit compilation. Considering variational quantum eigensolver (VQE) applications as an example, a conventional UCCSD ansatz in quantum chemistry can generate O(n4)O(n^4) rotations for nn qubits. Each optimization iteration updates the rotation angles, making rotation synthesis a recurring cost that can delay the VQE training loop. We identify two sources of delay in rotation synthesis: redundant computation during synthesis and uneven synthesis times that leave workers waiting for slow requests. Atlas addresses these costs with three optimizations: search pruning skips invalid synthesis candidates through statistical inference; adaptive arithmetic avoid unnecessary high-overhead big integer/float arithmetic when decomposing the target rotation gate; batch scheduling fills the gap between the synthesis time of varied rotations. Across various benchmarks, synthesis method, and compilation machines, Atlas can consistently accelerate the rotation synthesis process by up to 12.65x.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 11:27 · 最新观测版本

Atlas: Accelerating Quantum FTQC Compilation with Optimized Algebraic Rotation Synthesis

As fault-tolerant quantum computing emerges, Clifford+T gate basis becomes a popular choice where we need to decompose single-qubit rotation gates into gates in this gate basis. Quantum rotation synthesis may lead to remarkable overhead in quantum circuit compilation. Considering variational quantum eigensolver (VQE) applications as an example, a conventional UCCSD ansatz in quantum chemistry can generate O(n4)O(n^4) rotations for nn qubits. Each optimization iteration updates the rotation angles, making rotation synthesis a recurring cost that can delay the VQE training loop. We identify two sources of delay in rotation synthesis: redundant computation during synthesis and uneven synthesis times that leave workers waiting for slow requests. Atlas addresses these costs with three optimizations: search pruning skips invalid synthesis candidates through statistical inference; adaptive arithmetic avoid unnecessary high-overhead big integer/float arithmetic when decomposing the target rotation gate; batch scheduling fills the gap between the synthesis time of varied rotations. Across various benchmarks, synthesis method, and compilation machines, Atlas can consistently accelerate the rotation synthesis process by up to 12.65x.

查看此版本解读 →查看此版本原文 ↗