我们设计了一个实现纠缠辅助下计算特定布尔函数的三方通信复杂度问题的量子线路,该问题中输入变量分布在通信三方。计算分析表明如果通信三方没有分享纠缠态,需要四比特经典通信才能完成计算任务。有纠缠辅助下,仅通过三比特经典通信能够以一定概率完成任务,成功概率与纠缠态的具体形式有关,当选择合适的纠缠态时,成功概率最高可达100％。

We proposed a quantum circuit of realizing three-party communication complexity scenario for a certain Boolean function, of which the input data were distributed to three parties. Without pre-shared entanglement, four bits were needed to accomplish the communication task. We have proved that the pre-shared entanglement can reduce communication complexity to three bits with probability of success which depends on the characterization of entanglement and can reach 1 maximally.