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...
المؤلفون الرئيسيون: | Epperly, EN, Lin, L, Nakatsukasa, Y |
---|---|
التنسيق: | Journal article |
اللغة: | English |
منشور في: |
Society for Industrial and Applied Mathematics
2022
|
مواد مشابهة
-
Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
حسب: Gwonhak Lee, وآخرون
منشور في: (2024-09-01) -
Active Block Diagonal Subspace Clustering
حسب: Ziqi Xie, وآخرون
منشور في: (2021-01-01) -
Subspace Clustering with Block Diagonal Sparse Representation
حسب: Fang, Xian, وآخرون
منشور في: (2021) -
Deep Subspace Clustering with Block Diagonal Constraint
حسب: Jing Liu, وآخرون
منشور في: (2020-12-01) -
On the structure of the fundamental subspaces of acyclic matrices with 0 in the diagonal
حسب: Daniel Jaume, وآخرون
منشور في: (2023-08-01)