Abstract
Solving linear systems of equations is of vital importance in various fields of science. With the scale of calculation soaring, classical computers are intractable, and the advantage of quantum computing is reflected. Quantum algorithm has exponential acceleration in solving the linear systems for sparse and well-conditioned coefficient matrix A with dimension N × N. In this paper, we present a quantum algorithm to solve matrix equations of the form AX = B, where and are unit vectors. The problem can be intuitively treated as solving n linear systems simultaneously, which will needs complexity by the famous HHL algorithm. We demonstrate that in our algorithm the scale of complexity is . In the error analysis part, phase estimation is discussed in details.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
