Cover Image

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Tyler, Kim, Junhyung Lyle, Ray, Archan, Chakrabarti, Shouvanik, Herman, Dylan, Kumar, Niraj
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
by: Chen, Tyler, et al.
Published: (2025)

On Speedups for Convex Optimization via Quantum Dynamics
by: Chakrabarti, Shouvanik, et al.
Published: (2025)

Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
by: Herman, Dylan, et al.
Published: (2025)

Quantum Speedups for Group Relaxations of Integer Linear Programs
by: Augustino, Brandon, et al.
Published: (2026)

A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values
by: Chen, Tyler, et al.
Published: (2025)

GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches
by: Chen, Tyler, et al.
Published: (2025)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
by: Tsin, Yung H.
Published: (2023)

Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
by: Chakrabarti, Shouvanik, et al.
Published: (2024)

A quantum algorithm for solving 0-1 Knapsack problems
by: Wilkening, Sören, et al.
Published: (2023)

Quantum Speedups for Derivative Pricing Beyond Black-Scholes
by: Herman, Dylan, et al.
Published: (2026)

New simple and fast quicksort algorithm for equal keys
by: Afereidoon, Parviz
Published: (2025)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
by: Gupta, Sushmita, et al.
Published: (2025)

Efficient algorithm for linear diophantine equations in two variables
by: Deora, Mayank, et al.
Published: (2025)

FPT algorithms over linear delta-matroids with applications
by: Eiben, Eduard, et al.
Published: (2025)

Improved linearly ordered colorings of hypergraphs via SDP rounding
by: Louis, Anand, et al.
Published: (2024)

Faster algorithms for k-Orthogonal Vectors in low dimension
by: Dürr, Anita, et al.
Published: (2025)

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
by: Kim, Junhyung Lyle, et al.
Published: (2024)

Finding missing items requires strong forms of randomness
by: Chakrabarti, Amit, et al.
Published: (2023)

An average case efficient algorithm for solving two-variable linear Diophantine equations
by: Deora, Mayank, et al.
Published: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
by: Chen, Tyler
Published: (2024)

A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs
by: Fox, Emily
Published: (2023)

A Novel exact algorithm for economic lot-sizing with piecewise linear production costs
by: Papadopoulos, Kleitos
Published: (2024)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
by: Daga, Mohit
Published: (2025)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
by: Jennings, David, et al.
Published: (2023)

Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
by: Nguyen, Linh Anh
Published: (2024)

Persiansort: an alternative to mergesort inspired by persian rug
by: Afereidoon, Parviz
Published: (2025)

Improved quantum algorithms for linear and nonlinear differential equations
by: Krovi, Hari
Published: (2022)

A quantum central path algorithm for linear optimization
by: Augustino, Brandon, et al.
Published: (2023)

Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
by: Montanaro, Ashley, et al.
Published: (2024)

Node ranking in labeled networks
by: Arachchi, Chamalee Wickrama, et al.
Published: (2025)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
by: Apers, Simon, et al.
Published: (2021)

Fast and simple unrooted dynamic forests
by: Berendsohn, Benjamin Aram
Published: (2023)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
by: Balabanov, Oleg, et al.
Published: (2022)

An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
by: Liu, Gangli
Published: (2024)

A simple $(2+ε)$-approximation for knapsack interdiction
by: Weninger, Noah
Published: (2026)

Dynamic framework for edge-connectivity maintenance of simple graphs
by: Wrobel, Blazej
Published: (2026)

The clustered Sparrow algorithm
by: Dumitrescu, Cristian
Published: (2018)

Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
by: Ciaperoni, Martino, et al.
Published: (2025)

A simple and efficient preprocessing step for convex hull problem
by: Heydari, Mohammad, et al.
Published: (2023)