Quantum Seniority-based Subspace Expansion: Linear Combinations of Short-Circuit Unitary Transformations for Efficient Quantum Measurements

• URL: http://arxiv.org/abs/2509.01061v1
• Date: Mon, 01 Sep 2025 02:06:35 GMT
• Title: Quantum Seniority-based Subspace Expansion: Linear Combinations of Short-Circuit Unitary Transformations for Efficient Quantum Measurements
• Authors: Smik Patel, Praveen Jayakumar, Tao Zeng, Artur F. Izmaylov,
• Abstract summary: Quantum SENiority-based Subspace Expansion (Q-SENSE) is a hybrid quantum-classical algorithm.<n>It constructs Hamiltonian matrix elements on a quantum device and solves the resulting eigenvalue problem classically.
• Score: 2.5194067017943755
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum SENiority-based Subspace Expansion (Q-SENSE) is a hybrid quantum-classical algorithm that interpolates between the Variational Quantum Eigensolver (VQE) and Configuration Interaction (CI) methods. It constructs Hamiltonian matrix elements on a quantum device and solves the resulting eigenvalue problem classically. This seniority-symmetry-based approach reduces one of the primary limitations of VQE on near-term quantum hardware - circuit depth - by exchanging lower circuit complexity for the need to compute additional matrix elements. Unlike other expansion-based methods - such as Quantum Subspace Expansion (QSE), Quantum Krylov Subspace Expansion, and the Non-orthogonal Quantum Eigensolver - Q-SENSE leverages symmetry-induced orthogonality to construct basis states in distinct symmetry sectors. This not only guarantees orthogonality but also reduces the number of Hamiltonian terms that must be measured, as many terms are zero between different symmetry subspaces. By systematically combining symmetry principles with matrix-based techniques, Q-SENSE offers a scalable and resource-efficient potential route to quantum advantage on near-term quantum devices and in the early fault-tolerant regime.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  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)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• A quantum eigenvalue solver based on tensor networks [0.0]
  Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases. This study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.
  arXiv  Detail & Related papers  (2024-04-16T02:04:47Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Adaptive construction of shallower quantum circuits with quantum spin projection for fermionic systems [0.0]
  Current devices only allow for hybrid quantum-classical algorithms with a shallow circuit depth, such as variational quantum eigensolver (VQE) In this study, we report the importance of the Hamiltonian symmetry in constructing VQE circuits adaptively. We demonstrate that symmetry-projection can provide a simple yet effective solution to this problem, by keeping the quantum state in the correct symmetry space, to reduce the overall gate operations.
  arXiv  Detail & Related papers  (2022-05-14T17:08:18Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Variational Quantum-Neural Hybrid Error Mitigation [6.555128824546528]
  Quantum error mitigation (QEM) is crucial for obtaining reliable results on quantum computers. We show how variational quantum-neural hybrid eigensolver (VQNHE) algorithm is inherently noise resilient with a unique QEM capacity.
  arXiv  Detail & Related papers  (2021-12-20T08:07:58Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
  We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits. The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
  arXiv  Detail & Related papers  (2021-06-14T17:23:46Z)

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.