Toward the first quantum simulation with quantum speedup

Andrew M. Childs, Dmitri Maslov, Yunseong Nam, Neil J. Ross, Yuan Su · 2017 · PNAS 115, 9456-9461

| 编号 QNF008 | 主题 数值格式 | 链接 arXiv:1711.10980 |

摘要

摘要保留原文（英文）

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

With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical computers, but that requires the fewest resources for a quantum computer. We consider quantum simulation of spin systems, which could be applied to understand condensed matter phenomena. We synthesize explicit circuits for three leading quantum simulation algorithms, employing diverse techniques to tighten error bounds and optimize circuit implementations. Quantum signal processing appears to be preferred among algorithms with rigorous performance guarantees, whereas higher-order product formulas prevail if empirical error estimates suffice. Our circuits are orders of magnitude smaller than those for the simplest classically-infeasible instances of factoring and quantum chemistry.

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