An extended row and column method for solving linear systems on a quantum computer
From MaRDI portal
Publication:2239636
Cites work
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 6131346 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems
- A randomized Kaczmarz algorithm with exponential convergence
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- On Motzkin's method for inconsistent linear systems
- Parallel iterative methods for sparse linear systems
- Projected randomized Kaczmarz methods
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum random access memory
- Randomized methods for linear constraints: convergence rates and conditioning
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
Cited in
(2)
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)