Resilient Graph Partitioning for Quantum Networks
Year: 2024
Type: conference-paper
Abstract: Quantum entanglement is important for quantum communications for long range transmission. Such long transmission is achieved through entanglement swapping, a method monopolizing considerable resources as the quantum network topology expands. Therefore, in this work we propose a method to reduce the resources required for entanglement swapping using network partitioning while ensuring resiliency. This method involves the fidelity of distributing entangled states that depends on the source, the link and the bell state analyzer utilized to quantify the required fidelity for a functioning network. By partitioning the network to redundant sub-graphs, we show the advantage of such approach in reducing the required functional fidelity.
Authors: Abdelkrim Menina, Hilal Sultan Duranoglu Tunc, Ayse Nur Yilmaz, Riccardo Bassoli, Frank H.P. Fitzek
Institutions: Technische Universität Dresden, Hasan Kalyoncu University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4411232577