Quantum Linear System Solvers: A Survey of Algorithms and Applications
Mauro E. S. Morales, Lirandë Pira, Philipp Schleich, Kelvin Koor, Pedro C. S. Costa, Dong An, Alán Aspuru-Guzik, Lin Lin, Patrick Rebentrost, Dominic W. Berry
Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve these systems motivates investigating the feasibility of solving linear systems problems using quantum computers. In this work, we provide a survey of the main advances in quantum linear systems algorithms, together with some applications. We summarize and analyze the main ideas behind some of the algorithms for the quantum linear systems problem in the literature. The analysis begins by examining the Harrow-Hassidim-Lloyd (HHL) solver. We note its limitations and reliance on computationally expensive quantum methods, then highlight subsequent research efforts which aimed to address these limitations and optimize runtime efficiency and precision via various paradigms. We focus in particular on the post-HHL enhancements which have paved the way towards optimal lower bounds with respect to error tolerance and condition number. By doing so, we propose a taxonomy that categorizes these studies. Furthermore, by contextualizing these developments within the broader landscape of quantum computing, we explore the foundational work that have inspired and informed their development, as well as subsequent refinements. Finally, we discuss the potential applications of these algorithms in differential equations, quantum machine learning, and many-body physics.
The discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver
Macquarie University(麦考瑞大学);ARC Centre of Excellence in Engineered Quantum System, Macquarie University(麦考瑞大学工程量子系统卓越中心);Google Quantum AI(谷歌量子AI);University of Technology Sydney(悉尼科技大学);Joint Center for Quantum Information and Computer Science, University of Maryland(马里兰大学量子信息与计算机科学联合中心)
Constant Factor Analysis of Optimal Quantum Linear Solvers in Practice
ContinoQuantum;School of Mathematical and Physical Sciences, Macquarie University(麦考瑞大学数学与物理科学学院);AWS Center for Quantum Computing(亚马逊云科技量子计算中心);Beijing International Center for Mathematical Research, Peking University(北京大学北京国际数学研究中心)
Do quantum linear solvers offer advantage for networks-based system of linear equations?
Centre for Quantum Engineering, Research and Education, TCG CREST(TCG CREST 量子工程、研究与教育中心);National Institute of Technology Agartala(阿加塔拉国立技术学院);Qilimanjaro Quantum Tech(基利马贾罗量子科技);Universitat Politècnica de Catalunya(加泰罗尼亚理工大学);Deloitte Tohmatsu Financial Advisory LLC(德勤冢田财务咨询有限公司);Academy of Scientific and Innovative Research (AcSIR)(科学与创新研究学院)
Pauli-structured preconditioning for quantum linear system solvers
School of Mathematical Sciences, Peking University(北京大学数学科学学院);Beijing International Center for Mathematical Research, Peking University(北京大学北京国际数学研究中心)