--- title: 'SqDRIFT: Randomized Quantum Ground-State Estimation' url: https://www.emergentmind.com/topics/sqdrift type: topic --- # SqDRIFT: Randomized Quantum Ground-State Estimation SqDRIFT is a randomized quantum algorithm designed to efficiently approximate ground-state energies of many-body quantum systems, particularly electronic structure Hamiltonians, on near-term and early fault-tolerant quantum devices. The method combines Sample-based Krylov Quantum Diagonalization (SKQD) with qDRIFT, a stochastic Hamiltonian simulation approach, yielding an algorithm with provable convergence guarantees and circuit-resource requirements compatible with hardware constraints on modern superconducting processors [2508.02578][2603.08696]. ## 1. Algorithmic Foundation SqDRIFT targets the ground-state energy estimation for an $n$-qubit Hamiltonian, $$ H = \sum_{i=1}^{\mathcal N} c_i h_i, \quad \lambda = \sum_i |c_i|, $$ where the ground state $|\phi_0\rangle$ is assumed to be "concentrated"—i.e., supported on $L \ll 2^n$ computational basis states. The method employs the SKQD framework, which constructs a Krylov subspace, $$ \mathcal{K}_d = \text{span}\left\{|\psi_k\rangle = \left[e^{-i H t}\right]^k |\psi_0\rangle \right\}_{k=0}^{d-1}, $$ based on repeated, imperfect time evolution from an initial reference, typically a Hartree–Fock state. SqDRIFT replaces exact or Trotterized time evolution (requiring excessive circuit depth for large, complex systems) with stochastic, shallow qDRIFT circuits. Each Krylov vector is generated via multiple independent qDRIFT realizations, and computational-basis measurements are drawn from each. The union of all unique observed bitstrings is used to construct a much smaller subspace (typically $L\sim \mathrm{poly}(n)$), into which the Hamiltonian is projected and diagonalized classically to yield the approximate ground-state energy [2508.02578]. ## 2. Mathematical Structure and Convergence Guarantees ### 2.1 qDRIFT Approximation For $$ H = \sum_i c_i h_i, \quad \|h_i\| \leq 1, $$ one defines $\lambda = \sum_i |c_i|$ and constructs a stochastic sequence of $N$ exponentials: $$ V_{\mathbf{k}} = \prod_{j=1}^N \exp\left(-i h_{k_j} \frac{\lambda t}{N}\right),\quad \Pr[k_j = i] = \frac{|c_i|}{\lambda}. $$ The average quantum channel satisfies $$ \|\mathcal{E}_{\text{qDRIFT}} - \mathcal{U}_t\|_\diamond = O(\lambda^2 t^2 / N), $$ independent of the number of Hamiltonian terms, allowing control of the simulation error by tuning $N$. For simulation error $\epsilon_Q$, $$ N = O\left(\frac{\lambda^2 t^2}{\epsilon_Q}\right). $$ ### 2.2 Krylov Subspace and Sampling A $d$-step Krylov subspace is realized through repeated application of randomized qDRIFT unitaries, each followed by $S$ measurements. The ensemble of bitstrings from multiple ($N_r$) independent circuits provides a set of computational-basis Slater determinants spanning the subspace. ### 2.3 Convergence Theorem and Sampling Bounds Given ground-state concentration parameters $(\alpha_L^{(0)},\beta_L^{(0)})$: $$ \sum_{i=1}^L |c_i|^2 \ge \alpha_L^{(0)},\qquad |c_i|^2 \ge \beta_L^{(0)},\ \forall i\leq L, $$ with $L = \mathrm{poly}(n)$, the lowest-energy vector $|\tilde{\phi}\rangle$ in the subspace has variational error $$ \tilde{E} - E_0 \leq \sqrt{8}\|H\| \left(1-\sqrt{\alpha_L^{(0)}}\right)^{1/2}. $$ The probability of failing to sample all $L$ important bitstrings, $$ p_{\rm fail} \leq L \left[ (1-\delta)(1-p)^S + \delta \right]^{N_r}, $$ can be controlled by increasing $N_r$, $S$, and appropriate choice of $N$ [2508.02578]. ## 3. Practical Workflow and Implementation ### 3.1 Pseudocode Overview The SqDRIFT procedure can be summarized as follows: ```plaintext Input: Hamiltonian H=∑c_i h_i, initial state |ψ0⟩, Krylov depth d, qDRIFT length N, #randomizations Nr, #shots S per circuit 1. Precompute λ = ∑_i |c_i| 2. Initialize sample pool B = ∅ 3. For k=0 to d-1: For r=1 to Nr: • Sample sequence {k_1,...,k_N}, i.i.d. from Pr[k_j=i]=|c_i|/λ • Construct V_r = ∏_{j=1}^N exp[−i h_{k_j} (λ t/N)] • Prepare approx Krylov state: |ψ̃_k^(r)⟩ = V_r^k |ψ0⟩ • Sample S bitstrings from |ψ̃_k^(r)⟩, add to B 4. Let B_unique be the set of unique bitstrings in B (dimension L′) 5. Classically compute H_{xy}=⟨x|H|y⟩, S_{xy}=⟨x|y⟩ for x,y∈B_unique 6. Solve H v = E S v for lowest eigenpair 7. Return E ``` [2508.02578][2603.08696] ### 3.2 Hamiltonian Mapping Electronic structure Hamiltonians are mapped to $n$-qubit Pauli string sums via Jordan–Wigner or Bravyi–Kitaev transformations, $$ H = \sum_{j=1}^L h_j P_j, $$ with $P_j \in \{I, X, Y, Z\}^{\otimes n}$. The procedure is fully general for arbitrary sparse sums. ## 4. Resource Requirements and Complexity | Resource | Scaling | Quantities Used (Typical) | |--------------------|-----------------------------------------------------|-----------------------------------------------| | Circuit depth | $O(N)$, with $N = O(\lambda^2 t^2 / \epsilon_Q)$ | $N=10$–$25$ for PAHs; $N\sim400$ for 100 qubits | | Krylov depth | $\mathrm{poly}(n)$ | $d=3$ (PAHs); $d=3165$ (half-Möbius study) | | Number of circuits | $d \times N_r$ | $N_r=500$–$1000$ | | Measurements | $d \times N_r \times S$ | $S=512$–$1024$ | - Total two-qubit gate depth per circuit is $O(N)$, e.g., $\approx 400$ for $100$-qubit experiments. - Classical overhead for the subspace diagonalization scales as $O(L'^3)$ where $L'$ is the number of unique sampled bitstrings (typically $\sim 10^3$). - The per-circuit error is set by $1/N$, independent of Hamiltonian term count. - Active-space size can be increased without additional quantum resources, as $d$ and $N$ are fixed for fixed target error [2508.02578][2603.08696]. ## 5. Representative Applications and Empirical Results ### 5.1 Polycyclic Aromatic Hydrocarbons (PAHs) - Naphthalene ($20$ qubits, $d=3$, $N_r=500$, $S=512$, $N=10$ or $25$): Achieved sub-millihartree energy error, surpassing CISD, using subspaces of $\sim 4000$ determinants per run. - Coronene ($48$ qubits, $d=3$, $N_r=1000$, $S=1024$, $N=5$–$25$): Subspace dimensions $10^4$–$3\times10^4$, variational energy within $0.11$ Ha of FCIQMC, outperforming CISD and approaching HCI accuracy [2508.02578]. ### 5.2 Large-Scale Molecules on Superconducting Hardware - Half-Möbius molecule: Simulations on $72$–$100$ qubits, fixed subspace size $d\approx 3165$, $N\approx 400$, $S\approx 10$. - Gate fidelities of $97.5$–$98.2$\%, readout fidelity $\approx 96$\%. Error mitigation achieved further improvement. - Correlation energy for $50$ orbitals ($100$ qubits) recovered $0.060$ Ha relative to Hartree–Fock, with resource requirements stable as active space grows [2603.08696]. ## 6. Scaling Properties and Hardware Compatibility SqDRIFT enables utility-scale quantum chemistry by trading circuit depth for randomization and sampling—resource modalities well-matched to NISQ and early fault-tolerant hardware. The qDRIFT-generated circuits are shallow and hardware-friendly. The scaling of quantum resources is polylogarithmic in system size for fixed error threshold and fixed ground-state concentration, and essentially independent of Hilbert space dimension. Classical post-processing (determinant selection, subspace Hamiltonian diagonalization) remains subdominant and is readily managed on modest HPC resources even at $d\sim 10^3$ [2508.02578][2603.08696]. ## 7. Significance and Outlook SqDRIFT demonstrates that quantum-assisted electronic structure calculations can be performed with circuit depths compatible with near-term device capabilities while maintaining provable convergence. Scaling studies confirm that larger active spaces yield systematically improved correlation energies without increased circuit depth, establishing a viable pathway toward quantum simulations of previously intractable chemical systems. With further progress in gate fidelity and coherence, SqDRIFT is projected to be applicable to active spaces of $60$–$80$ orbitals ($120$–$160$ qubits) and beyond, extending the reach of quantum computational chemistry well past the limits of classical exact diagonalization [2508.02578][2603.08696]. Source: https://www.emergentmind.com/topics/sqdrift