量子网络上的组播量子网络编码作为最优对称通用克隆
Multicast quantum network coding as optimal symmetric universal cloning over a quantum network
AI总结：
该研究扩展Kobayashi等人的量子网络编码协议，建立单源量子网络完美组播对称通用克隆的充分条件，为量子网络的完美组播提供了理论支撑。
AI中文摘要：
我们研究在可自由使用经典通信的量子网络上，对未知量子态进行完美组播对称通用克隆的问题。我们通过扩展Kobayashi等人提出的量子网络编码协议，构建了一个可从多个源节点组播输入态对称通用克隆的协议。我们进一步建立了单源设置下完美组播的充分条件：当源节点处存在单个$q^r$维输入态副本（其中$q$为足够大的素数幂）时，利用目标节点间共享的少量纠缠，可实现对应对称通用克隆的完美组播。该结果适用于以无向图$G$表示的量子网络，其中每条边对应一条无噪声$q$维量子信道，且满足对$G$的边定向得到的无环有向图$G'$的最小割至少为$r$。
英文摘要：
We study the problem of perfectly multicasting symmetric universal clones of unknown quantum states over quantum networks with free classical communication. We construct a protocol that multicasts symmetric universal clones of input states from multiple source nodes by extending the quantum network coding protocol proposed by Kobayashi et al. We further establish a sufficient condition for perfect multicast in the single-source setting. Specifically, we show that when a single copy of a $q^r$-dimensional input state is available at the source node, where $q$ is a sufficiently large prime power, perfect multicast of the corresponding symmetric universal clone is achievable using a small amount of entanglement shared among the target nodes. This result holds for quantum networks represented by an undirected graph $G$, where each edge corresponds to a noiseless $q$-dimensional quantum channel, provided that there exists an acyclic directed graph $G'$ obtained by assigning directions to the edges of $G$ such that the minimum cut of $G'$ is at least $r$.
