Planted Solutions in Quantum Chemistry: Generating Non-Trivial Hamiltonians with Known Ground States
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915505694048256 |
|---|---|
| author | Wang, Linjun Cantin, Joshua T. Patel, Smik Loaiza, Ignacio Huang, Rick Izmaylov, Artur F. |
| author_facet | Wang, Linjun Cantin, Joshua T. Patel, Smik Loaiza, Ignacio Huang, Rick Izmaylov, Artur F. |
| contents | Generating large, non-trivial 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 (DMRG) 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_15166 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Planted Solutions in Quantum Chemistry: Generating Non-Trivial Hamiltonians with Known Ground States Wang, Linjun Cantin, Joshua T. Patel, Smik Loaiza, Ignacio Huang, Rick Izmaylov, Artur F. Quantum Physics Chemical Physics Generating large, non-trivial 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 (DMRG) 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. |
| title | Planted Solutions in Quantum Chemistry: Generating Non-Trivial Hamiltonians with Known Ground States |
| topic | Quantum Physics Chemical Physics |
| url | https://arxiv.org/abs/2507.15166 |