An extended row and column method for solving linear systems on a quantum computer

DOI10.1007/s10773-020-04685-wOpenAlexW3132420830MaRDI QIDQ2239636

Changpeng Shao, Qian Zuo, Hua Xiang, Nianci Wu

Publication date: 5 November 2021

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-020-04685-w

zbMATH Keywords

quantum algorithmsrandomized algorithmsblock-encodingrow and column iteration

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Basic linear algebra (15Axx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Related Items (2)

Convergence analyses based on frequency decomposition for the randomized row iterative method ⋮ Quantum relaxed row and column iteration methods based on block-encoding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A randomized Kaczmarz algorithm with exponential convergence
• On Motzkin's method for inconsistent linear systems
• Projected randomized Kaczmarz methods
• A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems
• Quantum Random Access Memory
• Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
• Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
• Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
• Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms

This page was built for publication: An extended row and column method for solving linear systems on a quantum computer