A team from the Indian Statistical Institute and their collaborators has proposed a quantum algorithm that can simultaneously estimate all eigenvalues of a sparse Hermitian matrix and retain the corresponding eigenvectors as quantum states without classical reconstruction. The algorithm is based on Quantum Phase Estimation and has a runtime of approximately \widetilde{O}(ns^2 log^2 n / Δ_min). Compared with the n^3 scaling of classical methods, it offers advantages when the spectral gap is small and the inverse spectral gap is as high as O(n).
Source:Quantum Zeitgeist · Read original
Leave a Reply