On a quantum algorithm for the resolution of systems of linear equations

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The numerical resolution of systems of linear equations is an important problem which recurs continously in applied sciences. In particular, it represents an indispensable tool in applied mathematics which can be utilized as a foundation to more complicated problems (e.g. optimization problems, partial differential equations, eigenproblems, etc.). In this work, we introduce a solver for systems of linear equations based on quantum mechanics. More specifically, given a system of linear equations we introduce an equivalent optimization problem which objective function defines an electrostatic potential. Then, we evolve a many-body quantum system immersed in this potential and show that the corresponding Wigner quasidistribution function converges to the global energy minimum. The simulations are performed by using the time-dependent, ab-initio, many-body Wigner Monte Carlo method. Finally, by numerically emulating the (random) process ofmeasurement,we demonstrate that one can extract the solution of the original mathematical problem. As a proof of concept we solve 3 simple, but different, linear systems with increasing complexity. The outcomes clearly show that our suggested approach is a valid quantum algorithm for the resolution of systems of linear equations.

Cite

CITATION STYLE

APA

Sellier, J. M., & Dimov, I. (2016). On a quantum algorithm for the resolution of systems of linear equations. Studies in Computational Intelligence, 610, 37–53. https://doi.org/10.1007/978-3-319-21133-6_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free