Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Ralli, Alexis, Weaving, Tim, Coveney, Peter V., Love, Peter J.
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916779056431104
author Ralli, Alexis
Weaving, Tim
Coveney, Peter V.
Love, Peter J.
author_facet Ralli, Alexis
Weaving, Tim
Coveney, Peter V.
Love, Peter J.
contents In quantum chemistry, self-consistent field (SCF) algorithms define a nonlinear optimization problem, with both continuous and discrete components. In this work, we derive Hartree-Fock-inspired SCF algorithms that can be exactly written as a sequence of Quadratic Unconstrained Spin/Binary Optimization problems (QUSO/QUBO). We reformulate the optimization problem as a series of MaxCut graph problems, which can be efficiently solved using semi-definite programming techniques. This procedure provides performance guarantees at each SCF step, irrespective of the complexity of the optimization landscape. We numerically demonstrate the QUBO-SCF and MaxCut-SCF methods by studying the hydroxide anion OH- and molecular Nitrogen N2. The largest problem addressed in this study involves a system comprised of 220 qubits (equivalently, spin-orbitals). Our results show that QUBO-SCF and MaxCut-SCF suffer much less from internal instabilities compared with conventional SCF calculations. Additionally, we show that the new SCF algorithms can enhance single-reference methods, such as configuration interaction. Finally, we explore how quantum algorithms for optimization can be applied to the QUSO problems arising from the Hartree-Fock method. Four distinct hybrid-quantum classical approaches are introduced: GAS-SCF, QAOA-SCF, QA-SCF and DQI-SCF.
format Preprint
id arxiv_https___arxiv_org_abs_2506_04223
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method
Ralli, Alexis
Weaving, Tim
Coveney, Peter V.
Love, Peter J.
Quantum Physics
Materials Science
Chemical Physics
Computational Physics
In quantum chemistry, self-consistent field (SCF) algorithms define a nonlinear optimization problem, with both continuous and discrete components. In this work, we derive Hartree-Fock-inspired SCF algorithms that can be exactly written as a sequence of Quadratic Unconstrained Spin/Binary Optimization problems (QUSO/QUBO). We reformulate the optimization problem as a series of MaxCut graph problems, which can be efficiently solved using semi-definite programming techniques. This procedure provides performance guarantees at each SCF step, irrespective of the complexity of the optimization landscape. We numerically demonstrate the QUBO-SCF and MaxCut-SCF methods by studying the hydroxide anion OH- and molecular Nitrogen N2. The largest problem addressed in this study involves a system comprised of 220 qubits (equivalently, spin-orbitals). Our results show that QUBO-SCF and MaxCut-SCF suffer much less from internal instabilities compared with conventional SCF calculations. Additionally, we show that the new SCF algorithms can enhance single-reference methods, such as configuration interaction. Finally, we explore how quantum algorithms for optimization can be applied to the QUSO problems arising from the Hartree-Fock method. Four distinct hybrid-quantum classical approaches are introduced: GAS-SCF, QAOA-SCF, QA-SCF and DQI-SCF.
title Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method
topic Quantum Physics
Materials Science
Chemical Physics
Computational Physics
url https://arxiv.org/abs/2506.04223