SQD-Enabled Circuit Compression for Resource-Efficient Quantum Chemistry

• URL: http://arxiv.org/abs/2607.15076v2
• Date: Wed, 22 Jul 2026 16:11:27 GMT
• Title: SQD-Enabled Circuit Compression for Resource-Efficient Quantum Chemistry
• Abstract summary: 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.
• Score: 8.027135734011297
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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. Our implementation can be found at: https://github.com/zkysfls/cs-vqe-sqd

Related papers

• DF-SQD: Deterministic Fields for Sampling-Based Quantum Diagonalization [0.22344764434954256]
  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.
  arXiv  Detail & Related papers  (2026-09-01T13:55:14Z)
• Effective Dimension Governs Generalization in Quantum Kernel Vision Models [31.082191748525137]
  We show that entanglement structure and quantum noise are two knobs that move $d_rm eff$.<n>Amplitude damping contracts $d_rm eff$ and lifts test accuracy by up to $+13%$ along an inverted-U sweet spot.
  arXiv  Detail & Related papers  (2026-06-18T12:55:59Z)
• WinQ: Accelerating Quantization-Aware Training of Language Models Around Saddle Points [33.435461430591126]
  Quantization-aware training is widely adopted to quantize language models.<n>The main bottleneck is its slow convergence and early performance plateau.<n>We propose an algorithm called WinQ to accelerate QAT.
  arXiv  Detail & Related papers  (2026-05-17T14:20:51Z)
• 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)
• QASER: Breaking the Depth vs. Accuracy Trade-Off for Quantum Architecture Search [43.72215866683917]
  Quantum computing faces a key challenge: balancing the need for low circuit depth with the high accuracy required for complex computations.<n>We introduce a novel reinforcement learning approach featuring engineered reward functions, called textbfQASER.<n>We achieve up to 50% improved accuracy, while reducing 2-qubit gate counts and depths by 20%.
  arXiv  Detail & Related papers  (2025-11-20T11:53:38Z)
• Maximizing the nondemolition nature of a quantum measurement via an adaptive readout protocol [28.661156827387043]
  Quantum error correction (QEC) requires non-invasive measurements for fault tolerant quantum computing.<n>We develop a protocol for a $D-$dimensional system that switches to probing only the $D-1$ remaining subspace after a positive result.<n>This strategy minimizes measurement-induced errors by relying on negative-result measurement results that do not perturb the Hamiltonian.
  arXiv  Detail & Related papers  (2025-11-14T05:52:54Z)
• Enhancing Kerr-Cat Qubit Coherence with Controlled Dissipation [64.05054054401175]
  Kerr-cat qubit (KCQ) is a bosonic quantum processor.<n>KCQs are experimentally compatible with on-chip architectures and high-fidelity operations.<n>We present direct evidence that the bit-flip time in a KCQ is limited by leakage out of the qubit manifold.
  arXiv  Detail & Related papers  (2025-11-02T17:58:36Z)
• 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)
• Fault-tolerant fermionic quantum computing [39.58317527488534]
  We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether.<n>We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Purification and correction of quantum channels by commutation-derived quantum filters [0.22835610890984162]
  We present an explicit construction capable of correcting arbitrary noise in an n-qubit Clifford circuit using 2n ancillary qubits.<n>Unlike QEC, it achieves deterministic error reduction without encoding the input state.<n>We also propose an ancilla-efficient Pauli filter that removes nearly all low-weight erroneous Pauli components.
  arXiv  Detail & Related papers  (2024-07-29T17:01:48Z)
• Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits [0.0]
  We employ a quantum computer to solve a low-energy effective Hamiltonian for spin defects in diamond and aluminium nitride.<n>The spin singlet state is difficult to compute using density functional theory (DFT), which should be described by multiple Slater determinants.<n>This is the first instance of an encoded PITE circuit being executed on a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2024-07-15T09:07:54Z)
• Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
  Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another. We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST. The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
  arXiv  Detail & Related papers  (2024-05-10T23:46:35Z)
• Quantum subspace expansion in the presence of hardware noise [0.0]
  Finding ground state energies on current quantum processing units (QPUs) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of parametrized quantum circuits. We show how to integrate VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs.
  arXiv  Detail & Related papers  (2024-04-14T02:48:42Z)
• Quantum Davidson Algorithm for Excited States [42.666709382892265]
  We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
  arXiv  Detail & Related papers  (2022-04-22T15:03:03Z)

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.