Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pages. Comments are welcome

Scientific paper

In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis \cite{Kale07}. One of the main advantages of the new framework is that we can guarantee the convertibility from approximate to exact feasibility in a much more general class of SDPs than previous result. Another advantage is the design of the oracle which is necessary for applying the multiplicative weight update method is much simplified in general cases. This leads to an alternative and easier solutions to the SDPs used in the previous results \class{QIP(2)}$\subseteq$\class{PSPACE} \cite{JainUW09} and \class{QMAM}=\class{PSPACE} \cite{JainJUW09}. Furthermore, we provide a generic form of SDPs which can be solved in the similar way. By parallelizing every step in our solution, we are able to solve a class of SDPs in \class{NC}. Although our motivation is from quantum computing, our result will also apply directly to any SDP which satisfies our conditions. In addition to the new framework for solving SDPs, we also provide a novel framework which improves the range of equilibrium value problems that can be solved via the multiplicative weight update method. Before this work we are only able to calculate the equilibrium value where one of the two convex sets needs to be the set of density operators. Our work demonstrates that in the case when one set is the set of density operators with further linear constraints, we are still able to approximate the equilibrium value to high precision via the multiplicative weight update method.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-326425

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.