Abstract
AbstractSolving linear equations is a basic and significant mathematical task, and it can be executed by variational quantum algorithm (VQA) with quantum advantages by leveraging near‐term quantum device and classical optimizer. In the above algorithm, the coefficient matrix should be decomposed first but slowly with the traditional method, for realizing an effective quantum circuit. In this paper, a general framework for preparing a fast Pauli decomposition for solving arbitrary linear equations using VQA is proposed. This method has a simpler form and reduces the complexity of matrix decomposition compared with the traditional one. Moreover, the concrete tables of two and three qubits cases are given for looking up quickly and the instances of Toeplitz matrix, Yule–Walker, and arbitrary equations are demonstrated. Finally, numerical simulations are given to verify this method. This work provides a more convenient and faster preparatory phase for solving linear equations using VQA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.