SqDRIFT (qFLO): Randomized Quantum Chemistry Simulation

• SqDRIFT (qFLO) is a randomized quantum algorithm framework that combines qDRIFT-style probabilistic Hamiltonian compilation with Krylov subspace diagonalization for ground-state quantum chemistry and many-body simulation.
• It achieves polynomial resource savings by reducing circuit depth from O(m^12 t^2/ε) in deterministic Trotter–Suzuki methods to O(m^9 t^2/ε), making simulations feasible on limited-depth quantum processors.
• The qFLO protocol employs high-order Richardson extrapolation over independent qDRIFT runs, yielding an exponential improvement in circuit depth scaling with respect to target precision.

SqDRIFT (“Sample-based quantum Diagonalization with Randomized Fast Low-Overhead” or “qFLO”), also referred to as qFLO in recent literature, is a randomized sample-based quantum algorithmic framework for ground-state quantum chemistry and many-body simulation on near-term and early-fault-tolerant quantum processors. SqDRIFT integrates qDRIFT-style probabilistic Hamiltonian compilation within Krylov subspace diagonalization, achieving polynomial resource savings in circuit depth and operation count relative to deterministic Trotter–Suzuki methods while retaining provable convergence guarantees in the “concentrated wavefunction” regime (Piccinelli et al., 4 Aug 2025, Piccinelli et al., 9 Mar 2026). Separately, qFLO, sometimes called “SqDRIFT,” denotes a high-order randomized time-evolution simulation protocol based on Richardson extrapolation over independent qDRIFT runs, yielding an exponential improvement in circuit depth scaling with respect to target precision compared to standard qDRIFT (Watson, 2024).

1. Theoretical Foundations

SqDRIFT targets the quantum computational bottleneck in sample-based subspace diagonalization techniques, primarily Krylov diagonalization, for electronic-structure/MQC Hamiltonians

$H = \sum_{j=1}^L c_j P_j,$

where $P_j$ are Pauli strings and $L=O(m^4)$ for $m$ orbitals. In classical Krylov methods, a reference state $|\Psi_0\rangle$ is evolved via $e^{-iHt}$ to generate a Krylov subspace

$$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$

on which the Hamiltonian is diagonalized classically. The obstacle in quantum implementations is the gate and circuit depth cost of decomposing $e^{-iHt}$, especially for $L \gg 1$.

SqDRIFT replaces standard Suzuki–Trotter decomposition, which requires $O(L)$ exponentials per step, with qDRIFT-style randomized compilation. For evolution time $P_j$0 and target error $P_j$1, the propagator $P_j$2 is approximated via a random sequence of $P_j$3 Pauli-exponential gates, each chosen with probability $P_j$4 with $P_j$5, and segment time $P_j$6:

$P_j$7

yielding a channel $P_j$8 satisfying

$P_j$9

Choosing $L=O(m^4)$0 ensures diamond-norm accuracy $L=O(m^4)$1 (Piccinelli et al., 4 Aug 2025, Piccinelli et al., 9 Mar 2026).

2. Algorithmic Workflow and qFLO Complexity

SqDRIFT constructs each Krylov vector using independent qDRIFT circuits; for each, the output bitstrings (Slater determinants) define the sample subspace. The practical workflow is:

1. Hamiltonian mapping: Electronic-structure integrals are mapped to a $L=O(m^4)$2-qubit Pauli expansion $L=O(m^4)$3.
2. Sampling distribution: $L=O(m^4)$4.
3. qDRIFT evolution: For evolution time $L=O(m^4)$5 and error $L=O(m^4)$6, select $L=O(m^4)$7 segments $L=O(m^4)$8. For each $L=O(m^4)$9, apply $m$0 (Piccinelli et al., 9 Mar 2026).
4. Subspace sampling: Repeat steps 1–3 $m$1 times, generating $m$2 bitstrings per Krylov vector.
5. Classical diagonalization: Assemble the subspace from all sampled determinants and diagonalize $m$3.

Counted in quantum floating-point operations (qFLOs), each segment incurs $m$4 cost (average Pauli-string weight in Jordan–Wigner mapping), yielding per-circuit cost $m$5. The total qFLO across $m$6 circuits for $m$7-dimensional subspace is

$m$8

using $m$9 for quantum chemistry Hamiltonians and $|\Psi_0\rangle$0 (Piccinelli et al., 9 Mar 2026).

3. Convergence Guarantees and Error Analysis

SqDRIFT inherits the convergence theorems established for sample-based Krylov diagonalization. If the ground state $|\Psi_0\rangle$1 is $|\Psi_0\rangle$2-concentrated on $|\Psi_0\rangle$3 Slater determinants and the reference state overlap $|\Psi_0\rangle$4 is nonzero, then, with high probability, the minimum eigenvalue $|\Psi_0\rangle$5 of the sample subspace satisfies

$|\Psi_0\rangle$6

provided all important determinants are sampled. Failure probability decays exponentially with the number of independent samples and repeated circuits, as governed by explicit Hoeffding-type bounds (Piccinelli et al., 4 Aug 2025).

The channel approximation error is determined by the qDRIFT segment number,

$|\Psi_0\rangle$7

and stochastic error is reduced via repeated, independent circuits and adequate bitstring sampling per Krylov vector.

4. Resource Scaling and Comparison with Deterministic Methods

The asymptotic qFLO complexity of SqDRIFT for $|\Psi_0\rangle$8-orbital problems is

$|\Psi_0\rangle$9

representing a polynomial reduction relative to first-order Trotter–Suzuki methods, which require

$e^{-iHt}$0

total qFLO. The advantage is particularly pronounced as $e^{-iHt}$1 increases: deterministic Trotter steps require $e^{-iHt}$2 operations per step, while each SqDRIFT Pauli rotation involves only $e^{-iHt}$3 gates (Piccinelli et al., 9 Mar 2026).

In benchmarking studies, for 36- and 50-orbital active spaces (72 and 100 qubits) and fixed diagonalization subspace size $e^{-iHt}$4 ($e^{-iHt}$5 random circuits), circuit depths were held constant by fixing $e^{-iHt}$6 by the target error. Increasing from 36 to 50 orbitals incurred a per-circuit qFLO increase of approximately 40%. These resource levels enabled simulations that would be intractable for deterministic Trotter scaling (Piccinelli et al., 9 Mar 2026).

Quantum phase estimation (QPE) remains asymptotically optimal for high-precision eigenvalue estimation—scaling as $e^{-iHt}$7—but imposes requirements on circuit depth and error correction beyond early-fault-tolerant platforms.

5. High-Order Randomized Simulation: qFLO Protocol

qFLO, also named SqDRIFT in some works, further refines qDRIFT for time-evolution and observable estimation via Richardson extrapolation over $e^{-iHt}$8 different qDRIFT circuit depths. The standard qDRIFT protocol requires depth $e^{-iHt}$9 for error $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$0, while qFLO achieves

$$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$1

an exponential improvement in the $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$2 dependence (Watson, 2024).

qFLO operates as follows:

• For $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$3 inverse step sizes $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$4 (where $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$5), run sets of independent qDRIFT circuits to estimate $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$6 at each $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$7.
• Use classical Richardson extrapolation to cancel systematic errors by combining data with coefficients $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$8 determined by the “well-conditioned” prescription. The estimator $$K^d = \mathrm{span}\{|\Psi_0\rangle, e^{-iHt}|\Psi_0\rangle, \ldots, e^{-i(d-1)Ht}|\Psi_0\rangle\},$$9 has leading error $e^{-iHt}$0.
• Maximum circuit depth scales as $e^{-iHt}$1; total number of runs is $e^{-iHt}$2 to suppress statistical error.

qFLO is robust to measurement noise, requires no ancilla qubits or controlled-Pauli operations, and each circuit’s depth is independent of the number of Hamiltonian terms. A trade-off is that while expectation values can be obtained efficiently, qFLO does not prepare the evolved quantum state itself.

6. Applications and Practical Demonstrations

SqDRIFT has enabled quantum chemistry simulations for systems beyond the classical diagonalization limit, including:

• $e^{-iHt}$3-active-space calculations for naphthalene (10e, 10o, 20 qubits) and coronene (24e, 24o, 48 qubits) (Piccinelli et al., 4 Aug 2025).
• Simulations of molecules with nontrivial topology (e.g., the half-Möbius case, up to 50-orbital/100-qubit active spaces) (Piccinelli et al., 9 Mar 2026).

Simulations employed thousands of random circuits and collected millions of bitstring samples. Energy estimates were competitive with coupled-cluster and stochastic FCIQMC benchmarks, using diagonalization subspaces two or more orders of magnitude below the full Hilbert space.

These implementations confirmed that SqDRIFT circuits fit within the depth budgets of current superconducting devices, providing an explicit path toward quantum-assisted quantum chemistry for active spaces inaccessible to classical methods.

7. Context, Limitations, and Extensions

SqDRIFT’s design is optimized for systems with “concentrated” ground-state wavefunctions. The polynomial speedup derives from the independence of circuit depth from the large Pauli-term count in realistic molecular Hamiltonians. For extremely high-precision and broad wavefunction support, deterministic high-order Trotter or QPE schemes asymptotically win, but at prohibitive practical cost for current and near-future devices (Piccinelli et al., 4 Aug 2025, Watson, 2024).

A plausible implication is that SqDRIFT and qFLO represent essential algorithmic tools for the “quantum utility” era: providing polynomial resource savings and convergence guarantees for large-scale quantum chemistry—in active-space sizes from 70 to 100 qubits and beyond—on superconducting and NISQ-class devices.

• (Watson, 2024) Randomly Compiled Quantum Simulation with Exponentially Reduced Circuit Depths
• (Piccinelli et al., 4 Aug 2025) Quantum chemistry with provable convergence via randomized sample-based quantum diagonalization
• (Piccinelli et al., 9 Mar 2026) A note on large-scale quantum chemistry on quantum computers: the case of a molecule with half-Möbius topology