返回
摘要
En 中文
In recent years we have seen the birth of a new field known as Hamiltonian complexity lying at the crossroads between computer science and theoretical physics. Hamiltonian complexity is directly concerned with the question: how hard is it to simulate a physical system? Here I review the foundational results, guiding problems, and future directions of this emergent field.
Keyword:
LIEB-ROBINSON BOUNDS
COMPUTATIONAL-COMPLEXITY
QUANTUM
APPROXIMATION
DYNAMICS
PROPAGATION
GAP
PERTURBATION
ALGORITHMS
VELOCITY
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
20.7
论文数:
1.6K
被引数:
2.4W

