Robust quantum network architectures and topologies for entanglement distribution
Siddhartha Das, Sumeet Khatri, Jonathan P. Dowling
备注：
14 pages, 10 figures. v2: Slightly modified the abstract; some minor typos corrected and minor clarifying notes added throughout; three new figures added (Fig. 5, 6, 9); expanded the discussion in Section III to improve clarity; updated the Acknowledgements. v3: Minor changes to match the published version
发表信息：
Physical Review A, Vol. 97, Issue 1, page 012335, January 2018
Entanglement distribution is a prerequisite for several important quantum information processing and computing tasks, such as quantum teleportation, quantum key distribution, and distributed quantum computing. In this work, we focus on two-dimensional quantum networks based on optical quantum technologies using dual-rail photonic qubits for the building of a fail-safe quantum internet. We lay out a quantum network architecture for entanglement distribution between distant parties using a Bravais lattice topology, with the technological constraint that quantum repeaters equipped with quantum memories are not easily accessible. We provide a robust protocol for simultaneous entanglement distribution between two distant groups of parties on this network. We also discuss a memory-based quantum network architecture that can be implemented on networks with an arbitrary topology. We examine networks with bow-tie lattice and Archimedean lattice topologies and use percolation theory to quantify the robustness of the networks. In particular, we provide figures of merit on the loss parameter of the optical medium that depend only on the topology of the network and quantify the robustness of the network against intermittent photon loss and intermittent failure of nodes. These figures of merit can be used to compare the robustness of different network topologies in order to determine the best topology in a given real-world scenario, which is critical in the realization of the quantum internet.
Emergent Problem-Graph Alignment in RL-Discovered Entanglement Topologies for QAOA
Institute for Computer Science, LMU Munich（慕尼黑大学计算机科学研究所）；relAI – Konrad Zuse School of Excellence in Reliable AI, LMU Munich（relAI – 康拉德·楚泽可靠人工智能卓越学院，慕尼黑大学）；Department of Computer Science, University of Exeter（埃克塞特大学计算机系）
Modular Architectures and Entanglement Schemes for Error-Corrected Distributed Quantum Computation
Delft University of Technology（代尔夫特理工大学）；Okinawa Institute of Science and Technology Graduate University（冲绳科学技术大学院大学）；CWI（荷兰数学与计算机科学中心）；CSIRO（澳大利亚联邦科学与工业研究组织）；Harvard University（哈佛大学）
A scalable entanglement distribution framework for hybrid quantum networks
Xi’an University of Technology（西安工业大学）；Taiyuan University of Technology（太原理工大学）；Rensselaer Polytechnic Institute（伦斯勒理工学院）；Okinawa Institute of Science and Technology Graduate University（冲绳科学技术大学院大学）；Northwestern University（西北大学）；the University of Chicago（芝加哥大学）
Implementing Grover Algorithm on Quantum Chip Architecture Optimized with QGHNN for Fidelity and Entanglement Preservation
Ankara Yildirim Beyazit University（安卡拉耶尔德勒姆·拜亚济特大学）；Iranian Quantum Technologies Research Center (IQTEC)（伊朗量子技术中心）；K. N. Toosi University of Technology（K.N.托伊西理工大学）
Entanglement bounds on the performance of quantum computing architectures
有许多可能的量子比特连接架构，未来量子计算机的设计者需要在其中做出选择。然而，评估特定连接图作为量子架构的性能的过程可能是困难的。在本文中，我们证明了一个被称为等周数的量建立了一个建立高度纠缠态所需时间的下限。我们提出的这个度量基于使用两个量子比特的酉操作来计算资源，同时允许任意快速的测量和经典反馈。我们使用这个度量来评估A. Bapat等人[Phys. Rev. A 98，062328（2018）]，并发现它是传统网格架构的一种有前途的替代方案。我们还表明，这个度量放置在高度纠缠态的创建时间的下限可以饱和的建设性协议，高达一个因子对数的量子位数。
Quantum linear network coding for entanglement distribution in restricted architectures
在本文中，我们提出了一种技术，用于分布式纠缠的体系结构中，量子比特对之间的相互作用被约束到一个固定的网络$G$。这允许通过门隐形传态在$G$中彼此远离的量子位之间执行双量子位操作。我们演示了如何适应\emph{quantum linear network coding}的量子比特网络中的纠缠分布的这个问题，可以用来解决并行分布贝尔状态和GHZ状态的问题，当$G$中的瓶颈，否则将迫使这样的纠缠态被顺序分布。特别地，我们证明了通过简化为经典的网络编码协议，在固定网络$G$中的$k$对问题或多播问题，可以在发送器和接收器之间分配量子深度为一定的Clifford电路的纠缠。（通常很小并且容易计算）常数，其不取决于$G$的大小，无论发射器和接收器多么遥远，或者发射机和接收机的数量。这些结果也直接推广到任何素数维数的qudits。我们使用一种专门的形式主义来证明我们的结果，这种形式主义与稳定器形式主义不同，并且比稳定器形式主义更有效，这可能有助于推理和原型化这种量子线性网络编码电路。
