Hamiltonian complexity
Open-knowledge reference entry

Hamiltonian complexity or quantum Hamiltonian complexity is a topic which deals with problems in quantum complexity theory and condensed matter physics. It mostly studies constraint satisfaction problems related to ground states of local Hamiltonians; that is, Hermitian matrices that act locally on a system of interest. The constraint satisfaction problems in quantum Hamiltonian complexity have led to the quantum version of the Cook–Levin theorem. Quantum Hamiltonian complexity has helped physicists understand the difficulty of simulating physical systems.
Local Hamiltonian problem
Given a Hermitian matrix
H
{\displaystyle H}
, let
λ
0
{\displaystyle \lambda _{0}}
denote the ground state energy of the Hamiltonian
H
{\displaystyle H}
, and let
a
{\displaystyle a}
and
b
{\displaystyle b}
be non-negative real numbers with
b
≥
a
+
1
{\displaystyle b\geq a+1}
. If
λ
0
≤
a
{\displaystyle \lambda _{0}\leq a}
, output Yes. If
λ
0
≥
b
{\displaystyle \lambda _{0}\geq b}
, output No. The k-local Hamiltonian problem is similar except the Hamiltonians have
k
{\displaystyle k}
-local interactions. This problem has been shown to be QMA-complete for
k
≥
2
{\displaystyle k\geq 2}
.
Area law
The area law explains the structure of entanglement present in ground states of physically relevant systems.
The public source identifies “Hamiltonian complexity” as open-knowledge reference entry. This brief keeps that definition visible, then builds a research path around Hamiltonian, complexity and Open-knowledge.
Why this record matters
A short description can identify a subject without explaining its stakes. For “Hamiltonian complexity”, the useful work is to connect “open-knowledge reference entry” to the records capable of establishing context and consequence.
Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Oct 6, 2025. The linked authority identifier is Q85765575. None of the 0 selected statements returned an explicit reference.
A concise general-reference account can conceal disagreements about scope, terminology or the weight assigned to individual sources. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Hamiltonian complexity”, its source revision and the description used here.
- Expand the search: follow Hamiltonian complexity primary sources, Hamiltonian complexity archive and Hamiltonian research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Hamiltonian complexity”?
- What terminology or title could unlock a more precise catalogue search?
- Which institution is responsible for the underlying evidence?
Search terms from this dossier
This entry incorporates text from “Hamiltonian complexity” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.