paper

Asymptotic Quantum Algorithm for the Toeplitz Systems

arXiv:1608.02184 · doi:10.1103/PhysRevA.97.062322

Abstract

Solving the Toeplitz systems, which is to find the vector such that given an Toeplitz matrix and a vector , has a variety of applications in mathematics and engineering. In this paper, we present a quantum algorithm for solving the linear equations of Toeplitz matrices, in which the Toeplitz matrices are generated by discretizing a continuous function. It is shown that our algorithm's complexity is nearly , where and are the condition number and the dimension of respectively. This implies our algorithm is exponentially faster than the best classical algorithm for the same problem if . Since no assumption on the sparseness of is demanded in our algorithm, it can serve as an example of quantum algorithms for solving non-sparse linear systems.

10 pages

References in corpus (8)

Cited by in corpus (15)