Quantum algorithms and lower bounds for convex optimizationDownload PDFOpen Website

2020 (modified: 20 Dec 2022)Quantum 2020Readers: Everyone
Abstract: Shouvanik Chakrabarti, Andrew M. Childs, Tongyang Li, and Xiaodi Wu, Quantum 4, 221 (2020). While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We pre…
0 Replies

Loading