Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Enhancing the Quantum Linear Systems AlgorithmUsing Richardson Extrapolation

Enhancing the Quantum Linear Systems AlgorithmUsing Richardson Extrapolation We present a quantum algorithm to solve systems of linear equations of the form Ax=b, where A is a tridiagonal Toeplitz matrix and b results from discretizing an analytic function, with a circuit complexity of O(1/√ε, poly (log κ, log N)), where N denotes the number of equations, ε is the accuracy, and κ the condition number. The repeat-until-success algorithm has to be run O(κ/(1-ε)) times to succeed, leveraging amplitude amplification, and needs to be sampled O(1/ε2) times. Thus, the algorithm achieves an exponential improvement with respect to N over classical methods. In particular, we present efficient oracles for state preparation, Hamiltonian simulation, and a set of observables together with the corresponding error and complexity analyses. As the main result of this work, we show how to use Richardson extrapolation to enhance Hamiltonian simulation, resulting in an implementation of Quantum Phase Estimation (QPE) within the algorithm with 1/√ε circuits that can be run in parallel each with circuit complexity 1/√ ε instead of 1/ε. Furthermore, we analyze necessary conditions for the overall algorithm to achieve an exponential speedup compared to classical methods. Our approach is not limited to the considered setting and can be applied to more general problems where Hamiltonian simulation is approximated via product formulae, although our theoretical results would need to be extended accordingly. All the procedures presented are implemented with Qiskit and tested for small systems using classical simulation as well as using real quantum devices available through the IBM Quantum Experience. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Quantum Computing Association for Computing Machinery

Enhancing the Quantum Linear Systems AlgorithmUsing Richardson Extrapolation

Download PDF
37 pages

Loading next page...
 
/lp/association-for-computing-machinery/enhancing-the-quantum-linear-systems-algorithmusing-richardson-T6mxjjUDxp

References (103)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2022 Association for Computing Machinery.
ISSN
2643-6809
eISSN
2643-6817
DOI
10.1145/3490631
Publisher site
See Article on Publisher Site

Abstract

We present a quantum algorithm to solve systems of linear equations of the form Ax=b, where A is a tridiagonal Toeplitz matrix and b results from discretizing an analytic function, with a circuit complexity of O(1/√ε, poly (log κ, log N)), where N denotes the number of equations, ε is the accuracy, and κ the condition number. The repeat-until-success algorithm has to be run O(κ/(1-ε)) times to succeed, leveraging amplitude amplification, and needs to be sampled O(1/ε2) times. Thus, the algorithm achieves an exponential improvement with respect to N over classical methods. In particular, we present efficient oracles for state preparation, Hamiltonian simulation, and a set of observables together with the corresponding error and complexity analyses. As the main result of this work, we show how to use Richardson extrapolation to enhance Hamiltonian simulation, resulting in an implementation of Quantum Phase Estimation (QPE) within the algorithm with 1/√ε circuits that can be run in parallel each with circuit complexity 1/√ ε instead of 1/ε. Furthermore, we analyze necessary conditions for the overall algorithm to achieve an exponential speedup compared to classical methods. Our approach is not limited to the considered setting and can be applied to more general problems where Hamiltonian simulation is approximated via product formulae, although our theoretical results would need to be extended accordingly. All the procedures presented are implemented with Qiskit and tested for small systems using classical simulation as well as using real quantum devices available through the IBM Quantum Experience.

Journal

ACM Transactions on Quantum Computing – Association for Computing Machinery

Published: Jan 14, 2022

Keywords: Quantum

There are no references for this article.