Quantum query complexity with matrix-vector products

Abstract

We study quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. We show that for various problems, including computing the trace, determinant, or rank of a matrix or solving a linear system that it specifies, quantum computers do not provide an asymptotic speedup over classical computation. On the other hand, we show that for some problems, such as computing the parities of rows or columns or deciding if there are two identical rows or columns, quantum computers provide exponential speedup. We demonstrate this by showing equivalence between models that provide matrix-vector products, vector-matrix products, and vector-matrix-vector products, whereas the power of these models can vary significantly for classical computation.

arXiv comment19 pages. Added discussion of related prior work

References in corpus (7)

• Quantum algorithm for solving linear systems of equations
• Fast quantum algorithm for numerical gradient estimation
• Quantum algorithms and lower bounds for convex optimization
• Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems
• Simon's problem for linear functions
• Quantum algorithms for graph problems with cut queries
• Quantum query complexity of symmetric oracle problems