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, 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.

Authors

Institutions

Publication Details

Journal
Journal of Chemical Theory and Computation
Published
2025-11-10
DOI
https://doi.org/10.1021/acs.jctc.5c01210
Primary Topic
Machine Learning in Materials Science
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

L.W. Wang, Ignacio Loaiza, Joshua T. Cantin, Artur F. Izmaylov et al.
Journal of Chemical Theory and Computation
Machine Learning in Materials Science
article

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

L.W. Wang, Ignacio Loaiza, Joshua T. Cantin, Artur F. Izmaylov, Ruqi Huang, Smik Patel
article en

Abstract

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.

Journal of Chemical Theory and ComputationVol. 21(22)
University of Toronto (CA), Scarborough Health Network (CA)
Openalex Percentile: Top 70%
Machine Learning in Materials Science
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.