Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2602.05069 · Journal of Chemical Theory and Computation

Near-frustration-free electronic structure Hamiltonian representations and lower bound certificates

Nicholas C. Rubin, Guang Hao Low, A. Eugene DePrince

quant-phphysics.chem-phSubmitted Feb 4, 2026• Announced Feb 6, 2026• 5 citations• Revised Sep 9, 2026 (v2)
v1 · Feb 4, 2026v2 · Sep 9, 2026
arXivHTMLPDF

Abstract

Hamiltonian representations based on the sum-of-squares (SOS) hierarchy provide rigorous lower bounds on ground-state energies and facilitate the design of efficient classical and quantum simulation algorithms. This work presents a unified framework connecting SOS decompositions with variational two-particle reduced density matrix (v2RDM) theory. We demonstrate that the ``weighted'' SOS ansatz naturally recovers the dual of the v2RDM program, enabling the strict enforcement of symmetry constraints such as particle number and spin. We provide explicit SOS constructions for the Hubbard model and electronic structure Hamiltonians, ranging from spin-free approximations to full rank-2 expansions. We also highlight theoretical connections to block-invariant symmetry shifts. Numerical benchmarks on molecular systems and Iron-Sulfur clusters validate these near frustration-free representations, demonstrating their utility in improving spectral gap amplification and reducing block encoding costs in quantum algorithms.

DOI
10.1021/acs.jctc.6c00318

Related papers

A New Computational Model for the Spin-Free Sum-of-Squares Energy Bounds of Electronic Hamiltonian

Yuming Bao, Yancheng Wu, Dongdong Ge +1 more

Optimizing spin-free sum-of-squares (SOS) energy bounds for electronic Hamiltonians leads to semidefinite programs whose expanded size grows rapidly with the orbital dimension. We derive an exact reformulation of an established spin-free SOS model as a convex quadratic problem over a single symmetric matrix constrained between zero and the identity. Explicit recovery maps connect feasible quadratic-program iterates to certificates in the original SOS formulation, and identify the Frank--Wolfe gap with the separation between recovered primal and dual objectives. We implement the quadratic action through GPU-accelerated Coulomb contractions and solve the reformulated problem using a cached implementation of fully corrective Frank--Wolfe, referred to here as the dimension-reduced simplicial method (DRSM) that caches operator products and optimizes convex-combination weights in a small corrective quadratic program. Numerical experiments cover 65 FCIDUMP models, molecular geometries, and regular hydrogen rings, including original-coordinate recovery checks on nine instances and comparisons with FISTA and a boundary-point SDP solver. On eight H100 GPUs, a cold-start calculation for C$_{720}$ with 10,080 spatial orbitals reaches a freshly recomputed Frank--Wolfe gap of $8.82\times10^{-9}$ hartree in 5.02 hours. Full-space hydrogen-ring calculations reach 10,000 orbitals, with cyclic reduction providing further computational savings. These results show how exact reformulation, data structure exploitation and reuse of Coulomb actions make optimization of the selected large-scale SOS relaxation practical.

arXiv:2611.14319•Nov 10, 2026•0 citations

Fast Quantum Simulation of Electronic Structure by Spectral Amplification

Guang Hao Low, Robbie King, Dominic William Berry +6 more

The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block encodings of the Hamiltonian. A natural challenge of these methods is the degree to which block-encoding costs can be reduced. We address this challenge through the technique of spectral amplification, which magnifies the spectrum of the low-energy states of Hamiltonians that can be expressed as sums of squares. Spectral amplification enables estimating ground-state energies with significantly improved cost scaling in the block encoding normalization factor Λ to just 2 Λ E gap , where E gap ≪ Λ is the lowest energy of the sum-of-squares Hamiltonian. To achieve this, we show that sum-of-squares representations of the electronic structure Hamiltonian are efficiently computable by a family of classical simulation techniques that approximate the ground-state energy from below. In order to further optimize, we also develop a novel factorization that provides a trade-off between the two leading Coulomb integral factorization schemes—namely, double factorization and tensor hypercontraction—that when combined with spectral amplification yields a factor of 4 to 195 speedup over the state of the art in ground-state energy estimation for models of iron-sulfur complexes and a CO 2 -fixation catalyst.

arXiv:2502.15882•Physical Review X•Sep 9, 2025•64 citations

A Hierarchy of Spectral Gap Certificates for Frustration-Free Spin Systems

Kshiti Sneh Rai, Ilya Kull, Patrick Emonts +3 more

Estimating spectral gaps of quantum many-body Hamiltonians is a highly challenging computational task, even under assumptions of locality and translation-invariance. Yet, the quest for rigorous gap certificates is motivated by their broad applicability, ranging from many-body physics to quantum computing and classical sampling techniques. Here we present a general method for obtaining lower bounds on the spectral gap of frustration-free quantum Hamiltonians in the thermodynamic limit. We formulate the gap certification problem as a hierarchy of optimization problems (semidefinite programs) in which the certificate – a proof of a lower bound on the gap – is improved with increasing levels. Our approach encompasses existing finite-size methods, such as Knabe's bound and its subsequent improvements, as those appear as particular possible solutions in our optimization, which is thus guaranteed to either match or surpass them. We demonstrate the power of the method on one-dimensional spin-chain models where we observe an improvement by several orders of magnitude over existing finite size criteria in both the accuracy of the lower bound on the gap, as well as the range of parameters in which a gap is detected.

arXiv:2411.03680•Quantum•Apr 13, 2026•15 citations

Challenges for Variational Reduced-Density-Matrix Theory: Total Angular Momentum Constraints

Run R. Li, Nicholas C. Rubin, A. Eugene DePrince

The variational two-electron reduced density matrix (v2RDM) method is generalized for the description of total angular momentum ( J ) and projection of total angular momentum ( M J ) states in atomic systems described by nonrelativistic Hamiltonians, and it is shown that the approach exhibits serious deficiencies. Under ensemble N -representability constraints, v2RDM theory fails to retain the appropriate degeneracies among various J states for fixed spin ( S ) and orbital angular momentum ( L ), and for fixed L, S, and J, the manifold of M J states is not necessarily degenerate. Moreover, a substantial energy error is observed for a system for which the two-electron reduced density matrix is exactly ensemble N -representable; in this case, the error stems from violations in pure-state N -representability conditions. Unfortunately, such violations do not appear to be good indicators of the reliability of energies from v2RDM theory in general. Several states are identified for which energy errors are near zero and yet pure-state conditions are clearly violated.

arXiv:2204.08539•Journal of Chemical Theory and Computation•Sep 23, 2022•3 citations

Automated generation and execution of large-scale semidefinite programs for variational two-electron reduced density matrix theory

A. Eugene DePrince, Nicholas C. Rubin

The variational two-electron reduced density matrix (v2RDM) method provides a wave-function-free approach to the description of strong electron correlation whose computational cost scales polynomially with the number of correlated orbitals. Here, we present an automated pipeline for the generation and execution of semidefinite programs (SDPs) associated with the v2RDM problem. Algebraic constraints encoding ensemble $N$-representability conditions are generated via the p$^\dagger$q second-quantized algebra package, and the p$^\dagger$q-generated expressions are automatically translated into a sparse-matrix representation that can be digested by an appropriate SDP solver. We have implemented a boundary-point SDP (BPSDP) solver in the libsdp package that can execute the v2RDM SDPs on either CPU or GPU hardware. We apply the code in several contexts. First, two-particle conditions are used to describe the 76-orbital model of the iron-molybdenum cofactor (FeMoco) of nitrogenase, the simulation of which requires roughly 25 hours of compute time on a single Nvidia H100 GPU. Second, the performance of high-order (four-particle positivity) conditions is evaluated on a challenging two-dimensional H$_{10}$ cluster problem. Lastly, new classes of positivity constraints for mixed fermion-boson systems are generated and applied within the context of ab initio cavity quantum electrodynamics simulations.

arXiv:2610.30278•Oct 21, 2026•1 citation

Spin and symmetry adaptation of the variational two-electron reduced-density-matrix method

Gergely Gidofalvi, David A. Mazziotti

The variational two-electron reduced-density-matrix (2-RDM) method computes the ground-state energy and 2-RDM of an atom or molecule without calculation of the many-electron wave function. Recently, the computational efficiency of the 2-RDM method has been significantly enhanced through the use of a first-order algorithm for semidefinite programming [Mazziotti, Phys. Rev. Lett. 93, 213001 (2004)]. In this paper we develop a spin- and symmetry-adapted formulation of the method that further improves its efficiency by incorporating both the spin and spatial symmetries of many-electron atoms and molecules. While previous work on density-matrix symmetry focused on only one form of the 2-RDM, the variational method employs three different forms of the 2-RDM, known as the $D$, $Q$, and $G$ matrices, to restrict the 2-RDM to be approximately $N$-representable, that is representable by an $N$-electron wave function. We apply spin symmetries to the three forms of the 2-RDM, each of which breaks into four diagonal spin-blocks, namely one singlet and three triplet blocks. If the molecules have point-group symmetry, each of the 2-RDMs may be further subdivided into smaller diagonal blocks according to the spatial symmetry of the basis functions. The subdivision of the 2-RDMs into diagonal blocks generates significant computational savings in both floating-point operations and memory storage. Calculations illustrate the computational savings. Spin adaptation also enforces the correct expectation value of the ${\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{S}}^{2}$ operator, which in earlier work is applied as a separate constraint.

Physical Review A•Nov 14, 2005•69 citations
Hamiltonian representations based on the sum-of-squares (SOS) hierarchy provide rigorous lower bounds on ground-state energies and facilitate the design of efficient classical and quantum simulation algorithms. This work presents a unified framework connecting SOS decompositions with variational two-particle reduced density matrix (v2RDM) theory. We demonstrate that the ``weighted'' SOS ansatz naturally recovers the dual of the v2RDM program, enabling the strict enforcement of symmetry constraints such as particle number and spin. We provide explicit SOS constructions for the Hubbard model and electronic structure Hamiltonians, ranging from spin-free approximations to full rank-2 expansions. We also highlight theoretical connections to block-invariant symmetry shifts. Numerical benchmarks on molecular systems and Iron-Sulfur clusters validate these near frustration-free representations, demonstrating their utility in improving spectral gap amplification and reducing block encoding costs in quantum algorithms.
Optimizing spin-free sum-of-squares (SOS) energy bounds for electronic Hamiltonians leads to semidefinite programs whose expanded size grows rapidly with the orbital dimension. We derive an exact reformulation of an established spin-free SOS model as a convex quadratic problem over a single symmetric matrix constrained between zero and the identity. Explicit recovery maps connect feasible quadratic-program iterates to certificates in the original SOS formulation, and identify the Frank--Wolfe gap with the separation between recovered primal and dual objectives. We implement the quadratic action through GPU-accelerated Coulomb contractions and solve the reformulated problem using a cached implementation of fully corrective Frank--Wolfe, referred to here as the dimension-reduced simplicial method (DRSM) that caches operator products and optimizes convex-combination weights in a small corrective quadratic program. Numerical experiments cover 65 FCIDUMP models, molecular geometries, and regular hydrogen rings, including original-coordinate recovery checks on nine instances and comparisons with FISTA and a boundary-point SDP solver. On eight H100 GPUs, a cold-start calculation for C720_{720}720​ with 10,080 spatial orbitals reaches a freshly recomputed Frank--Wolfe gap of 8.82×10−98.82\times10^{-9}8.82×10−9 hartree in 5.02 hours. Full-space hydrogen-ring calculations reach 10,000 orbitals, with cyclic reduction providing further computational savings. These results show how exact reformulation, data structure exploitation and reuse of Coulomb actions make optimization of the selected large-scale SOS relaxation practical.
The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block encodings of the Hamiltonian. A natural challenge of these methods is the degree to which block-encoding costs can be reduced. We address this challenge through the technique of spectral amplification, which magnifies the spectrum of the low-energy states of Hamiltonians that can be expressed as sums of squares. Spectral amplification enables estimating ground-state energies with significantly improved cost scaling in the block encoding normalization factor Λ to just 2 Λ E gap , where E gap ≪ Λ is the lowest energy of the sum-of-squares Hamiltonian. To achieve this, we show that sum-of-squares representations of the electronic structure Hamiltonian are efficiently computable by a family of classical simulation techniques that approximate the ground-state energy from below. In order to further optimize, we also develop a novel factorization that provides a trade-off between the two leading Coulomb integral factorization schemes—namely, double factorization and tensor hypercontraction—that when combined with spectral amplification yields a factor of 4 to 195 speedup over the state of the art in ground-state energy estimation for models of iron-sulfur complexes and a CO 2 -fixation catalyst.
Estimating spectral gaps of quantum many-body Hamiltonians is a highly challenging computational task, even under assumptions of locality and translation-invariance. Yet, the quest for rigorous gap certificates is motivated by their broad applicability, ranging from many-body physics to quantum computing and classical sampling techniques. Here we present a general method for obtaining lower bounds on the spectral gap of frustration-free quantum Hamiltonians in the thermodynamic limit. We formulate the gap certification problem as a hierarchy of optimization problems (semidefinite programs) in which the certificate – a proof of a lower bound on the gap – is improved with increasing levels. Our approach encompasses existing finite-size methods, such as Knabe's bound and its subsequent improvements, as those appear as particular possible solutions in our optimization, which is thus guaranteed to either match or surpass them. We demonstrate the power of the method on one-dimensional spin-chain models where we observe an improvement by several orders of magnitude over existing finite size criteria in both the accuracy of the lower bound on the gap, as well as the range of parameters in which a gap is detected.
The variational two-electron reduced density matrix (v2RDM) method is generalized for the description of total angular momentum ( J ) and projection of total angular momentum ( M J ) states in atomic systems described by nonrelativistic Hamiltonians, and it is shown that the approach exhibits serious deficiencies. Under ensemble N -representability constraints, v2RDM theory fails to retain the appropriate degeneracies among various J states for fixed spin ( S ) and orbital angular momentum ( L ), and for fixed L, S, and J, the manifold of M J states is not necessarily degenerate. Moreover, a substantial energy error is observed for a system for which the two-electron reduced density matrix is exactly ensemble N -representable; in this case, the error stems from violations in pure-state N -representability conditions. Unfortunately, such violations do not appear to be good indicators of the reliability of energies from v2RDM theory in general. Several states are identified for which energy errors are near zero and yet pure-state conditions are clearly violated.
The variational two-electron reduced density matrix (v2RDM) method provides a wave-function-free approach to the description of strong electron correlation whose computational cost scales polynomially with the number of correlated orbitals. Here, we present an automated pipeline for the generation and execution of semidefinite programs (SDPs) associated with the v2RDM problem. Algebraic constraints encoding ensemble NNN-representability conditions are generated via the p†^\dagger†q second-quantized algebra package, and the p†^\dagger†q-generated expressions are automatically translated into a sparse-matrix representation that can be digested by an appropriate SDP solver. We have implemented a boundary-point SDP (BPSDP) solver in the libsdp package that can execute the v2RDM SDPs on either CPU or GPU hardware. We apply the code in several contexts. First, two-particle conditions are used to describe the 76-orbital model of the iron-molybdenum cofactor (FeMoco) of nitrogenase, the simulation of which requires roughly 25 hours of compute time on a single Nvidia H100 GPU. Second, the performance of high-order (four-particle positivity) conditions is evaluated on a challenging two-dimensional H10_{10}10​ cluster problem. Lastly, new classes of positivity constraints for mixed fermion-boson systems are generated and applied within the context of ab initio cavity quantum electrodynamics simulations.
The variational two-electron reduced-density-matrix (2-RDM) method computes the ground-state energy and 2-RDM of an atom or molecule without calculation of the many-electron wave function. Recently, the computational efficiency of the 2-RDM method has been significantly enhanced through the use of a first-order algorithm for semidefinite programming [Mazziotti, Phys. Rev. Lett. 93, 213001 (2004)]. In this paper we develop a spin- and symmetry-adapted formulation of the method that further improves its efficiency by incorporating both the spin and spatial symmetries of many-electron atoms and molecules. While previous work on density-matrix symmetry focused on only one form of the 2-RDM, the variational method employs three different forms of the 2-RDM, known as the DDD, QQQ, and GGG matrices, to restrict the 2-RDM to be approximately NNN-representable, that is representable by an NNN-electron wave function. We apply spin symmetries to the three forms of the 2-RDM, each of which breaks into four diagonal spin-blocks, namely one singlet and three triplet blocks. If the molecules have point-group symmetry, each of the 2-RDMs may be further subdivided into smaller diagonal blocks according to the spatial symmetry of the basis functions. The subdivision of the 2-RDMs into diagonal blocks generates significant computational savings in both floating-point operations and memory storage. Calculations illustrate the computational savings. Spin adaptation also enforces the correct expectation value of the ${\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{S}}^{2}$ operator, which in earlier work is applied as a separate constraint.