A Direct Product Theorem for One-Way Quantum Communication
share
We prove a direct product theorem for the one-way entanglement-assisted quantum communication complexity of a general relation f⊆𝒳×𝒴×𝒵. For any ε, ζ > 0 and any k≥1, we show that Q^1_1-(1-ε)^Ω(ζ^6k/log|𝒵|)(f^k) = Ω(k(ζ^5·Q^1_ε + 12ζ(f) - loglog(1/ζ))), where Q^1_ε(f) represents the one-way entanglement-assisted quantum communication complexity of f with worst-case error ε 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é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, 𝒳×𝒴, 𝒜×ℬ, 𝖵) where q is a distribution on 𝒳×𝒴 anchored on any one side with anchoring probability ζ, then ω^*(G^k) = (1 - (1-ω^*(G))^5)^Ω(ζ^2 k/log(|𝒜|·|ℬ|)) where ω^*(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.
READ FULL TEXT