Quantum algorithm for estimating largest eigenvalues
From MaRDI portal
Publication:6068124
DOI10.1016/j.physleta.2023.129138MaRDI QIDQ6068124
Publication date: 10 November 2023
Published in: Physics Letters. A (Search for Journal in Brave)
Quantum computation (81P68) Estimates of eigenvalues in context of PDEs (35P15) Linear equations (linear algebraic aspects) (15A06) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The quest for a quantum neural network
- Random matrices: universality of local eigenvalue statistics
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Supervised learning with quantum computers
- Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix
- Fast sparse matrix multiplication
- Quantum algorithms for algebraic problems
- Estimating the Largest Eigenvalue of a Positive Definite Matrix
- On Estimating the Largest Eigenvalue with the Lanczos Algorithm
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On a Multivariate Eigenvalue Problem, Part I: Algebraic Theory and a Power Method
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
This page was built for publication: Quantum algorithm for estimating largest eigenvalues