Quantum Linear System Solvers: A Survey of Algorithms and Applications
- URL: http://arxiv.org/abs/2411.02522v2
- Date: Thu, 07 Nov 2024 22:55:50 GMT
- Title: Quantum Linear System Solvers: A Survey of Algorithms and Applications
- Authors: Mauro E. S. Morales, Lirandë Pira, Philipp Schleich, Kelvin Koor, Pedro C. S. Costa, Dong An, Lin Lin, Patrick Rebentrost, Dominic W. Berry,
- Abstract summary: We summarize and analyze the main ideas behind some of the algorithms for the quantum linear systems problem in the literature.
We focus on the post-HHL enhancements which have paved the way towards optimal lower bounds with respect to error tolerance and condition number.
We discuss the potential applications of these algorithms in differential equations, quantum machine learning, and many-body physics.
- Score: 2.27062345119129
- License:
- Abstract: 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.
Related papers
- Shadow Quantum Linear Solver: A Resource Efficient Quantum Algorithm for Linear Systems of Equations [0.8437187555622164]
We present an original algorithmic procedure to solve the Quantum Linear System Problem (QLSP) on a digital quantum device.
The result is a quantum algorithm avoiding the need for large controlled unitaries, requiring a number of qubits that is logarithmic in the system size.
We apply this to a physical problem of practical relevance, by leveraging decomposition theorems from linear algebra to solve the discretized Laplace Equation in a 2D grid.
arXiv Detail & Related papers (2024-09-13T15:46:32Z) - An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications [7.495181307075487]
We explore using the Harrow-Hassidim-Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing.
Focusing on domains such as power-grid management and heat transfer problems, we demonstrate the correlations of the precision of quantum phase estimation.
We conclude the exponential resource cost from quantum phase estimation before and after quantum error correction and illustrate a potential way to reduce the demands on physical qubits.
arXiv Detail & Related papers (2024-04-29T19:21:38Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Variational Quantum Algorithms for Computational Fluid Dynamics [0.0]
Variational quantum algorithms are particularly promising since they are comparatively noise tolerant.
We show how variational quantum algorithms can be utilized in computational fluid dynamics.
We argue that a quantum advantage over classical computing methods could be achieved by the end of this decade.
arXiv Detail & Related papers (2022-09-11T18:49:22Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - Near Term Algorithms for Linear Systems of Equations [0.0]
This paper makes contributions that include: the first application of the Evolutionary Ansatz to the VQLS (EAVQLS), the first implementation of the Logical Ansatz VQLS (LAVQLS), and the first proof of principle demonstration of the CQS method on real quantum hardware.
arXiv Detail & Related papers (2021-08-25T17:35:52Z) - Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning
Problems: preliminary study on the Traveling Salesman Problem [0.8434687648198277]
We introduce a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm.
Main pillars of operation of the proposed method are a greater control over the access to quantum resources, and a considerable reduction of non-profitable accesses.
arXiv Detail & Related papers (2020-12-09T11:21:50Z) - Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra [53.46106569419296]
We create classical (non-quantum) dynamic data structures supporting queries for recommender systems and least-squares regression.
We argue that the previous quantum-inspired algorithms for these problems are doing leverage or ridge-leverage score sampling in disguise.
arXiv Detail & Related papers (2020-11-09T01:13:07Z) - Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
We review and extend the application of deep learning to quantum geometric control problems.
We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems.
Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
arXiv Detail & Related papers (2020-06-19T19:12:14Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.