Quantum speed-ups for solving semidefinite programs

DOI10.1109/FOCS.2017.45MaRDI QIDQ6946343zbMATH OpenFDO

Authors Krysta M. Svore, Fernando G. S. L. Brandão

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.45

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(8)

• Quantum speedups for linear programming via interior point methods
• Quantum lower bounds by sample-to-query lifting
• Quantum optimization of coherent chaotic systems: a case for buses of Kathmandu
• Quantum Langevin dynamics for optimization
• From decay of correlations to locality and stability of the Gibbs state
• No quantum speedup over gradient descent for non-smooth convex optimization
• Quantum algorithms for matrix scaling and matrix balancing
• Mixing time of quantum Gibbs sampling for random sparse Hamiltonians

This page was built for publication: Quantum speed-ups for solving semidefinite programs

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