The quantum query complexity of the determinant |
| |
| Authors: | Sebastian Dö rn |
| |
| Affiliation: | a Inst. für Theoretische Informatik, Universität Ulm, 89069 Ulm, Germany
b Fak. Elektronik und Informatik, HTW Aalen, 73430 Aalen, Germany |
| |
| 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. |
| |
| Keywords: | Computational complexity Quantum query complexity Determinant Matrix power |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
