Mirror subspace diagonalization: a quantum Krylov algorithm with near-optimal sampling cost

• URL: http://arxiv.org/abs/2511.20998v1
• Date: Wed, 26 Nov 2025 02:53:22 GMT
• Title: Mirror subspace diagonalization: a quantum Krylov algorithm with near-optimal sampling cost
• Authors: Shota Kanasugi, Yuya O. Nakagawa, Norifumi Matsumoto, Yuichiro Hidaka, Kazunori Maruyama, Hirotaka Oshima,
• Abstract summary: We introduce an alternative method, dubbed mirror subspace diagonalization (MSD), which approaches the theoretical lower bound of the sampling cost for quantum Krylov algorithms.<n>MSD can achieve sampling cost reductions ranging from approximately 10 to 10,000 times compared to the conventional quantum Krylov algorithm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Krylov algorithms have emerged as a promising approach for ground-state energy estimation in the near-term quantum computing era. A major challenge, however, lies in their inherently substantial sampling cost, primarily due to the individual measurement of each term in the Hamiltonian. While various techniques have been proposed to mitigate this issue, the sampling overhead remains a significant bottleneck, especially for practical large-scale electronic structure problems. In this work, we introduce an alternative method, dubbed mirror subspace diagonalization (MSD), which approaches the theoretical lower bound of the sampling cost for quantum Krylov algorithms. MSD leverages a finite-difference formula to express the Hamiltonian operator as a linear combination of time-evolution unitaries with symmetrically shifted timesteps, enabling efficient estimation of the Hamiltonian matrix within the Krylov subspace. In this scheme, the finite difference and statistical errors are simultaneously minimized by optimizing the timestep parameter and shifting the energy spectrum. Consequently, MSD attains the lower bound of the sampling cost of the quantum Krylov algorithms up to a logarithmic factor. Furthermore, we employ classical post-processing to infer Hamiltonian moments, which are used to mitigate the ground state energy error based on the Lanczos scheme. Through theoretical analysis of the sampling cost, we demonstrate that MSD is particularly effective when the spectral norm of the Hamiltonian is significantly smaller than its 1-norm. Such a situation arises, for example, in high-accuracy simulations of molecules using large basis sets that incorporate strong electronic correlations. Numerical results for various molecular models reveal that MSD can achieve sampling cost reductions ranging from approximately 10 to 10,000 times compared to the conventional quantum Krylov algorithm.

Related papers

• Sample-Based Krylov Quantum Diagonalization for the Schwinger Model on Trapped-Ion and Superconducting Quantum Processors [26.315169722500556]
  We apply the recently proposed Sample-based Krylov Quantum Diagonalization (SKQD) method to lattice gauge theories.<n>We study the dependence of the ground-state energy and particle number on the value of the $theta$-term, accurately capturing the model's phase structure.<n>We show that SKQD substantially reduces the effective Hilbert space, and although the Krylov space dimension still scales exponentially, the slower growth underscores its promise for simulating lattice gauge theories in larger volumes.
  arXiv  Detail & Related papers  (2025-10-30T19:21:06Z)
• Enhanced Krylov Methods for Molecular Hamiltonians: Reduced Memory Cost and Complexity Scaling via Tensor Hypercontraction [2.2022550150705804]
  We introduce an algorithm that is simultaneously memory-efficient and low-scaling for applying ab initio molecular Hamiltonians to matrix-product states (MPS)<n>These gains carry over to Krylov subspace methods, which can find low-lying eigenstates and simulate quantum time evolution.<n>Our algorithm is highly parallelizable and thus lends itself to large-scale HPC simulations.
  arXiv  Detail & Related papers  (2024-09-19T12:34:06Z)
• Efficient Strategies for Reducing Sampling Error in Quantum Krylov Subspace Diagonalization [1.1999555634662633]
  This work focuses on quantifying sampling errors during the measurement of matrix element in the projected Hamiltonian.<n>We propose two measurement strategies: the shifting technique and coefficient splitting.<n> Numerical experiments with electronic structures of small molecules demonstrate the effectiveness of these strategies.
  arXiv  Detail & Related papers  (2024-09-04T08:06:06Z)
• Sampling Error Analysis in Quantum Krylov Subspace Diagonalization [1.3108652488669736]
  We present a nonasymptotic theoretical framework to assess the relationship between sampling noise and its effects on eigenvalues. We also propose an optimal solution to cope with large condition numbers by eliminating the ill-conditioned bases.
  arXiv  Detail & Related papers  (2023-07-30T17:22:35Z)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• A stochastic quantum Krylov protocol with double factorized Hamiltonians [0.0]
  We propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator, $e-ihatH tau$, as a linear combination of unitaries and subsequently uses a sampling procedure to reduce circuit depth requirements.
  arXiv  Detail & Related papers  (2022-11-15T16:27:41Z)
• 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)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)

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.