Quantum Jacobi-Davidson Method

• URL: http://arxiv.org/abs/2602.01670v1
• Date: Mon, 02 Feb 2026 05:39:09 GMT
• Title: Quantum Jacobi-Davidson Method
• Authors: Shaobo Zhang, Akib Karim, Harry M. Quiney, Muhammad Usman,
• Abstract summary: We develop and implement the Quantum Jacobi-Davidson (QJD) method and its quantum diagonalization variant, the Sample-Based Quantum Jacobi-Davidson (SBQJD) method.<n>Our results show that both QJD and SBQJD achieve significantly faster convergence and fewer Pauli measurements compared to the recently reported Quantum Davidson method.<n>These findings establish the QJD framework as an efficient general-purpose subspace-based technique for solving quantum eigenvalue problems.
• Score: 2.6739754727815708
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Computing electronic structures of quantum systems is a key task underpinning many applications in photonics, solid-state physics, and quantum technologies. This task is typically performed through iterative algorithms to find the energy eigenstates of a Hamiltonian, which are usually computationally expensive and suffer from convergence issues. In this work, we develop and implement the Quantum Jacobi-Davidson (QJD) method and its quantum diagonalization variant, the Sample-Based Quantum Jacobi-Davidson (SBQJD) method, and demonstrate their fast convergence for ground state energy estimation. We assess the intrinsic algorithmic performance of our methods through exact numerical simulations on a variety of quantum systems, including 8-qubit diagonally dominant matrices, 12-qubit one-dimensional Ising models, and a 10-qubit water molecule (H$_2$O) Hamiltonian. Our results show that both QJD and SBQJD achieve significantly faster convergence and require fewer Pauli measurements compared to the recently reported Quantum Davidson method, with SBQJD further benefiting from optimized reference state preparation. These findings establish the QJD framework as an efficient general-purpose subspace-based technique for solving quantum eigenvalue problems, providing a promising foundation for sparse Hamiltonian calculations on future fault-tolerant quantum hardware.

Related papers

• 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)
• 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)
• The quantum super-Krylov method [0.6066442015301664]
  We present a novel KQD method that uses only real-time evolutions and recovery probabilities.<n>We present a novel derivative estimation algorithm that is robust to noisy data.<n>Under assumptions on the spectrum of the Hamiltonian, we prove that our algorithm converges exponentially quickly to the ground-state energy.
  arXiv  Detail & Related papers  (2024-12-23T05:21:43Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Truncation technique for variational quantum eigensolver for Molecular Hamiltonians [0.0]
  variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for noisy quantum devices. We propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian. This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer.
  arXiv  Detail & Related papers  (2024-02-02T18:45:12Z)
• Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding [12.312016285899487]
  Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian.<n>In this paper, we propose a technique named Hamiltonian embedding.<n>This technique simulates a desired sparse Hamiltonian by embedding it into the evolution of a larger and more structured quantum system.
  arXiv  Detail & Related papers  (2024-01-16T18:19:29Z)
• Improved iterative quantum algorithm for ground-state preparation [4.921552273745794]
  We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian system. Our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
  arXiv  Detail & Related papers  (2022-10-16T05:57:43Z)
• 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)
• Partonic collinear structure by quantum computing [0.9384929040129515]
  We present a systematic quantum algorithm, which integrates hadronic state preparation and the evaluation of real-time light-front correlators. As a proof of concept, we demonstrate the first direct simulation of the PDFs in the 1+1 dimensional Nambu-Jona-Lasinio model. The presented quantum algorithm is expected to have many applications in high energy particle and nuclear physics.
  arXiv  Detail & Related papers  (2021-06-07T18:00:02Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.