Quantum Hamiltonian Complexity
zqyin 添加于 2014-9-15 12:59
| 1045 次阅读 | 0 个评论
作 者
Gharibian S, Huang Y, Landau Z 摘 要
We survey the growing field of Quantum Hamiltonian Complexity, which includes the study of Quantum Constraint Satisfaction. In particular, our aim is to provide a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field. As such, we include the following in this paper: (1) The motivations and history of the field, (2) a glossary of condensed matter physics terms explained in computer-science friendly language, (3) overviews of central ideas from condensed matter physics, such as indistinguishable particles, mean field theory, tensor networks, and area laws, and (4) brief expositions of selected computer science-based results in the area. For example, as part of the latter, we provide a novel information theoretic presentation of Bravyi\'s polynomial time algorithm for Quantum 2-SAT.-
详细资料
- 关键词: quant-ph; cond-mat.str-el; cs.CC
- 文献种类: Manual Script
- 期卷页: 2014年
- 日期: 2014-9-13
- 发布方式: arXiv e-prints
- 备注:arXiv:1401.3916v2; v2: 58 pages. Substantial changes: (1) Length almost doubled via addition of sections on physics motivations, indistinguishable particles (i.e. bosons, fermions), area laws, etc. (2) Added new author, S. W. Shin. Minor changes to improv
-
-
评论( 人)
学科领域 自然科学 » 物理学
浙公网安备 33010202000686号 ( 浙ICP备09035230号-1 )
