A Theory of Quantum Subspace Diagonalization

DOI10.1137/21M145954XMaRDI QIDQ5094221

Lin Lin, Yuji Nakatsukasa, Ethan N. Epperly

Publication date: 2 August 2022

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.07492

zbMATH Keywords

generalized eigenvalue problemmatrix perturbation theoryquantum linear algebraquantum subspace diagonalization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Miscellaneous inequalities involving matrices (15A45) Matrix pencils (15A22) Quantum algorithms and complexity in the theory of computing (68Q12)

Uses Software

• QuSpin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations
• Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
• Kronecker's canonical form and the QZ algorithm
• Computation of zeros of linear multivariable systems
• Perturbation bounds for the definite generalized eigenvalue problem
• Low-Rank Matrix Approximations Do Not Need a Singular Value Gap
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• An Introduction to Quantum Computing, without the Physics
• Numerical Methods in Matrix Computations
• An Introduction to Matrix Concentration Inequalities
• Group Algebra, Convolution Algebra, and Applications to Quantum Mechanics
• The Rotation of Eigenvectors by a Perturbation. III
• An Algorithm for the Ill-Conditioned Generalized Eigenvalue Problem

This page was built for publication: A Theory of Quantum Subspace Diagonalization