805 research outputs found

### A Direct Product Theorem for One-Way Quantum Communication

We prove a direct product theorem for the one-way entanglement-assisted
quantum communication complexity of a general relation
$f\subseteq\mathcal{X}\times\mathcal{Y}\times\mathcal{Z}$. For any
$\varepsilon, \zeta > 0$ and any $k\geq1$, we show that $\mathrm{Q}^1_{1-(1-\varepsilon)^{\Omega(\zeta^6k/\log|\mathcal{Z}|)}}(f^k) =
\Omega\left(k\left(\zeta^5\cdot\mathrm{Q}^1_{\varepsilon + 12\zeta}(f) -
\log\log(1/\zeta)\right)\right),$ where $\mathrm{Q}^1_{\varepsilon}(f)$
represents the one-way entanglement-assisted quantum communication complexity
of $f$ with worst-case error $\varepsilon$ and $f^k$ denotes $k$ parallel
instances of $f$.
As far as we are aware, this is the first direct product theorem for quantum
communication. Our techniques are inspired by the parallel repetition theorems
for the entangled value of two-player non-local games, under product
distributions due to Jain, Pereszl\'{e}nyi and Yao, and under anchored
distributions due to Bavarian, Vidick and Yuen, as well as message-compression
for quantum protocols due to Jain, Radhakrishnan and Sen.
Our techniques also work for entangled non-local games which have input
distributions anchored on any one side. In particular, we show that for any
game $G = (q, \mathcal{X}\times\mathcal{Y}, \mathcal{A}\times\mathcal{B},
\mathsf{V})$ where $q$ is a distribution on $\mathcal{X}\times\mathcal{Y}$
anchored on any one side with anchoring probability $\zeta$, then $\omega^*(G^k) = \left(1 - (1-\omega^*(G))^5\right)^{\Omega\left(\frac{\zeta^2
k}{\log(|\mathcal{A}|\cdot|\mathcal{B}|)}\right)}$ where $\omega^*(G)$
represents the entangled value of the game $G$. This is a generalization of the
result of Bavarian, Vidick and Yuen, who proved a parallel repetition theorem
for games anchored on both sides, and potentially a simplification of their
proof.Comment: 31 pages, 1 figur

Recommended from our members

### SHORT-TERM PCB (AROCLOR 1254) TOXICITY ON FEW PHOSPHATASES IN MICE BRAIN

The present communication reports the dose and duration dependent toxicity of a PCB, Aroclor 1254, to a few ion dependent ATPases, Acid phosphatase, Alkaline phosphatase and Glucose-6-phosphatase in the whole brain tissue of mice. Two groups of mice were subjected to two sublethal doses (0.1 and 1 mg kgbw-1 day-1) of PCB orally and exposed for 4, 8 or12 days. A separate control group received the corn oil vehicle for the same exposure times. The observed results indicated exposure duration dependent changes in the enzymatic levels in the brain. The results suggest that the alteration in the enzymatic activity was possibly due to imposed oxidative stress generated by Aroclor 1254 on membrane-bound ion-dependent ATPases and other phosphatases in the brain tissue

### Quadratically Tight Relations for Randomized Query Complexity

Let $f:\{0,1\}^n \rightarrow \{0,1\}$ be a Boolean function. The certificate
complexity $C(f)$ is a complexity measure that is quadratically tight for the
zero-error randomized query complexity $R_0(f)$: $C(f) \leq R_0(f) \leq
C(f)^2$. In this paper we study a new complexity measure that we call
expectational certificate complexity $EC(f)$, which is also a quadratically
tight bound on $R_0(f)$: $EC(f) \leq R_0(f) = O(EC(f)^2)$. We prove that $EC(f)
\leq C(f) \leq EC(f)^2$ and show that there is a quadratic separation between
the two, thus $EC(f)$ gives a tighter upper bound for $R_0(f)$. The measure is
also related to the fractional certificate complexity $FC(f)$ as follows:
$FC(f) \leq EC(f) = O(FC(f)^{3/2})$. This also connects to an open question by
Aaronson whether $FC(f)$ is a quadratically tight bound for $R_0(f)$, as
$EC(f)$ is in fact a relaxation of $FC(f)$.
In the second part of the work, we upper bound the distributed query
complexity $D^\mu_\epsilon(f)$ for product distributions $\mu$ by the square of
the query corruption bound ($\mathrm{corr}_\epsilon(f)$) which improves upon a
result of Harsha, Jain and Radhakrishnan [2015]. A similar statement for
communication complexity is open.Comment: 14 page

- …