Fast Quantum Modular Exponentiation Architecture for Shor’s Factorization Algorithm

Archimedes Pavlidis, Dimitris Gizopoulos · 2012/2014 · Quantum Information and Computation 14(7&8), 0649-0682

| 编号 QM008 | 主题 模运算与乘法 | 链接 arXiv:1207.0511 |

摘要

摘要保留原文（英文）

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

We present a novel and efficient in terms of circuit depth design for Shor’s quantum factorization algorithm. The circuit effectively utilizes a diverse set of adders based on the quantum Fourier transform (QFT) Draper’s adders to build more complex arithmetic blocks: quantum multiplier/accumulators by constants and quantum dividers by constants. These arithmetic blocks are effectively architected into a generic modular quantum multiplier which is the fundamental block for modular exponentiation circuit, the most computational intensive part of Shor’s algorithm. The proposed modular exponentiation circuit has a depth of about $2000n^2$ and requires $9n+2$ qubits, where $n$ is the number of bits of the classical number to be factored. The total quantum cost of the proposed design is $1600n^3$. The circuit depth can be further decreased by more than three times if the approximate QFT implementation of each adder unit is exploited.

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