Quantum Networks for Elementary Arithmetic Operations

Vedral, Barenco, Ekert · 1995 · arXiv 预印本（Phys. Rev. A 54, 147）

| 编号 QEXP006 | 主题 模幂与 Shor | 链接 arXiv:quant-ph/9511018 |

摘要

摘要保留原文（英文）

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

Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shor’s quantum factorising algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorised.

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