| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427863 | Information Processing Letters | 2009 | 4 Pages |
Abstract
In this paper we give tight quantum query complexity bounds of some important linear algebra problems. We prove Θ(n2) quantum query bounds for verify the determinant, rank, matrix inverse and the matrix power problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
