On quantum solvers for linear algebraic systems

DOI10.2478/QIC-2025-0035MaRDI QIDQ7295951zbMATH OpenFDO

Authors Papagiannis Nikos, Vavalis Manolis

Publication date 14 July 2026

Published in Quantum Information \& Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/QIC-2025-0035

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• A new iterative Monte Carlo approach for inverse matrix problem
• A quantum eigensolver for symmetric tridiagonal matrices
• An introduction to quantum computing, without the physics
• Application of quantum Gauss-Jordan elimination code to quantum secret sharing code
• Efficient quantum algorithms of finding the roots of a polynomial function
• Error detecting and error correcting codes
• From Monte Carlo to quantum computation
• Large-Scale Scientific Computing
• Numerical inverting of matrices of high order
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Quantum algorithms revisited
• Quantum computation and quantum information. 10th anniversary edition
• Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
• Quantum random access memory
• Quantum speed-up of Markov chain based algorithms
• Randomized numerical linear algebra: Foundations and algorithms
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• The variational quantum eigensolver: a review of methods and best practices

This page was built for publication: On quantum solvers for linear algebraic systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295951)