Equilibrium Value Method for the Proof of QIP=PSPACE
نویسنده
چکیده
Weprovide an alternative proof of QIP=PSPACE to the recent breakthrough result [JJUW09]. Unlike solving some semidefinite programs that captures the computational power of quantum interactive proofs, our method starts with one QIP-Complete problem which computes the diamond norm between two admissible quantum channels. The key observation is that we can convert the computation of the diamond norm into the computation of some equilibrium value. The later problem, different from semidefinite programs, is of better form, easier to solve and could be interesting for its own sake. The multiplicative weight update method is also applied to solve the equilibrium value problem, however, in a relatively simpler way than the one in the original proof [JJUW09]. Furthermore, we provide a generalized form of equilibrium value problems which can be solved in the same way as well as comparisons to semidefinite programs.
منابع مشابه
On Applications of the Equilibrium Value Method
In 2010, Jain et al. [JJUW10] provided the first proof that QIP=PSPACE. Jain et al. used a constructive argument which applied the matrix multiplicative weight update method to a semidefinite programming problem formulation of a QMAM protocol to achieve this proof. The proof that QIP= PSPACE was alternately characterized by Xiaodi Wu [Wu10] that same year; Xiaodi Wu’s method, however, was simpl...
متن کاملar X iv : 0 90 7 . 47 37 v 2 [ qu an t - ph ] 3 A ug 2 00 9 QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a parallelized form of the matrix multiplicative weights update method to a class of semidefinite programs that captures the computational power of quantum interactive proofs. As the containment of PSPACE in QIP follows i...
متن کاملParallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
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 [Kal07]. 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 de...
متن کاملQMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols
This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show that there is no way to pack an exponential number of bits into a polynomial-size quantum state, in such a way that the value of any one of those bits can later be proven with the help of a polynomial-size quantum witness. We also show that any problem in QMA with polyno...
متن کاملComputational Distinguishability of Quantum Channels
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be surprisingly hard: it is complete for the class QIP of problems that have quantum interactive proof systems, which implies that it is hard for the class PSPACE of probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1004.0264 شماره
صفحات -
تاریخ انتشار 2010