Planted Solutions in Quantum Chemistry: Generating Non-Trivial Hamiltonians with Known Ground States

Generating large, nontrivial quantum chemistry test problems with known ground-state solutions remains a core challenge for benchmarking electronic structure methods. Inspired by planted-solution techniques from combinatorial optimization, we introduce four classes of Hamiltonians with embedded, ret...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of chemical theory and computation Ročník 21; číslo 22; s. 11495
Hlavní autoři: Wang, Linjun, Cantin, Joshua T, Patel, Smik, Loaiza, Ignacio, Huang, Rick, Izmaylov, Artur F
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States 25.11.2025
ISSN:1549-9626, 1549-9626
On-line přístup:Zjistit podrobnosti o přístupu
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Generating large, nontrivial quantum chemistry test problems with known ground-state solutions remains a core challenge for benchmarking electronic structure methods. Inspired by planted-solution techniques from combinatorial optimization, we introduce four classes of Hamiltonians with embedded, retrievable ground states. These Hamiltonians mimic realistic electronic structure problems, support adjustable complexity, and are derived from reference systems. Crucially, their ground-state energies can be computed exactly, provided the construction parameters are known. To obscure this structure and control perceived complexity, we introduce techniques such as killer operators, balance operators, and random orbital rotations. We showcase this framework using examples based on homogeneous catalysts of industrial relevance and validate tunable difficulty through density matrix renormalization group convergence behavior. Beyond enabling scalable, ground-truth benchmark generation, our approach offers a controlled setting to explore the limitations of electronic structure methods and investigate how Hamiltonian structure influences ground state solution difficulty.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1549-9626
1549-9626
DOI:10.1021/acs.jctc.5c01210