Filter-assisted quantum subspace diagonalization via wavefunction sparsity engineering

• URL: http://arxiv.org/abs/2605.28040v1
• Date: Wed, 27 May 2026 06:42:58 GMT
• Title: Filter-assisted quantum subspace diagonalization via wavefunction sparsity engineering
• Abstract summary: Subspace diagonalization techniques based on quantum sampling have emerged as promising approaches for approximating ground-state energies of many-body systems.<n>Here, we introduce a filter-assisted quantum diagonalization protocol that engineers wavefunction sparsity via a quantum filter.<n>Our results show that the proposed protocol significantly enhances wavefunction sparsity, reduces ground-state energy estimation errors by orders of magnitude, and substantially lowers sampling overhead.
• Score: 3.551170135656655
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Subspace diagonalization techniques based on quantum sampling, such as quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have recently emerged as promising quantum-centric approaches for approximating ground-state energies of many-body systems. However, their performance is fundamentally limited by an intrinsic trade-off between sampling efficiency and the sparsity of the ground-state wavefunction, which becomes particularly severe in strongly correlated systems. Here, we introduce a filter-assisted SQD protocol that engineers wavefunction sparsity via a quantum filter, i.e., a unitary transformation of the Hamiltonian designed to concentrate the ground-state weight onto a small number of computational basis states. Using the Gini coefficient as a robust sparsity measure, we establish a quantitative relationship between wavefunction sparsity and the resource requirements of SQD, providing theoretical bounds on the required subspace dimension and sampling cost. To realize the quantum filter, we employ a tensor-network-based circuit-encoding algorithm that maps target states to quantum circuits with controllable fidelity. We benchmark our approach on the quantum Ising model with transverse and longitudinal fields using both numerical simulations and quantum hardware experiments. Our results demonstrate that, compared with standard SQD, the proposed protocol significantly enhances wavefunction sparsity, reduces ground-state energy estimation errors by orders of magnitude, and substantially lowers sampling overhead. These findings establish filter-assisted subspace diagonalization as a powerful and scalable framework for quantum many-body calculations in the strongly correlated regime.

Related papers

• Improved quantum sampling methods for molecular simulations [0.0]
  We show that sample-based quantum diagonalization (SQD) performance can be strongly influenced by uncontrolled growth of the classical diagonalization subspace.<n>We then address the problem of efficiently discovering physically relevant, energy-lowering configurations by introducing a measurement protocol based on non-orthogonal configuration interaction (NOCI)<n>These improvements persist even under fixed classical resource budgets, demonstrating that the resulting configurations are of higher quality rather than being more numerous.
  arXiv  Detail & Related papers  (2026-08-12T02:27:06Z)
• Quantum computation at the edge of chaos [0.3499870393443268]
  We introduce quantum sparsity as a principle based on minimizing quantum information shared across multiple parties.<n>We propose a practical implementation of this principle using the topological Entanglement Entropy (TEE) as a cost function regularizer.
  arXiv  Detail & Related papers  (2026-04-16T18:02:17Z)
• Basis Adaptive Algorithm for Quantum Many-Body Systems on Quantum Computers [2.4713653282916126]
  A new basis adaptive algorithm is introduced to efficiently find the ground-state properties of quantum many-body systems.<n>We benchmark this approach on the spin-1/2 XXZ chain up to 24 qubits using the IBM Heron processor.
  arXiv  Detail & Related papers  (2025-12-14T16:34:19Z)
• Towards Quantum Enhanced Adversarial Robustness with Rydberg Reservoir Learning [45.92935470813908]
  Quantum computing reservoir (QRC) leverages the high-dimensional, nonlinear dynamics inherent in quantum many-body systems.<n>Recent studies indicate that perturbation quantums based on variational circuits remain susceptible to adversarials.<n>We investigate the first systematic evaluation of adversarial robustness in a QR based learning model.
  arXiv  Detail & Related papers  (2025-10-15T12:17:23Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
  It is critically important to analyze the achievability of quantum advantage under realistic imperfections.<n>We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which can only distribute noisy entangled states.
  arXiv  Detail & Related papers  (2024-09-25T16:55:07Z)
• A circuit-generated quantum subspace algorithm for the variational quantum eigensolver [0.0]
  We propose combining quantum subspace techniques with the variational quantum eigensolver (VQE) In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits. The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Quantum Federated Learning with Entanglement Controlled Circuits and Superposition Coding [44.89303833148191]
  We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs) We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs. In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
  arXiv  Detail & Related papers  (2022-12-04T03:18:03Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)

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.