HHL algorithm (Harrow–Hassidim–Lloyd algorithm)

The HHL algorithm prepares a quantum state proportional to $A^{-1}b$ for a sparse, efficiently accessible, well-conditioned linear system $Ax=b$, provided that $|b⟩$ can be prepared efficiently. Its runtime depends polynomially on the sparsity, condition number, inverse precision, and $\log N$.