Solving Sparse SDPs in Sublinear Time via Quantum-Inspired Classical Algorithms
Authors present the first sublinear-time classical solvers for sparse semidefinite programs without requiring low-rank assumptions.
Authors present the first sublinear-time classical solvers for sparse semidefinite programs without requiring low-rank assumptions.