Quantum relaxed row and column iteration methods based on block-encoding

Abstract

Iteration method is commonly used in solving linear systems of equations. We present quantum algorithms for the relaxed row and column iteration methods by constructing unitary matrices in the iterative processes, which generalize row and column iteration methods to solve linear systems on a quantum computer. Comparing with the conventional row and column iteration methods, the convergence accelerates when appropriate parameters are chosen. Once the quantum states are efficiently prepared, the complexity of our relaxed row and column methods is improved exponentially and is linear with the number of the iteration steps. In addition, phase estimations and Hamiltonian simulations are not required in these algorithms.

arXiv comment14 pages, 1 figure

References in corpus (12)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum algorithm for solving linear systems of equations
• Quantum support vector machine for big data classification
• Quantum random access memory
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Quantum generalisation of feedforward neural networks
• Creating superpositions that correspond to efficiently integrable probability distributions
• A quantum linear system algorithm for dense matrices
• Randomized Row and Column Iterative Methods with a Quantum Computer