Institute of Information Science Academia Sinica
講 題: Quantum-inspired Classical Sublinear-time Algorithm for Solving Low-rank Semidefinite Programming via Sampling Approaches
講 者: 林瀚仚 博士 (The University of Texas at Austin Department of Computer Science (UTCS))
時 間: 2019-08-23 (Fri) 10:00 – 12:00
地 點: 資訊所新館106演講廳
邀請人: 鐘楷閔

Semidefinite programming (SDP) is a central topic in mathematical optimization with extensive studies on its efficient solvers. Recently, quantum algorithms with superpolynomial speedups for solving SDPs have been proposed assuming access to its constraint matrices in quantum superposition. Mutually inspired by both classical and quantum SDP solvers, in this paper we present a sublinear classical algorithm for solving low-rank SDPs which is asymptotically as good as existing quantum algorithms. Specifically, given an SDP with mconstraint matrices, each of dimension n and rank poly(logn), our algorithm gives a succinct description and any entry of the solution matrix in time O(m⋅poly(logn,1/ε)) given access to a sample-based low-overhead data structure of the constraint matrices, where ε is the precision of the solution. In addition, we apply our algorithm to a quantum state learning task as an application. 

Technically, our approach aligns with both the SDP solvers based on the matrix multiplicative weight (MMW) framework and the recent studies of quantum-inspired machine learning algorithms. The cost of solving SDPs by MMW mainly comes from the exponentiation of Hermitian matrices, and we propose two new technical ingredients (compared to previous sample-based algorithms) for this task that may be of independent interest: 
∙ Weighted sampling: assuming sampling access to each individual constraint matrix A1,…,Aτ, we propose a procedure that gives a good approximation of A=A1 ⋯ Aτ. 
∙ Symmetric approximation: we propose a sampling procedure that gives low-rank spectral decomposition of a Hermitian matrix A. This improves upon previous sampling procedures that only give low-rank singular value decompositions, losing the signs of eigenvalues.  



Han-Hsuan Lin received his Ph.D. from MIT in 2015 under the supervision of Edward Farhi. His research interests include quantum algorithms and quantum query complexity.