.png){kind=icon}
Return
Hamiltonian complexity
.png){kind=icon}
OA
AI
DOI：10.1088/0034-4885/75/2/022001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
LIEB-ROBINSON BOUNDS
COMPUTATIONAL-COMPLEXITY
QUANTUM
APPROXIMATION
DYNAMICS
PROPAGATION
GAP
PERTURBATION
ALGORITHMS
VELOCITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
20.7
Papers:
1.6K
Citations:
2.4W
Organization
Cited Papers
The influence of ethane and acetylene upon the thermal structure of the Jovian atmosphere.png)
Icarus
IcarusIF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more