Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Efficient Quantum Algorithm for Linear System Problem in Tensor Format (2403.19829v1)

Published 28 Mar 2024 in quant-ph, cs.NA, and math.NA

Abstract: Solving linear systems is at the foundation of many algorithms. Recently, quantum linear system algorithms (QLSAs) have attracted great attention since they converge to a solution exponentially faster than classical algorithms in terms of the problem dimension. However, low-complexity circuit implementations of the oracles assumed in these QLSAs constitute the major bottleneck for practical quantum speed-up in solving linear systems. In this work, we focus on the application of QLSAs for linear systems that are expressed as a low rank tensor sums, which arise in solving discretized PDEs. Previous works uses modified Krylov subspace methods to solve such linear systems with a per-iteration complexity being polylogarithmic of the dimension but with no guarantees on the total convergence cost. We propose a quantum algorithm based on the recent advances on adiabatic-inspired QLSA and perform a detailed analysis of the circuit depth of its implementation. We rigorously show that the total complexity of our implementation is polylogarithmic in the dimension, which is comparable to the per-iteration complexity of the classical heuristic methods.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. Quantum optimization: Potential, challenges, and the path forward. arXiv preprint arXiv:2312.02279, 2023.
  2. D. An and L. Lin. Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm. ACM Transactions on Quantum Computing, 3(2):1–28, 2022.
  3. S. Apers and S. Gribling. Quantum speedups for linear programming via interior point methods. arXiv preprint arXiv:2311.03215, 2023.
  4. Quantum interior point methods for semidefinite optimization. Quantum, 7:1110, 2023.
  5. J. Ballani and L. Grasedyck. A projection method to solve linear systems in tensor format. Numerical Linear Algebra with Applications, 20(1):27–43, 2013.
  6. Efficient quantum algorithms for simulating sparse hamiltonians. Communications in Mathematical Physics, 270:359–371, 2007.
  7. Eigenpath traversal by phase randomization. Quantum Info. Comput., 9(9&10):833–855, 2009.
  8. A quantum interior-point predictor–corrector algorithm for linear programming. Journal of Physics A: Mathematical and Theoretical, 53(44):445305, 2020.
  9. The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation. arXiv preprint arXiv:1804.01973, 2018.
  10. A. M. Childs and Y. Su. Nearly optimal lattice simulation by product formulas. Physical review letters, 123(5):050503, 2019.
  11. Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM Journal on Computing, 46(6):1920–1950, 2017.
  12. Theory of Trotter error with commutator scaling. Physical Review X, 11(1):011020, 2021.
  13. Optimal scaling quantum linear-systems solver via discrete adiabatic theorem. PRX Quantum, 3(4):040303, 2022.
  14. Quantum algorithms: A survey of applications and end-to-end complexities. arXiv preprint arXiv:2310.03011, 2023.
  15. D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 439(1907):553–558, 1992.
  16. T. G. Draper. Addition on a quantum computer. arXiv preprint quant-ph/0008033, 2000.
  17. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, 2014.
  18. A literature survey of low-rank tensor approximation techniques. GAMM-Mitteilungen, 36(1):53–78, 2013.
  19. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 212–219, 1996.
  20. Quantum algorithm for linear systems of equations. Physical Review Letters, 103(15):150502, 2009.
  21. The cost of solving linear differential equations on a quantum computer: fast-forwarding to explicit resource counts. arXiv preprint arXiv:2309.07881, 2023a.
  22. Efficient quantum linear solver algorithm with detailed running costs. arXiv preprint arXiv:2305.11352, 2023b.
  23. H. Krovi. Improved quantum algorithms for linear and nonlinear differential equations. Quantum, 7:913, 2023.
  24. Efficient quantum algorithm for dissipative nonlinear differential equations. Proceedings of the National Academy of Sciences, 118(35):e2026805118, 2021.
  25. S. Lloyd. Universal quantum simulators. Science, 273(5278):1073–1078, 1996.
  26. An inexact feasible interior point method for linear optimization with high adaptability to quantum computers. arXiv preprint arXiv:2307.14445, 2023.
  27. Quantum Computation and Quantum Information. Cambridge University Press, 2010.
  28. L. Ruiz-Perez and J. C. Garcia-Escartin. Quantum arithmetic with the quantum Fourier transform. Quantum Information Processing, 16:1–14, 2017.
  29. P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 124–134. IEEE, 1994.
  30. Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing. Physical Review Letters, 122(6):060504, 2019.
  31. An inexact feasible quantum interior point method for linearly constrained quadratic optimization. Entropy, 25(2), 2023.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets