Introduces the eigenwalk problem and proves a linear-diameter support-localization theorem for sparse eigenvectors, yielding poly(n)-time classical exact diagonalization for O(1)-sparse extremal eigenvectors of poly(n)-sparse 2^n-dimensional Hamiltonians.
Identification of deadwood in configuration spaces through general direct configuration interaction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial-time exact diagonalization via sparse guided eigenwalks
Introduces the eigenwalk problem and proves a linear-diameter support-localization theorem for sparse eigenvectors, yielding poly(n)-time classical exact diagonalization for O(1)-sparse extremal eigenvectors of poly(n)-sparse 2^n-dimensional Hamiltonians.