On Quantum Solvers for Linear Algebraic Systems
Quantum Information & Computation · 01.12.2025 · 25 (6) · 640-667
DOI: 10.2478/qic-2025-0035 ↗Kurz gefasst
Fachartikel in der Zeitschrift Quantum Information & Computation, online erschienen am 09.03.2026. Verfasst von Papagiannis Nikos und 1 weiteren Autor:innen. Die Arbeit nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
Solving large-scale linear systems is an integral part of many scientific disciplines. Classical linear solvers have a polynomial time complexity and it seems impossible to further improve their performance. This fact has directed scientific research to the study of corresponding quantum algorithms, which promise even exponential acceleration compared to existing methods. In this paper, we present and analyze some of the most important related results. In particular, we present the HHL and WZP algorithms based on the eigen-decomposition of a matrix, the row and column iteration methods, as well as two hybrid algorithms that require the cooperation of a classical and a quantum computer, namely an algorithm that uses random walks and the VQLS algorithm. The latter is also examined from an experimental standpoint using the Qiskit open-source framework and a suitable quantum circuit is proposed which can enhance its performance.
Zitieren
APA
Nikos, P., & Manolis, V. (2025). On Quantum Solvers for Linear Algebraic Systems. Quantum Information & Computation, 25(6), 640-667. https://doi.org/10.2478/qic-2025-0035
Vancouver
Nikos P, Manolis V. On Quantum Solvers for Linear Algebraic Systems. Quantum Information & Computation. 2025;25(6):640-667. doi:10.2478/qic-2025-0035
BibTeX
@article{Nikos2025,
author = {Nikos, Papagiannis and Manolis, Vavalis},
title = {On Quantum Solvers for Linear Algebraic Systems},
journal = {Quantum Information & Computation},
year = {2025},
volume = {25},
number = {6},
pages = {640--667},
doi = {10.2478/qic-2025-0035}
}
EUVIMED