Sparse Linear System

In this case, we restrict $A$ to be sparse (i.e. $A$ only has $O(n)$ nonzero entries).

Parameters

$n$ : number of variables and number of equations
$m$ : number of nonzero entries in matrix
$k$ : ratio between largest and smallest eigenvalues

Related Problems

Sparse Quantum Linear System

Bounded Norm Quantum Linear System

Toeplitz Quantum Linear System

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 1 of 1 algorithms

				See more
Harrow (Quantum)	2009	$O(k^2 \log n)$	$O(\log n)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table