Faster Quantum Number Factoring via Circuit Synthesis

Markov, Saeedi · 2013 · arXiv 预印本（Phys. Rev. A 87, 012310）

| 编号 QEXP017 | 主题 模幂与 Shor | 链接 arXiv:1301.3210 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

A major obstacle to implementing Shor’s quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor’s algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces of the execution of an appropriate GCD algorithm. Empirically, gate counts are reduced by 4-5 times, and circuit latency is reduced by larger factors.

本站词条在引用该文献时，会以 wikilink（sources/QEXP017）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。