2025/03/26 by David Fainsin, A. Debray, Fainsin, David +8 · 1 voice · 2 citations
Computer Science · Engineering · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Molecular Communication and Nanonetworks
paper · pdf · doi:10.48550/arxiv.2503.20547
Large-scale operations in quantum networks require efficient sorting of desired paths between nodes. In this article, we consider entanglement routing, which involves establishing an entanglement link between specific nodes in a large network of bosonic nodes. The networks are continuous-variable graph states built from finite squeezing and passive linear optics, shaped by complex network structures that mimic real-world networks. We construct a bipartite routing protocol with the specific goal of establishing a teleportation channel between two clients via passive optics operations locally operated by two different providers sharing the network. We provide criteria for extracting the aforementioned channel and, through the use of a derandomised evolutionary algorithm, extend the existing framework to study complex graph topologies.