A theory of quantum subspace diagonalization
Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large-scale eigenvalue problems using quantum computers. Unfortunately, these methods require the solution of an ill-conditioned generalized eigenvalue problem, with a matrix pencil corrupted by a nonnegligi...
Príomhchruthaitheoirí: | Epperly, EN, Lin, L, Nakatsukasa, Y |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
Society for Industrial and Applied Mathematics
2022
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
de réir: Gwonhak Lee, et al.
Foilsithe / Cruthaithe: (2024-09-01) -
Active Block Diagonal Subspace Clustering
de réir: Ziqi Xie, et al.
Foilsithe / Cruthaithe: (2021-01-01) -
Subspace Clustering with Block Diagonal Sparse Representation
de réir: Fang, Xian, et al.
Foilsithe / Cruthaithe: (2021) -
Deep Subspace Clustering with Block Diagonal Constraint
de réir: Jing Liu, et al.
Foilsithe / Cruthaithe: (2020-12-01) -
On the structure of the fundamental subspaces of acyclic matrices with 0 in the diagonal
de réir: Daniel Jaume, et al.
Foilsithe / Cruthaithe: (2023-08-01)