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 $\Theta(\kappa^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(\kappa^2\log(1/\eps) \frac{\log(\kappa/\eps)}{\log\log(\kappa/\eps)}\right)$ query complexity for both $U_A$, the block encoding of $A$, and $U_b$, the $|b\rangle$ state preparation unitary.

arXiv:2609.12284 [quant-ph]

(or arXiv:2609.12284v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.12284 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.