Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning

DOI10.4230/LIPICS.ICALP.2019.27MaRDI QIDQ5091176zbMATH OpenFDO

Authors Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, Xiaodi Wu

Publication date 21 July 2022

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

zbMATH Keywords

convex optimizationquantum algorithmssemidefinite program

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Improvements in quantum SDP-solving with applications
• Sparse Approximate Solutions to Semidefinite Programs
• A quantum interior-point predictor–corrector algorithm for linear programming
• Fast quantum subroutines for the simplex method
• Fast quantum subroutines for the simplex method

Cites work

• A quantum-inspired classical algorithm for recommendation systems
• Efficient quantum tomography
• Fast amplification of QMA
• scientific article; zbMATH DE number 5485455 (Why is no real title available?)
• Information Theory and Statistical Mechanics
• Logarithmic Regret Algorithms for Online Convex Optimization
• Lower bounds on the size of semidefinite programming relaxations
• Online learning of quantum states
• QIP = PSPACE
• Sample-optimal tomography of quantum states
• Sequential measurements, disturbance and property testing
• Shadow tomography of quantum states
• The learnability of quantum states
• The multiplicative weights update method: a meta-algorithm and applications

Cited in

(15)

• Quantum algorithm design: techniques and applications
• Variational learning the SDC quantum protocol with gradient-based optimization
• Quantum science and quantum technology
• scientific article; zbMATH DE number 7559394 (Why is no real title available?)
• Improvements in quantum SDP-solving with applications
• Decay of quantum conditional mutual information for purely generated finitely correlated states
• Fast quantum subroutines for the simplex method
• Quantum speedups for linear programming via interior point methods
• Quantum lower bounds by sample-to-query lifting
• Quantum Langevin dynamics for optimization
• No quantum speedup over gradient descent for non-smooth convex optimization
• Quantum algorithms for matrix scaling and matrix balancing
• Time-efficient quantum entropy estimator via samplizer
• Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
• Quantum approximate k-minimum finding

This page was built for publication: Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning

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