Communication complexity of entanglement assisted multi-party computation
CoRR(2023)
摘要
We consider a quantum and classical version multi-party function computation
problem with n players, where players 2, …, n need to communicate
appropriate information to player 1, so that a "generalized" inner product
function with an appropriate promise can be calculated. The communication
complexity of a protocol is the total number of bits that need to be
communicated. When n is prime and for our chosen function, we exhibit a
quantum protocol (with complexity (n-1) log n bits) and a classical protocol
(with complexity (n-1)^2 (log n^2) bits). In the quantum protocol, the
players have access to entangled qudits but the communication is still
classical. Furthermore, we present an integer linear programming formulation
for determining a lower bound on the classical communication complexity. This
demonstrates that our quantum protocol is strictly better than classical
protocols.
更多查看译文
关键词
entanglement,computation,communication,multi-party
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要