Searcharxiv⌕ Search

arXiv · 2611.16610

A Quantum Algorithm for Computing All Eigenvalues and Eigenstates of Sparse Hermitian Matrices

Abstract

Computation of eigenvalues and eigenvectors of a sparse Hermitian matrix is a fundamental problem in algebra, arising both as a problem of independent interest and as a key subroutine in a wide range of computational and scientific applications. In this work, we develop a quantum algorithm that determines the spectrum of a sparse Hermitian matrix, defined as the set of its distinct eigenvalues, and for each eigenvalue, prepares a corresponding eigenvector as a quantum state in its eigenspace. The eigenvalues are represented as binary strings with a prescribed precision, while the corresponding eigenvectors are kept as quantum states, eliminating the need to reconstruct their classical counterparts. The algorithm instead enables estimation of expectation values $\braket{x|M|x}$, where $\ket{x}$ is a prepared eigenstate and $M$ is an observable. For an $n \times n$ $s$-sparse Hermitian matrix $H$, dense methods based on Householder tridiagonalization and QR iteration compute all eigenvalues and eigenvectors in $\mathcal{O}(n^3)$ time. Exploiting sparsity, the Lanczos method computes all eigenvalues in $\mathcal{O}(n^2 s)$ time in exact arithmetic, but recovering all eigenvectors still requires $\mathcal{O}(n^3)$ time. In contrast, our algorithm runs in time $\tilde{\mathcal{O}}(n s^2 \log^2 n / Δ_{\min})$, where $Δ_{\min}$ denotes the minimum spectral gap of the normalized matrix. For inverse gaps up to $Δ_{\min}^{-1} = \mathcal{O}(n)$, the most favorable scaling for $n$ distinct eigenvalues, attained by nearly uniformly spaced spectra such as those of perfect-state-transfer spin chains and the Sylvester-Kac matrix, and for sparsity up to $s = o(\sqrt{n}/\log n)$, the proposed algorithm achieves an improved asymptotic runtime over the classical $\mathcal{O}(n^3)$ approach for computing all eigenvalues and eigenvectors, under standard sparse-access assumptions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Krishnakanta Barik, Goutam Paul. 2026-11-12. A Quantum Algorithm for Computing All Eigenvalues and Eigenstates of Sparse Hermitian Matrices. https://searcharxiv.com/abs/2611.16610

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Diamond Quantum Oscilloscope

Quantum-enhanced metrology has achieved remarkable precision in parameter estimation, but extending these advantages to continuous time-dependent fields (waveform sensing) remains a formidable challenge due to the infinite-dimensional nature of the signal. Here, we report the first experimental realization of a room-temperature solid-state quantum oscilloscope based on a sequential quantum difference amplification strategy. Within a zero-order-hold reconstruction framework, our method completely bypasses the need for massive entanglement. Crucially, we demonstrate that the overall waveform reconstruction error unequivocally follows the theoretically predicted Heisenberg scaling of \(O(N^{-1/2})\), decisively surpassing the classical \(O(N^{-1/3})\) limit. This transformative precision requires approximately 30-fold fewer quantum resources than conventional methods to achieve the same waveform error. Furthermore, we demonstrate the reconstruction of a multicomponent waveform and distinctly resolve weak high-frequency components that are entirely drowned in the shot noise of classical sampling. These results transition quantum metrology from parameter estimation into a practical instrument, establishing a genuine quantum advantage in continuous waveform reconstruction and paving the way for critical applications such as nanoscale nuclear magnetic resonance imaging, where detecting extremely weak signals is crucial for resolving molecular structures.

quant-ph↗

Entanglement preservation and Clauser-Horne nonlocality in electromagnetically induced transparency quantum memories

Understanding how decoherence-induced loss affects entanglement and nonlocal correlations in quantum memories is important for quantum information science. Here we develop a quantitative description of photonic quantum states retrieved from electromagnetically induced transparency (EIT) memories in a ground-state-decoherence-limited regime. Using the dark-state-polariton formalism, we derive the attenuation factor of the retrieved probe mode from the EIT dynamics. This attenuation depends on the coupling field and ground-state coherence decay and is not introduced as an independent phenomenological loss parameter. Within a specified quantum-limited pure-loss model, we use this attenuation to obtain the reduced photonic density operator. We show that, in the symmetric case, the complete retrieved state of an initially path-entangled single photon remains entangled for any nonzero storage efficiency, despite acquiring a vacuum component. In contrast, violation of the unconditional Clauser-Horne inequality under displaced on/off detection without post-selection requires an intrinsic efficiency above 89.7%. We further derive the retrieved N-qubit photonic density operator for multiple independently operating EIT memories. These results establish a quantitative connection between EIT memory dynamics, retrieved quantum states, and operational nonlocality benchmarks under explicit channel assumptions.

quant-ph↗

Geometric encoding of turbulence for end-to-end quantum simulation

Simulating multiscale turbulence in engineering remains challenging. Any quantum advantage for such simulations requires efficient initial-state preparation. Yet exact loading of an arbitrary classical snapshot requires exponential quantum resources. We introduce "turbuloscope", a physics-informed geometric method that generates statistically representative turbulent initial states in a gate-based register from a parameterized Pauli-spinor multiscale distribution. Scale invariance renders conditional rotations approximately affine in Gray-code space, enabling linear-depth, ancilla-free preparation. The generalized Madelung transform and Hopf fibration map the encoded Pauli spinor to fluid observables and vortex tubes. The qubit count scales logarithmically with the Reynolds number, yielding an exponential reduction in preparation overhead relative to full-grid classical spectral synthesis. We classically emulate a 30-qubit preparation circuit and generate a turbulent field over one billion grid points at a scale-inferred Reynolds number of 35,000, exhibiting Kolmogorov's five-thirds energy spectrum, tangled vortex tubes, and intermittency. This method provides scalable initial states for quantum simulation of turbulence and multiscale systems.

quant-ph↗