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 semidefinite 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 N 2 . 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.
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 semidefinite 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 N 2 . 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.
We present the Grover adaptive search self-consistent field (GAS-SCF) algorithm. GAS-SCF leverages quantum arithmetic to construct an efficient oracle that marks target states (Fock states) which improve upon some initial classical energy estimate. Amplitude amplification then increases the probability of measuring these states. This approach offers a theoretical quadratic speed-up for the optimization problem encountered in SCF quantum chemistry and establishes a baseline against which structured optimization algorithms, such as QAOA and DQI may be compared. In this work, we classically simulate three examples as proofs of concept of the algorithm, the largest consisting of 26 qubits. We then extend our analysis to two larger systems, with O3 representing the largest case at 330 qubits. These examples are chosen to probe classically challenging SCF regimes. Achieving chemically relevant applications of GAS-SCF will require large-scale, fault-tolerant quantum hardware.
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several approximate methods have been devised to reduce such cost. With the growing maturity of quantum computing, quantum algorithms have been proposed to speed up the solution by using either quantum annealers or universal quantum computers. Here we apply the divide-and-conquer approach to reduce the original problem to a collection of smaller problems whose solutions can be assembled to form a single Polynomial Binary Unconstrained Optimization instance with fewer variables. This technique can be applied to any QUBO instance and leads to either an all-classical or a hybrid quantum-classical approach. When quantum heuristics like the Quantum Approximate Optimization Algorithm (QAOA) are used, our proposal leads to a double advantage: a substantial reduction of quantum resources, specifically an average of ~42% fewer qubits to solve MaxCut on random 3-regular graphs, together with an improvement in the quality of the approximate solutions reached.
Quadratic unconstrained binary optimization (QUBO) tasks are very important in chemistry, finance, job scheduling, and so on, which can be represented using graph structures, with the variables as nodes and the interaction between them as edges. Variational quantum algorithms, especially the Quantum Approximate Optimization Algorithm (QAOA) and its variants, present a promising way, potentially exceeding the capabilities of classical algorithms, for addressing QUBO tasks. However, the possibility of using message-passing machines, inspired by classical graph neural networks, to enhance the power and performance of these quantum algorithms for QUBO tasks was not investigated. This study introduces a novel variational quantum graph optimization algorithm that integrates the message-passing mechanism, which demonstrates significant improvements in performance for solving QUBO problems in terms of resource efficiency and solution precision, compared to QAOA, its variants, and other quantum graph neural networks. Furthermore, in terms of scalability on QUBO tasks, our algorithm shows superior performance compared to QAOA, presenting a substantial advancement in the field of quantum approximate optimization.
Quantum algorithms have shown promise in solving Quadratic Unconstrained Binary Optimization (QUBO) problems, benefiting from their connection to the transverse field Ising model.Various Ising solvers, both classical and quantum, have emerged to tackle such problems efficiently but lack global optimality guarantees and oftentimes sufer from hardware limitations such as limited qubit availability.In this work, we propose a hybrid branch-andbound (B&B) framework that integrates Ising solvers as heuristics within a classical B&B algorithm.Unlike prior theoretical studies, our work presents a practical implementation, available as open-source at GitHub.We explore when and where to apply Ising solvers in the search tree, and introduce a custom branching rule optimized QUBO embedding.Our method is evaluated on hundreds of QUBO instances from QUBOLib.jl using Gurobi and the D-Wave quantum annealer.Our Results show up to 11% less solution time and 17% fewer nodes compared to default Gurobi, an off-the-shelf commercial optimization solver.These findings demonstrate the value of hybrid quantum-classical strategies for enhancing exact optimization.
Abstract As interest in quantum and related optimization paradigms continues to grow, fairly and systematically comparing their performance across practical problem settings remains challenging. This challenge arises because these approaches often target different problem classes, use different mathematical representations, and are affected differently by modeling choices. As a result, observed performance depends not only on the solver itself, but also on how a problem is formulated, reformulated, and translated into a solver-specific input language. This work presents a publicly available and extensible benchmarking framework that unifies advances in quantum, quantum-hybrid, quantum-inspired, and classical optimization by enabling consistent comparison across use cases, solvers, and models. We address the diversity of solver “languages”—from mixed-integer programming (MIP) formulations for branch-and-bound methods over quadratic unconstrained binary optimization (QUBO) models for quantum annealers to constrained quadratic models (CQM) for hybrid approaches — as well as the influence of modeling choices, such as binary encodings and penalty formulations, on both performance and solution fidelity. By supporting systematic variation across the three dimensions of use case, solver, and model, the framework reveals trade-offs that single-dimension benchmarks overlook, clarifies when native formulations are preferable, and enables rigorous evaluation of practical combinatorial optimization problems. The two case studies, vehicle routing and maximum cut, illustrate this principle: their contrasting outcomes show that the effectiveness of a solver depends strongly on how well the chosen model representation matches the solver backend and the use case.
The self-consistent field method utilized for solving the Hartree-Fock (HF) problem and the closely related Kohn-Sham problem is typically thought of as one of the cheapest methods available to quantum chemists. This intuition has been developed from the numerous applications of the self-consistent field method to a large variety of molecular systems. However, as characterized by its worst-case behavior, the HF problem is NP-complete. In this work, we map out boundaries of the NP-completeness by investigating restricted instances of HF. We have constructed two new NP-complete variants of the problem. The first is a set of Hamiltonians whose translationally invariant Hartree-Fock solutions are trivial, but whose broken symmetry solutions are NP-complete. Second, we demonstrate how to embed instances of spin glasses into translationally invariant Hartree-Fock instances and provide a numerical example. These findings are the first steps towards understanding in which cases the self-consistent field method is computationally feasible and when it is not.