GAS-SCF: Grover Adaptive SCF Optimization

• GAS-SCF is a hybrid quantum-classical algorithm that accelerates discrete optimization in SCF by leveraging Grover’s amplitude amplification.
• The method constructs a quantum oracle to mark determinants below a threshold energy and adaptively refines the search within the SCF loop.
• It achieves a theoretical quadratic speedup compared to classical exhaustive search and serves as a benchmark for advanced quantum chemistry optimizations.

Searching arXiv for the specified paper and closely related context. Grover Adaptive Search Self-Consistent Field (GAS-SCF) is a hybrid quantum–classical algorithm for self-consistent field optimization in quantum chemistry that applies Grover’s amplitude amplification and the Dür–Høyer minimum-finding paradigm to the discrete inner optimization over single-determinant Fock states, while leaving the continuous outer optimization over molecular-orbital (MO) basis rotations to classical procedures. In this formulation, the SCF objective is treated as a nested minimization,

$$E_{\mathrm{SCF}}=\min_{K}\min_{|x\rangle\in V}\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$$

where $K$ denotes the current orthonormal MO basis and $V$ the target symmetry sector. GAS-SCF constructs a quantum oracle that marks occupation-number bitstrings whose energy lies below a threshold $\tau$ derived from a classical SCF solution, amplifies those marked states, and adaptively lowers $\tau$ whenever a better determinant is found. The method is presented as a rigorous baseline for discrete SCF optimization, with a theoretical quadratic speedup in the inner search relative to exhaustive search, and with numerical demonstrations ranging from small statevector simulations up to resource-oriented analyses for systems as large as 330 qubits (Ralli et al., 18 Jun 2026).

1. Definition and SCF formulation

GAS-SCF is defined as a quantum-accelerated procedure for the inner discrete optimization step that appears inside Hartree–Fock or mean-field SCF calculations. The basic decomposition is: for a fixed MO basis, identify the best single determinant in the chosen symmetry sector; then update the MO basis classically and iterate. The quantum component targets the determinant search, whereas the orbital-rotation step remains classical (Ralli et al., 18 Jun 2026).

The motivation is tied to the structure of SCF itself. For a given basis $K$, the algorithm evaluates the diagonal second-quantized energy of a determinant,

$f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$

with $|x\rangle$ a Fock state encoded as a computational-basis bitstring. In the occupation basis,

$$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$

where binary variables $x_w\in\{0,1\}$ encode spin-orbital occupancies. This makes the discrete SCF subproblem an explicit QUBO-style optimization over determinants in a constrained sector.

For restricted Hartree–Fock, the orbital-occupation energy can be written as

$K$0

The outer mean-field update is linked to the Roothaan–Hall equations,

$K$1

with $K$2 and, in RHF,

$K$3

UHF uses spin-resolved densities and Fock matrices. GAS-SCF does not replace this classical outer-loop machinery; it modifies the way the determinant is selected inside that loop.

The method is motivated by the observation that the discrete SCF step is NP-complete in the worst case, and that standard classical heuristics such as Fock diagonalization or second-order orbital optimization can stall in local minima or miss lower-energy determinants, particularly near degeneracy, broken symmetry, and multiple-minima regimes. A plausible implication is that GAS-SCF is aimed less at routine weakly correlated cases than at regimes in which the quality of the single-determinant reference itself is unstable or ambiguous.

2. Oracle, encoding, and adaptive search mechanism

The quantum encoding assigns one qubit to each spin-orbital, so that a computational basis state $K$4 represents a determinant by its occupation pattern. Two initial-state strategies are used. The first prepares the full uniform superposition $K$5 over all bitstrings and enforces constraints with ancilla-assisted checks. The second prepares a Dicke state $K$6, i.e. an equal superposition over basis states with the required Hamming weights for fixed $K$7 and $K$8, thereby restricting the search subspace ab initio (Ralli et al., 18 Jun 2026).

The marking rule is threshold-based:

$K$9

The oracle computes $V$0 into a cost register, adds $V$1, and uses the sign bit of the two’s-complement result to identify whether the determinant improves upon the current threshold. In the target symmetry sector $V$2, the phase oracle acts as

$V$3

Amplitude amplification is then applied with reflection about the chosen initial state,

$V$4

yielding the Grover iterate

$V$5

or equivalently

$V$6

If the search space has $V$7 states and $V$8 marked states, then with $V$9 the success probability after $\tau$0 iterations is

$\tau$1

and the expected optimal number of iterations is approximately

$\tau$2

When $\tau$3 is known, the paper uses the exact arcsin-based expression labeled Eq. (6); when $\tau$4 is unknown, randomized-$\tau$5 or fixed-point strategies are proposed.

The “adaptive” aspect follows the Dür–Høyer minimum-finding paradigm. After measurement, the resulting bitstring $\tau$6 is classically evaluated. If $\tau$7, the threshold is updated to $\tau$8 and the search is repeated. As $\tau$9 decreases, the marked set shrinks, so the optimal amplification depth changes during execution. This suggests that GAS-SCF is not a one-shot Grover search but an iterative threshold-tightening procedure embedded in the SCF loop.

3. Hybrid workflow and circuit components

The algorithm takes as inputs the one- and two-electron integrals $\tau$0 and $\tau$1 in the current MO basis, a target symmetry sector with fixed $\tau$2 and $\tau$3 and possibly spin or point-group constraints, and an initial threshold $\tau$4 obtained from a classical SCF calculation. The system register contains $\tau$5 qubits for spin-orbital occupations. The cost register uses $\tau$6 qubits, where $\tau$7 is chosen from

$\tau$8

with one extra sign qubit. In the uniform-$\tau$9 variant, optional number registers of sizes

$K$0

encode electron counts for symmetry enforcement (Ralli et al., 18 Jun 2026).

Energy evaluation is implemented with quantum arithmetic. The QFT-based construction prepares the cost register in the Fourier basis using Hadamards and phase gates, applies controlled additions for the linear and quadratic terms in $K$1, and then performs an inverse QFT to return to the computational basis. Alternatively, a fault-tolerant design without QFT uses singly and doubly controlled adders while retaining two’s-complement encoding. Noninteger integrals are handled by scaling by $K$2 and rounding to integers, which preserves eigenstates and rescales eigenvalues; the corresponding register size becomes

$K$3

The paper states that, practically, $K$4 suffices to match typical 15-digit precision of integrals.

A single GAS round consists of preparing $K$5 or $K$6, executing $K$7 Grover iterations, measuring the system register, classically evaluating the sampled determinant, and possibly updating $K$8. If a GAS round improves the threshold, the MO basis may then be updated classically using orbital-rotation heuristics such as Roothaan–Hall diagonalization or second-order methods, after which the integrals are rebuilt and the process repeated until SCF convergence or a stopping condition based on energy change, gradient norms, or stability tests.

The gate structure is dominated by energy accumulation and constraint handling. For each repetition, cost accumulation scales as $K$9 singly controlled phase gates for linear terms and $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$0 for quadratic terms in the QFT-based version; the fault-tolerant adder version has total T-count scaling $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$1 with $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$2 clean ancillas. In the uniform-$f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$3 variant, symmetry enforcement adds $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$4 Hadamards for the count registers, $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$5 singly controlled phase gates for count accumulation, $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$6 multi-controlled X gates for exact Hamming weights, inverse QFTs on the count registers, and a Toffoli to combine $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$7 flags. Reflection about $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$8 is implemented through $f(x)=\langle x|H_{\mathrm{QUBO}}(K)|x\rangle,$9, whereas Dicke-state reflection can cost up to $|x\rangle$0 depending on $|x\rangle$1.

4. Complexity, baseline role, and relation to structured quantum optimization

At the level of query complexity, GAS-SCF inherits the standard amplitude-amplification scaling: the expected number of Grover iterations is $|x\rangle$2, compared with classical $|x\rangle$3 sampling over an unstructured domain. The total complexity is therefore

$|x\rangle$4

where $|x\rangle$5 denotes the cost of energy evaluation and symmetry checks (Ralli et al., 18 Jun 2026).

The central caveat is that the oracle may dominate the end-to-end runtime. For dense integral tensors, the two-electron term yields $|x\rangle$6 gate-level additions per repetition, so asymptotic quadratic speedup in the number of search queries does not automatically imply practical advantage in a fault-tolerant regime. The paper therefore positions GAS-SCF as a benchmark rather than as a claim of near-term superiority.

This baseline role is explicit. GAS-SCF marks all states that improve on the best known classical energy and then amplifies them without presuming additional exploitable structure. Structured approaches such as QAOA, DQI, and AQC are accordingly framed as methods that would need to beat this warm-started amplitude-amplification baseline by exploiting problem structure such as graph locality, low-rank integrals, tailored mixers or ansätze, or interference-based decoders. A plausible implication is that GAS-SCF serves as a reference point for distinguishing advantage arising from genuinely structure-aware design from advantage attributable merely to access to the same classical warm start.

The paper also distinguishes the two search-space variants in terms of robustness. In the full uniform-$|x\rangle$7 formulation, unmarked states outside the symmetry sector remain in superposition, which keeps the marked fraction below $|x\rangle$8 for $|x\rangle$9 spatial orbitals and thereby avoids overbalancing. In the Dicke-state variant, by contrast, a poor threshold can mark more than half the valid states, causing the algorithm to amplify unmarked states instead. For such cases, overbalanced-domain methods such as Faro–Marino strategies are suggested.

5. Numerical demonstrations and classical simulations

The reported demonstrations are classically simulated proofs of concept, with the largest explicit statevector simulation using 26 qubits total including ancillas, and with additional analyses extending to larger systems up to 330 qubits (Ralli et al., 18 Jun 2026).

For $$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$0 in STO-3G, the uniform-$$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$1 variant uses $$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$2 system states and, when $$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$3 is below the true ground energy, has $$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$4 and optimal $$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$5. The observed Grover oscillations match

$$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$6

In the Dicke-$$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$7 variant for the chosen $$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$8 sector, the valid-state count is $$H_{\mathrm{QUBO}}(K)=\sum_w h_{ww}(K)x_w+\frac12\sum_{m\neq w}\big[g_{mmww}(K)-g_{mwwm}(K)\big]x_mx_w,$$9, again with $x_w\in\{0,1\}$0 under a tight threshold and $x_w\in\{0,1\}$1, with oscillations following the same formula and $x_w\in\{0,1\}$2. For LiH in STO-3G, using only the Dicke variant, the valid-state count is $x_w\in\{0,1\}$3 with $x_w\in\{0,1\}$4, and the observed amplification is consistent with $x_w\in\{0,1\}$5.

The overbalancing pathology is illustrated on $x_w\in\{0,1\}$6 in the Dicke variant with $x_w\in\{0,1\}$7, where more than half the valid states are marked and the algorithm amplifies unmarked states rather than improving ones. The uniform-$x_w\in\{0,1\}$8 variant avoids this failure because off-sector states remain present and unmarked.

For $x_w\in\{0,1\}$9 in 6-31G with active space $K$00, using 12 system qubits in the Dicke variant, the valid-state count is

$K$01

A classical RHF seed from PySCF gives $K$02 in rounded units and corresponds to a local minimum. With that threshold, $K$03 states lie below $K$04. Using $K$05 from Eq. (6), statevector sampling with 10,000 shots returned only marked bitstrings, all of which improve upon the RHF solution; the largest reported improvement is approximately $K$06. This is presented as a direct demonstration that amplitude amplification can boost the entire set of lower-energy determinants relative to a classical starting point.

The O$K$07 triplet at bond length $K$08 is used to probe the quality of classical single-determinant references. In STO-3G, the overlap $K$09 indicates that ROHF is a poor single-determinant reference. Higher CI truncations give $K$10 and $K$11, showing that lower-order truncations can overstate ROHF’s importance. The study also finds single Fock states with substantially higher overlap than ROHF, such as $K$12 in STO-3G and $K$13 in 6-31G, indicating the presence of better determinants outside the classical ROHF minimum.

For linear triplet O$K$14 with O–O bonds of $K$15, the paper considers cc-pVDZ, cc-pVTZ, and cc-pVQZ basis sets with 84, 180, and 330 data qubits respectively. The corresponding search-space sizes in the target sector are approximately $K$16, $K$17, and $K$18. Across six initialization strategies—minao, 1e, atom, huckel, vsap, and sap—and two SCF flavors, ROHF and SO-ROHF/Newton, GAS-style brute-force sector searches with a five-minute limit found lower-energy single-determinant solutions than PySCF in 34 out of 36 cases. Reported ROHF improvements $K$19 include $K$20 for sap in cc-pVTZ, $K$21 for minao in cc-pVDZ, and $K$22 for sap in cc-pVQZ. Reported SO-ROHF improvements include $K$23 for 1e or sap in cc-pVDZ, $K$24 for minao/vsap/sap in cc-pVTZ, and $K$25 for sap in cc-pVQZ.

6. Resource requirements, limitations, and prospective developments

Chemically relevant applications of GAS-SCF are explicitly tied to large-scale, fault-tolerant quantum hardware. The resource picture includes system qubits for spin-orbitals, a cost register of size $K$26, optional electron-count registers of size $K$27 in the uniform-$K$28 formulation, and clean ancillas scaling as $K$29 for fault-tolerant adders or up to $K$30 when controlled adders are also used for number counts. In the O$K$31 examples, the data-qubit counts alone are 84, 180, and 330 for cc-pVDZ, cc-pVTZ, and cc-pVQZ respectively (Ralli et al., 18 Jun 2026).

Fault-tolerant arithmetic dominates T-gate budgets. A singly controlled adder requires $K$32 T gates and $K$33 clean ancillas; a doubly controlled adder costs $K$34 T gates and $K$35 ancillas. Since each linear or quadratic term contributes one such adder, total T-count per repetition scales with $K$36 linear and $K$37 quadratic terms. By contrast, marking through controlled $K$38 and multi-controlled X/Z gates is described as Clifford-dominated and comparatively cheap in T-count.

The main limitations are threefold. First, overbalancing can break the Dicke-state variant when $K$39 is too loose. Second, oracle dominance can erase the practical benefit of Grover scaling, especially with dense two-electron integrals and high precision. Third, the procedure is sensitive to arithmetic and phase errors, since the comparison depends on correct two’s-complement sign evaluation and near-degenerate states require enough precision to preserve ordering. The paper therefore frames fault tolerance as a precondition for chemically relevant deployment.

Several optimization directions are identified. These include exploiting integral sparsity and screening, low-rank factorization of two-electron integrals, use of point-group symmetry to reduce $K$40, replacement of QFT-based arithmetic by optimized fault-tolerant adders, use of qubitization or more efficient arithmetic layouts, improved Dicke-state preparation, and the use of Weyl bounds on $K$41 to choose $K$42. Future work also includes systematic benchmarking against advanced classical SCF heuristics and post-HF pipelines, hybrid alternation between quantum GAS rounds and classical orbital optimization, integration of structure-aware optimizers such as QAOA and DQI on top of the GAS-SCF baseline, and extension of symmetry constraints to more refined spin sectors via Weyl-formula bounds.

Taken together, these features place GAS-SCF at the intersection of quantum search, arithmetic-heavy oracle design, and mean-field electronic-structure optimization. Its significance lies not only in the quadratic inner-loop speedup but also in its role as a concrete, verifiable baseline for identifying better single-determinant solutions in SCF regimes where conventional heuristics can become trapped or misleading.