A Simple Quantum Linear-System Solver via Dissipation

Abstract

Dissipation has been recently demonstrated as a powerful primitive for designing quantum algorithms. We apply this viewpoint directly to linear-system solving, $Ax=b$. We construct a simple purely dissipative Lindbladian whose unique fixed point encodes the linear-system solution. We prove dimension-independent trace-distance mixing in $Θ(κ^2\log(1/\eps))$ time. We then show how to run this Lindbladian on digital quantum computers via collective block encoding and Lindbladian simulation, resulting in an $O\!\left(κ^2\log(1/\eps) \frac{\log(κ/\eps)}{\log\log(κ/\eps)}\right)$ query complexity for both $U_A$, the block encoding of $A$, and $U_b$, the $|b⟩$ state preparation unitary.

arXiv comment15 pages, 1 figure