User:Diffeomorphicvoodoo/sandbox/QIP (complexity)

In computational complexity theory, the class QIP (which stands for Quantum Interactive Polynomial time) is the set of decision problems that are solvable by a quantum interactive proof system. Quantum interactive proof systems were first introduced by John Watrous in 1999 as a quantum computing analogue of (classical) interactive proof systems. Quantum interactive proof systems are the same as classical interactive proof systems, except that the verifier is a polynomial-time quantum computer which exchanges quantum messages with the prover.

Definition
We say that a language L belongs to QIP if there is a quantum interactive proof system such that
 * 1) (Completeness) if x ∈ L, the prover has a strategy to convince the verifier with probability ≥ ⅔.
 * 2) (Soundness) if x ∉ L, irrespective of what the prover does, the verifier would not accept with probability ≥ ⅓.

The constants ⅔ and ⅓ in the definition of QIP are arbitrary, as the errors in the proof system can be reduced by parallel repetition.



As an example, consider the problem of distinguishing quantum circuits. Suppose that the verifier is given the description of two quantum circuits C1 and C2 with the guarantee that they are either close or quite far in the metric induced by the completely bounded trace norm. That is, either $$\| C_1 - C_2 \|_{cb} \ge 2/3 $$ or $$\| C_1 - C_2 \|_{cb} < 1/3 $$ and the verifier wants to check which is the case.

Given one of two quantum states $$ \rho_1 $$ or $$ \rho_1 $$ (with probability half each), the maximum probability of guessing correctly amongst them is given by $$ \frac{1}{2} + \frac{1}{2} \| \rho_1 - \rho_2 \| $$.

If $$\| C_1 - C_2 \|_{cb} \ge 2/3 $$, the prover can prepare a state $$ \rho $$ such that $$\| (C_1 \otimes I)(\rho) - (C_2 \otimes I)(\rho)\| \ge 2/3$$, so that it can distinguish between the two cases with probability 5/6. On the other hand, if $$\| C_1 - C_2 \|_{cb} < 1/3 $$, no matter what state $$ \rho $$ the prover prepares, $$\| (C_1 \otimes I)(\rho) - (C_2 \otimes I)(\rho)\|  < 1/3$$. Therefore, the prover can not make the verifier accept with probability more than 2/3.

QIP = QIP(3)
The proof proceeds in two steps,  QIP protocols with two-sided error to QIP protocols with perfect completeness:
 * QIP(m,c,s) &sube; QIP(m+2,1,(c-s)2)

  Parallelization of QIP protocols with perfect completeness:
 * QIP(m,1,1-&xi;) &sube; QIP(3,1,1-&xi;2/4m2)

 

Parallel approximation of QIP(3) protocol
Suppose we have a 3-round QIP protocol for a language L with completeness 15/16 and soundness 1/16.

Fixing the strategy of the verifier, the maximum probability of acceptance that the prover may achieve is $$\max_{\omega, \tau} F(\Phi_1 (\tau), \Phi_2(\omega))$$.

Therefore, if $$ x \in L $$, then $$ \max_{\omega, \tau} F(\Phi_1 (\tau), \Phi_2(\omega)) \ge {15} /{16}$$ and if $$ x \notin L $$, then $$\max_{\omega, \tau} F(\Phi_1 (\tau), \Phi_2(\omega)) \le {1} /{16}$$.

Using Fuchs-van de Graaf inequalities, if $$x \in L $$, $$\min_{\omega, \tau} \|\Phi_1(\tau) - \Phi_2(\omega) \| \le 2 \sqrt{1 - 15/16} = 1/ 2$$ and if $$ x \in L $$, then $$ \min_{\omega, \tau} \|\Phi_1(\tau) - \Phi_2(\omega) \| \ge 2 (1-1/4) = 3/2$$.

We now show that it is possible to approximate $$\min_{\omega, \tau} \|\Phi_1(\tau) - \Phi_2(\omega) \| $$ to an accuracy of $$\delta = 1/2$$ in polynomial space. Define $$\Psi \in T(\mathcal M \otimes \mathcal K, \mathcal V)$$ as $$ \Psi (\theta) = \Phi_1(\text{Tr}_{\mathcal M}\,\theta) - \Phi_2(\text{Tr}_{\mathcal K}\,\theta)$$. Then, $$\min_{\omega, \tau} \|\Phi_1(\tau) - \Phi_2(\omega) \| = \min_{\theta} \| \Psi(\theta)\| = \min_{\theta}  \max_{ 0 \le \Pi \le \mathbb I }  \langle \Pi, \Psi(\theta) \rangle =  \min_{\theta}  \max_{ 0 \le \Pi \le \mathbb I }  \langle \Psi^\ast(\Pi) , \theta \rangle.$$

We describe a Matrix multiplicative weights update algorithm for approximating $$ P(\Psi) = \min_{\theta} \max_{ 0 \le \Pi \le \mathbb I }  \langle \Psi^\ast(\Pi), \theta \rangle. $$ We look at $$\theta$$ as a mixture of experts. Since $$ \Psi $$ is a difference of two-quantum channels, $$ - \mathbb I \le \Psi^\ast(\Pi) \le \mathbb I $$. We take the loss matrix for round t to be $$M(t) = (\mathbb I+ \Psi^\ast(\Pi(t)))/2$$ where $$ \Pi(t)$$ is the projector onto the positive eigenspace of $$\Psi(\rho(t))$$.

Algorithm
Let &epsilon; &larr; &delta;/8 and T &larr; ceil[ln N/&epsilon;2] Let &lambda; &larr; 0 for i = 1 to n W(1) &larr; I  &Phi;(1) &larr; Tr(W(1)) = n.  for t = 1 to T   &rho;(t) = W(t)/&Phi;(t) Follow expert's advice according to &rho;(t) Observe the loss matrix for day t, M(t) &lambda; &larr; &lambda; +〈&rho;(t),M(t)〉 W(t+1) &larr; exp(-&epsilon; Sum[M(i), {i,1,t}]) &Phi;(t+1) = Tr(W(t+1)) Return 2&lambda;/T-1

For any $$ \varepsilon \le 1/2 $$ and for any $$ v \in \mathbb{C}^n $$, $$(1-\varepsilon)\lambda \le \sum_{t=1}^T v^\ast M(t) v  + \frac{\ln n}{\varepsilon}$$.

For $$ \varepsilon \in [0, 1/2],$$ $$1/(1-\varepsilon) \le 1+2\varepsilon$$. Therefore, $$\lambda /T\le \frac 1 T \sum_{t=1}^T v^\ast M(t) v + 2 \varepsilon + \frac{\ln n}{\varepsilon(1-\varepsilon)T} \le \sum_{t=1}^T v^\ast M(t) v  + \delta/2$$.

Let $$ (\hat \rho, \hat \Pi) $$ attain the min-max value $$ P(\Psi) = \langle \Psi(\hat \rho), \hat \Pi \rangle $$. Then, for any t, $$\langle \hat \rho, M(t) \rangle = (1+ \langle \hat \rho, \Psi^\ast(\Pi(t)) \rangle)/2 = (1+ \langle \Psi(\hat \rho), \Pi(t) \rangle)/2 \le (1+ P(\Psi))/2.$$ Therefore, $$\lambda /T\le \frac 1 T \sum_{t=1}^T \langle \hat \rho + \delta/2 \le (1+ P(\Psi) + \delta)/2$$.

On the other hand, $$\lambda / T = \frac 1 T \sum_{t=1}^T \langle \rho(t), M(t)\rangle = \Big(1+\frac 1 T \sum_{t=1}^T \langle \rho(t), \Psi^\ast(\Pi(t))\rangle\Big)/2 = \Big(1+\frac 1 T \sum_{t=1}^T \langle \Psi(\rho(t)), \Pi(t)\rangle\Big)/2 \ge (1+P(\Psi))/2$$.

Therefore, (2&lambda;/T-1) is a &delta-approximation of $$P(\Psi)$$.

QMIP
Quantum Multi-prover Interactive Proofs are motivated by the study of Multi-prover Interactive Proofs. The verifier is a polynomial-time quantum computer which exchanges quantum messages with the prover. As in MIP, the provers are not allowed to communicate after the protocol starts, but they may be entangled. In 2012, Reichardt, Unger and Vazirani established that QMIP=MIP*, showing that all the power of Quantum Multi-prover Interactive Proof systems comes from the ability of the provers to share entanglement.

MIP*
In MIP* protocols, the verifier, and the messages between the prover and the verifier are completely classical. However, as in QMIP, the provers may share an arbitrary amount of entanglement. Since the provers may use the additional resource of entanglement to both convince or to fool the verifier, it is not a priori obvious how MIP* relates to MIP. However, in 2012, Ito and Vidick showed a multi-prover protocol for NEXP sound against entangled provers, showing that NEXP=MIP⊆MIP*. There is no known upper bound to MIP*. (It is not even known whether or not MIP* protocols can solve undecidable problems.)