On solving classes of positive-definite quantum linear systems with quadratically improved runtime in the condition number.
Davide OrsucciVedran DunjkoPublished in: Quantum (2021)
Keyphrases
- linear systems
- interior point methods
- condition number
- positive definite
- sparse linear systems
- sufficient conditions
- coefficient matrix
- dynamical systems
- covariance matrix
- kernel function
- kernel matrix
- quadratic programming
- semi parametric
- convex optimization
- linear programming
- machine learning
- semidefinite programming
- least squares
- np hard
- special case
- artificial neural networks
- image processing