Quantum algorithms for algebraic problems

Andrew M. Childs, Wim van Dam · 2010 · arXiv 预印本（Rev. Mod. Phys. 82, 1-52）

| 编号 QEXP010 | 主题 模幂与 Shor | 链接 arXiv:0812.0380 |

摘要

摘要保留原文（英文）

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

Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor.

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