Quantum Linear System Algorithm for Dense Matrices
Solving linear systems of equations is a frequently encountered problem in machine learning and optimization. Given a matrix A and a vector b the task is to find the vector x such that Ax=b. We describe a quantum algorithm that achieves a sparsity-independent runtime scaling of O(κ^{2}sqrt[n]polylog...
Saved in:
| Published in: | Physical review letters Vol. 120; no. 5; p. 050502 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
02.02.2018
|
| ISSN: | 0031-9007, 1079-7114, 1079-7114 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!