论文标题
基于量子步行的协议，用于在网络上任何两个直接连接的节点之间进行安全通信
Quantum walk-based protocol for secure communication between any two directly connected nodes on a network
论文作者
论文摘要
量子纠缠作为加密资源的利用已取代了确保通信的常规方法。量子设备之间的Intranetwork通信的安全性和保真度是量子网络的骨干。这项工作提出了一种算法，该算法在量子网络的任意两个直接连接的节点之间生成纠缠，以用作资源，以启用网络中该对的量子通信。该算法基于定向离散的量子步行，为网络中的私人节点量子通信通道铺平了道路。我们还介绍了该算法在各种模型生成的随机网络上的仿真结果。我们表明，实施后，沃克在源和目标以外的所有节点的可能性都可以忽略不计，这独立于随机图生成模型。这构成了一种可行的方法，用于实现在任何随机网络拓扑上的安全通信。
The utilization of quantum entanglement as a cryptographic resource has superseded conventional approaches to secure communication. Security and fidelity of intranetwork communication between quantum devices is the backbone of a quantum network. This work presents an algorithm that generates entanglement between any two directly connected nodes of a quantum network to be used as a resource to enable quantum communication across that pair in the network. The algorithm is based on a directed discrete-time quantum walk and paves the way for private inter-node quantum communication channels in the network. We also present the simulation results of this algorithm on random networks generated from various models. We show that after implementation, the probability of the walker being at all nodes other than the source and target is negligible, and this holds independent of the random graph generation model. This constitutes a viable method for the practical realisation of secure communication over any random network topology.
