Curator's Take
AI Commentary
This article shows that Subspace Quantum Diagonalization can tolerate aggressive simplification of VQE circuits without sacrificing chemical‑accuracy ground‑state energies, turning circuit depth—a major bottleneck on noisy hardware—into a tunable resource. By combining gradient‑based operator pruning with Clifford rounding, the authors achieve up to 50 % compression and a 33× simulation speedup while still delivering reliable results across dozens of molecular benchmarks, echoing recent pushes toward error‑mitigated, near‑term quantum chemistry. The hardware demonstration on IBM devices underscores that such “compression‑first” strategies could make practical quantum‑chemical simulations feasible well before fault‑tolerant machines arrive, though the approach currently relies on sufficient ground‑state overlap in the sampled bitstrings.
— Mark Eatherly
Summary
Subspace Quantum Diagonalization (SQD) recovers ground-state energies by classically diagonalizing a Hamiltonian in the subspace spanned by quantum samples, requiring only bitstrings with sufficient ground-state overlap rather than an accurate variational energy. We reveal and exploit this underexplored robustness property: how much non-Clifford and variational expressivity can be removed from the sampling circuit before SQD accuracy degrades? We answer through two complementary compression techniques: gradient-based operator pruning, which discards low-impact excitation operators, and Clifford rounding, which snaps remaining parameters to the nearest Clifford angle. Both of these techniques can be applied to a VQE ansatz on a qubit-reduced Hamiltonian. A systematic ablation study across 21 molecules shows that median SQD error stays within chemical accuracy even at 50\% compression on both axes, while simulation speedup reaches $33\times$. Hardware validation on 6 molecules on IBM quantum hardware confirms up to $2.8\times$ transpiled-depth reduction with zero loss in SQD accuracy.