A quantum eigensolver for symmetric tridiagonal matrices

DOI10.1007/S11128-019-2211-ZzbMath1417.81103OpenAlexW2914692563WikidataQ128374895 ScholiaQ128374895MaRDI QIDQ670017

Hefeng Wang, Hua Xiang

Publication date: 15 March 2019

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-019-2211-z

zbMATH Keywords

eigenproblemquantum computationtridiagonal matricesquantum algorithmquantum simulation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Frequency-response methods in control theory (93C80) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient quantum algorithms for simulating sparse Hamiltonians
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem

This page was built for publication: A quantum eigensolver for symmetric tridiagonal matrices