A Parallel Approximation Algorithm for Positive Semidefinite Programming

Positive semi definite programs are an important subclass of semi definite programs in which all matrices involved in the specification of the problem are positive semi definite and all scalars involved are non-negative. We present a parallel algorithm, which given an instance of a positive semi definite program of size N and an approximation factor e &gt, 0, runs in (parallel) time poly(1/e) polylog(N), using poly(N) processors, and outputs a value which is within multiplicative factor of (1+ e) to the optimal. Our result generalizes analogous result of Luby and Nisan (1993) for positive linear programs and our algorithm is inspired by their algorithm of [10].

[1]  Andrew M. Childs,et al.  ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N1/2+o(1) ON A QUANTUM COMPUTER , 2010 .

[2]  Andrew M. Childs,et al.  ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N ON A QUANTUM COMPUTER∗ , 2010 .

[3]  M. Szegedy,et al.  Quantum Walk Based Search Algorithms , 2008, TAMC.

[4]  Satyen Kale.  Efficient algorithms using the multiplicative weights update method , 2007 .

[5]  Rahul Jain,et al.  Two-Message Quantum Interactive Proofs Are in PSPACE , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[7]  Noam Nisan,et al.  A parallel approximation algorithm for positive linear programming , 1993, STOC.

[8]  Yong Zhang,et al.  Fast amplification of QMA , 2009, Quantum Inf. Comput..

[9]  C. Jordan.  Essai sur la géométrie à $n$ dimensions , 1875 .

[10]  Sanjeev Arora,et al.  Fast algorithms for approximate semidefinite programming using the multiplicative weights update method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[11]  Rahul Jain,et al.  Parallel Approximation of Non-interactive Zero-sum Quantum Games , 2008, 2009 24th Annual IEEE Conference on Computational Complexity.

[12]  Andris Ambainis,et al.  Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[13]  Sanjeev Arora,et al.  A combinatorial, primal-dual approach to semidefinite programs , 2007, STOC '07.

[14]  Chris Marriott,et al.  Quantum Arthur–Merlin games , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..