Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely fragile due to environment noise. A promising technique to combat against quantum decoherence is entanglement purification. To fully exploit its benefit, two fundamental research questions need to be answered: (1) given an entanglement path, what is the optimal entanglement purification schedule? (2) how to compute min-cost end-to-end entanglement paths subject to fidelity constraint? In this paper, we give algorithmic solutions to both questions. For the first question, we develop an optimal entanglement purification scheduling algorithm for the single-hop case and analyze the \textsc{purify-and-swap} strategy in the multi-hop case by establishing the closed-form condition for its optimality. For the second question, we design a polynomial-time algorithm constructing an $ε$-optimal fidelity-constrained path. The effectiveness of our algorithms are also numerically demonstrated by extensive simulations.
mat2qubit: A lightweight pythonic package for qubit encodings of vibrational, bosonic, graph coloring, routing, scheduling, and general matrix problems
Routing and Scheduling Optimization for Urban Air Mobility Fleet Management using Quantum Annealing
Graduate School of Information Sciences, Tohoku University（东北大学信息科学研究科）；Sigma-i Co., Ltd.（Sigma-i 公司）；Sumitomo Corporation（住友商事）；Department of Physics, Tokyo Institute of Technology（东京工业大学物理系）
Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions
Department of Electrical Engineering, Columbia University（哥伦比亚大学电气工程系）；Department of Electrical Engineering, Imam Khomeini International University（伊玛目·霍梅尼国际大学电气工程系）；Department of Electrical Engineering, Qatar University（卡塔尔大学电气工程系）
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
The University of Tokyo（东京大学）；NTT Computer and Data Science Laboratories, NTT Corporation（日本电信电话公司计算机与数据科学实验室）；JST, PRESTO（日本科学技术振兴机构 PRESTO 项目）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）；Faculty of Information Science and Technology, Hokkaido University（北海道大学信息科学技术学院）
Quantum Internet: Resource Estimation for Entanglement Routing
Airbus Central Research and Technology（空客中央研究与技术）；Institute for Quantum Physics and Center for Optical Quantum Technologies, University of Hamburg（汉堡大学量子物理研究所与光学量子技术中心）；The Hamburg Centre for Ultrafast Imaging（汉堡超快成像中心）
