DeepAI AI Chat
Log In Sign Up

Faster quantum-inspired algorithms for solving linear systems

by   Changpeng Shao, et al.

We establish an improved classical algorithm for solving linear systems in a model analogous to the QRAM that is used by quantum linear solvers. Precisely, for the linear system A = $̱, we show that there is a classical algorithm that outputs a data structure forallowing sampling and querying to the entries, whereis such that- A^-1≤ϵA^-1. This output can be viewed as a classical analogue to the output of quantum linear solvers. The complexity of our algorithm isO(κ_F^6 κ^2/ϵ^2 ), whereκ_F = A_FA^-1andκ= AA^-1. This improves the previous best algorithm [Gilyén, Song and Tang, arXiv:2009.07268] of complexityO(κ_F^6 κ^6/ϵ^4). Our algorithm is based on the randomized Kaczmarz method, which is a particular case of stochastic gradient descent. We also find that whenAis row sparse, this method already returns an approximate solutionin timeO(κ_F^2), while the best quantum algorithm known returns|⟩in timeO(κ_F)whenAis stored in the QRAM data structure. As a result, assuming access to QRAM and ifAis row sparse, the speedup based on current quantum algorithms is quadratic.


page 1

page 2

page 3

page 4


An improved quantum-inspired algorithm for linear regression

We give a classical algorithm for linear regression analogous to the qua...

An improved quantum algorithm for low-rank rigid linear regressions with vector solution outputs

Let A∈ℝ^n× d, ∈̱ℝ^n and λ>0, for rigid linear regression _ Z() = ...

A quantum algorithm for simulating non-sparse Hamiltonians

We present a quantum algorithm for simulating the dynamics of Hamiltonia...

Mean estimation when you have the source code; or, quantum Monte Carlo methods

Suppose y is a real random variable, and one is given access to “the cod...

Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms

We study the potential utility of classical techniques of spectral spars...

Memory Compression with Quantum Random-Access Gates

In the classical RAM, we have the following useful property. If we have ...

Fast inversion, preconditioned quantum linear system solvers, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating i...