Hamiltonian complexity
classification
🪐 quant-ph
cond-mat.str-el
keywords
complexityhamiltonianfieldbirthcomputerconcernedcrossroadsdirections
read the original abstract
In recent years we've 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.