Determinant: Old Algorithms, New Insights
SIAM Journal on Discrete Mathematics
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Quantum Cryptanalysis of Hash and Claw-Free Functions
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Quantum Algorithms for Element Distinctness
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Quantum Walk Algorithm for Element Distinctness
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum verification of matrix products
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The quantum complexity of group testing
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Quantum algorithms for matching and network flows
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Quantum complexity of testing group commutativity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The quantum query complexity of algebraic properties
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.89 |
In this paper we give tight quantum query complexity bounds of some important linear algebra problems. We prove @Q(n^2) quantum query bounds for verify the determinant, rank, matrix inverse and the matrix power problem.