DF-SQD: Deterministic Fields for Sampling-Based Quantum Diagonalization

• URL: http://arxiv.org/abs/2609.01264v1
• Date: Tue, 01 Sep 2026 13:55:14 GMT
• Title: DF-SQD: Deterministic Fields for Sampling-Based Quantum Diagonalization
• Abstract summary: We introduce DF-SQD, a hybrid algorithm that derives deterministic auxiliary-field circuits from selected double-factorization leaves of the two-electron tensor.<n>For N2, DF-SQD is 45x more accurate with a 11.23% smaller subspace, and due to its ability to sample better bitstrings at lesser shots it is 2.93x faster than SQD in quantum devices.<n>For the iron-sulfur cluster, DF-SQD generated a subspace dimension of 221M with 400K shots, while SQD needed 1.5M shots to generate a 238M subspace.
• Score: 0.22344764434954256
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sampling-based quantum diagonalization method exploits Quantum-centric supercomputing platforms to sample bitstrings for Hamiltonian projection on a quantum computer, and then classically diagonalize the Hamiltonian to estimate the eigenvalues and eigenvectors. In current quantum devices an algorithm is useful when shallow quantum circuits with error mitigation support can discover better results while having either a proof of convergence or some method to explain trust in experiment. In this paper, we introduce DF-SQD, a hybrid algorithm that derives deterministic auxiliary-field circuits from selected double-factorization leaves of the two-electron tensor. The circuits propose occupation-number configurations, while selected configuration interaction evaluates the original active-space Hamiltonian and can recentre subsequent proposal rounds. On N2 (32 qubits; 6-31G basis) and a 40-qubit [Fe2S2(SCH3)4]2- active-space Hamiltonian, we show that DF-SQD improves the energy obtained from sampled determinant spaces while using shallow number-preserving circuits in both simulator and hardware runs. For N2, DF-SQD is 45x more accurate with a 11.23\% smaller subspace, and due to its ability to sample better bitstrings at lesser shots it is 2.93x faster than SQD in quantum devices. For the iron-sulfur cluster, DF-SQD generated a subspace dimension of 221M with 400K shots, while SQD needed 1.5M shots to generate a 238M subspace, thus we have better subspace recovery evident from the hardware at 3.75x reduced shots. At a matched 50M subspace dimension, DF-SQD is 1.32x more accurate (achieves a 24.5\% relative error reduction over standard SQD). So overall, our method is able to discover better results with shallower circuits, is sample efficient, uses configuration recovery (so has targeted error mitigation) and we have empirical convergence observation.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• SQD-Enabled Circuit Compression for Resource-Efficient Quantum Chemistry [8.027135734011297]
  Subspace Quantum Diagonalization (SQD) recovers ground-state energies by classically diagonalizing a Hamiltonian in the subspace spanned by quantum samples.<n>We show how much non-Clifford and variational expressivity can be removed from the sampling circuit before SQD accuracy degrades.
  arXiv  Detail & Related papers  (2026-07-16T14:46:10Z)
• Cluster-Adaptive Sample-Based Quantum Diagonalization for Strongly Correlated Systems [0.0]
  Strongly correlated electronic systems exhibit inherently multiconfigurational wave functions.<n>Quantum computing has emerged as a promising route to alleviate these limitations.<n>We introduce cluster-adaptive SQD, which clusters measurement samples via unsupervised learning.
  arXiv  Detail & Related papers  (2026-03-10T08:24:08Z)
• BPDQ: Bit-Plane Decomposition Quantization on a Variable Grid for Large Language Models [56.504879072674015]
  We propose Bit-Plane Decomposition Quantization (BPDQ), which constructs a variable quantization grid via bit-planes and scalar coefficients.<n>BPDQ enables serving Qwen2.5-72B on a single GTX 3090 with 83.85% GSM8K accuracy (vs. 90.83% at 16-bit)
  arXiv  Detail & Related papers  (2026-02-04T02:54:37Z)
• Noise-Resilient Quantum Chemistry with Half the Qubits [0.0]
  We introduce HSQD, a novel half-qubit quantum diagonalization approach that halves the qubit requirement for simulating a chemical system.<n>HSQD matches the accuracy of SQD on IBM quantum hardware using only half the number of qubits and 40% fewer measurements.<n>Results establish half-qubit SQD as a noise-resilient and resource-efficient pathway toward practical quantum advantage in strongly correlated chemistry.
  arXiv  Detail & Related papers  (2026-02-01T11:34:37Z)
• Quantum chemistry with provable convergence via randomized sample-based quantum diagonalization [0.0]
  We introduce a new SQD variant that combines SKQD with the qDRIFT randomized compilation of the Hamiltonian propagator.<n>The resulting algorithm, SqDRIFT, enables SQD calculations at the utility scale on chemical Hamiltonians.
  arXiv  Detail & Related papers  (2025-08-04T16:36:12Z)
• Enhancing the accuracy and efficiency of sample-based quantum diagonalization with phaseless auxiliary-field quantum Monte Carlo [0.0]
  We show that a non-perturbative approach, phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) can recover a substantial amount of correlation energy.<n> Extrapolation of the ph-AFQMC energy versus the energy variance of the SQD trial wavefunctions has the potential to further improve the energy accuracy.
  arXiv  Detail & Related papers  (2025-03-07T22:38:22Z)
• ParetoQ: Improving Scaling Laws in Extremely Low-bit LLM Quantization [73.60493264901359]
  We present a unified framework for rigorous comparisons across 1-bit, 1.58-bit, 2-bit, 3-bit, and 4-bit quantization settings.<n>We show that ternary, 2-bit, and 3-bit quantization maintains comparable performance in the size-accuracy trade-off.<n>Considering hardware constraints, 2-bit quantization offers promising potential for memory reduction and speedup.
  arXiv  Detail & Related papers  (2025-02-04T18:59:26Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Single-shot quantum error correction with the three-dimensional subsystem toric code [77.34726150561087]
  We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC) The 3D STC can be realized by measuring geometrically-local parity checks of weight at most three on the cubic lattice with open boundary conditions.
  arXiv  Detail & Related papers  (2021-06-04T17:35:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.