scientific article; zbMATH DE number 7559394

DOI10.4230/LIPICS.MFCS.2020.23MaRDI QIDQ5089186zbMATH OpenFDO

Authors Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, Chun-Hao Wang

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/1901.03254

zbMATH Keywords

quantum-inspired algorithmsemi-definite programmingspectral decompositionsublinear algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A parallel approximation algorithm for positive linear programming
• A Parallel Approximation Algorithm for Positive Semidefinite Programming
• A quantum-inspired classical algorithm for recommendation systems
• An improved cutting plane method for convex optimization, convex-concave games, and its applications
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Fast monte-carlo algorithms for finding low-rank approximations
• scientific article; zbMATH DE number 5485455 (Why is no real title available?)
• scientific article; zbMATH DE number 3672004 (Why is no real title available?)
• Improvements in quantum SDP-solving with applications
• Logarithmic Regret Algorithms for Online Convex Optimization
• Polynomial Interior Point Cutting Plane Methods
• Quantum recommendation systems
• Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning
• Randomized algorithms in numerical linear algebra
• Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
• Semidefinite Programming
• Shadow tomography of quantum states
• Solving linear programs in the current matrix multiplication time
• Sublinear time algorithms for approximate semidefinite programming
• The ellipsoid method and its consequences in combinatorial optimization
• The multiplicative weights update method: a meta-algorithm and applications
• The volumetric barrier for semidefinite programming.
• Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver

Cited in

(6)

• A subgradient approach for constrained binary optimization via quantum adiabatic evolution
• Fast quantum subroutines for the simplex method
• scientific article; zbMATH DE number 7765405 (Why is no real title available?)
• Quantum-inspired sublinear algorithm for solving low-rank semidefinite programming
• Robust dequantization of the quantum singular value transformation and quantum machine learning algorithms
• Nearly optimal circuit size for sparse quantum state preparation

This page was built for publication:

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