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

DOI10.1007/S10773-020-04685-WOpenAlexW3132420830MaRDI QIDQ2239636FDOQ2239636

Authors: Qian Zuo, Changpeng Shao, Nianci Wu, Hua Xiang 

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

randomized algorithmsquantum algorithmsblock-encodingrow and column iteration

Mathematics Subject Classification ID

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

Cites Work

• A randomized Kaczmarz algorithm with exponential convergence
• Title not available (Why is that?)
• Parallel iterative methods for sparse linear systems
• Randomized methods for linear constraints: convergence rates and conditioning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum random access memory
• Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
• Projected randomized Kaczmarz methods
• Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
• On Motzkin's method for inconsistent linear systems
• Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
• A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems

Cited In (2)

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

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

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