Quantum singular-value decomposition of nonsparse low-rank matrices
We present a method to exponentiate nonsparse indefinite low-rank matrices on a quantum computer. Given access to the elements of the matrix, our method allows one to determine the singular values and their associated singular vectors in time exponentially faster in the dimension of the matrix than...
Main Authors: | Rebentrost, Frank, Steffens, Adrian, Marvian Mashhad, Iman, Lloyd, Seth |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mechanical Engineering |
Format: | Article |
Language: | English |
Published: |
American Physical Society
2018
|
Online Access: | http://hdl.handle.net/1721.1/114453 https://orcid.org/0000-0002-6728-8163 |
Similar Items
-
An efficient quantum algorithm for spectral estimation
by: Eisert, Jens, et al.
Published: (2017) -
An efficient quantum algorithm for spectral estimation
by: Adrian Steffens, et al.
Published: (2017-01-01) -
A higher-order generalized singular value decomposition for rank-deficient matrices
by: Kempf, I, et al.
Published: (2023) -
Singular Value Decomposition of Spatial Matrices
by: Pavel Iljin, et al.
Published: (2022-10-01) -
Global Lunar Crater Density Using Buffered Nonsparseness Correction
by: Ya Huei Huang, et al.
Published: (2024-01-01)