Improved Measurement Cost Scaling in the Nonorthogonal Quantum Eigensolver

• URL: http://arxiv.org/abs/2608.12830v1
• Date: Thu, 13 Aug 2026 05:05:55 GMT
• Title: Improved Measurement Cost Scaling in the Nonorthogonal Quantum Eigensolver
• Abstract summary: We study a bottleneck for the nonorthogonal quantum eigensolver (NOQE)<n>We show that, after overlap thresholding, the eigenvalue sensitivity is controlled by the condition number of the retained overlap matrix.<n>Experiments on hydrogen chains and rings suggest that, in practice, the measurement cost of structured NOQE instances can grow even more slowly than this linear bound.
• Score: 1.6328866317851187
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum subspace diagonalization methods are promising algorithms for quantum chemistry on near-term quantum computers. These methods can estimate low-lying energies of molecular systems using shallow quantum circuits, at the cost of many circuit repetitions to estimate the projected matrix elements. Errors in these matrix elements can be converted into much larger eigenvalue errors by an ill-conditioned overlap matrix. We study this bottleneck for the nonorthogonal quantum eigensolver (NOQE), which constructs a compact multireference subspace from dressed unrestricted Hartree-Fock states. We prove a finite-shot perturbation bound showing that, after overlap thresholding, the eigenvalue sensitivity is controlled by the condition number of the retained overlap matrix rather than by a worst-case dimension factor. With a scalable thresholding scheme, the upper bound on the per-matrix-element shot count required to reach a target accuracy scales as $\mathcal{O}(M)$, improving on the previously known $\mathcal{O}(M^3)$ bound, where $M$ is the number of reference states. Numerical experiments on hydrogen chains and rings suggest that, in practice, the measurement cost of structured NOQE instances can grow even more slowly than this linear bound.

Related papers

• Decoded Quantum Interferometry Beyond Hamming: Rank-Metric and Translation Association Schemes [39.146761527401424]
  Decoded Quantum Interferometry (DQI) uses coherent decoding and a quantum Fourier transform to find high-quality solutions of structured optimisation problems.<n>We extend the core DQI mechanism beyond Hamming space to finite geometries with translation symmetry.<n>We find solutions with an effective-rank proxy near min(m,n)-l, and the corresponding expected score can be converted into a constant-probability bound on the residual rank of a sample.
  arXiv  Detail & Related papers  (2026-06-03T13:12:15Z)
• Solving a Linear System of Equations on a Quantum Computer by Measurement [0.0]
  We present a variational algorithm for fault tolerant quantum computing.<n>It can be applied to any computational task with a solution that is represented as eigenvector of a self-adjoint matrix.
  arXiv  Detail & Related papers  (2026-04-28T20:28:28Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Rigorous Maximum Likelihood Estimation for Quantum States [2.721477719641864]
  Existing quantum state tomography avoids rigorous termination of limited scalability due to their high computation and memory demands.<n>In this paper, we address these limitations by reforming a matrix by a factor.<n>We show that our method can demonstrate a laptop-of-the-art solution to state-of-the-art problems in under 5 hours.
  arXiv  Detail & Related papers  (2025-06-19T23:18:50Z)
• Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation [0.0]
  Estimating excited-state energies is challenging for classical algorithms due to exponential scaling with system size.<n>We present a quantum algorithm for estimating eigenvalues and singular values of parameterized matrix families.
  arXiv  Detail & Related papers  (2025-06-16T14:24:30Z)
• Hadamard Random Forest: Reconstructing real-valued quantum states with exponential reduction in measurement settings [1.857570444541311]
  We introduce a readout method for real-valued quantum states that reduces measurement settings required for state vector reconstruction to $O(N_mathrmq)$.<n>We experimentally validate our method up to 10 qubits on the latest available IBM quantum processor and demonstrate that it accurately extracts key properties such as entanglement and magic.
  arXiv  Detail & Related papers  (2025-05-09T22:12:54Z)
• Controlled measurement, Hermitian conjugation and normalization in matrix-manipulation algorithms [46.13392585104221]
  We introduce the concept of controlled measurement that solves the problem of small access probability to the desired state of ancilla.<n>Separate encoding of the real and imaginary parts of a complex matrix allows to include the Hermitian conjugation into the list of matrix manipulations.<n>We weaken the constraints on the absolute values of matrix elements unavoidably imposed by the normalization condition for a pure quantum state.
  arXiv  Detail & Related papers  (2025-03-27T08:49:59Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Entanglement-induced exponential advantage in amplitude estimation via state matrixization [11.282486674587236]
  Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing.<n>We introduce a novel algorithmic framework for quantum amplitude estimation by transforming pure states into their matrix forms.<n>We reconstruct amplitude estimation algorithms within the novel matrixization framework through a technique known as channel block encoding.
  arXiv  Detail & Related papers  (2024-08-25T04:35:53Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.<n>Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.<n>We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• Quantum algorithms for calculating determinant and inverse of matrix and solving linear algebraic systems [43.53835128052666]
  We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)times (N-1)$ matrix.<n>The basic idea is to encode each row of the matrix into a pure state of some quantum system.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.