Teleportation Fidelity of Binary Tree Quantum Repeater Networks
Soumit Roy, Md Rahil Miraj, Chittaranjan Hens, Ganesh Mylavarapu, Subrata Ghosh, Indranil Chakrabarty

TL;DR
This paper analyzes four types of binary tree quantum repeater networks, deriving formulas for teleportation fidelity, exploring quantum advantage conditions, and identifying the most effective topology for large-scale quantum teleportation.
Contribution
It provides a novel analytical methodology for calculating pathlengths and teleportation fidelity in various binary tree networks, highlighting the directed symmetric topology as optimal.
Findings
Directed symmetric binary tree yields highest teleportation fidelity.
Quantum advantage depends on Werner state parameters.
Fidelity approaches a limit as network size grows large.
Abstract
Binary tree network, being a subclass of Cayley tree network, is a significant topological structure used for information transfer in a hierarchical sense. In this article, we consider four types of binary tree repeater networks (directed and undirected, asymmetric and symmetric) and obtain the analytical expressions of the average of the maximum teleportation fidelities for each of these binary tree networks. We contribute a methodology for the analytical calculation of pathlengths in all considered graph types. Based on these, we have used simple Werner state-based models and are able to identify the parameter ranges for which these networks can show quantum advantage. We also explore the role of maximally entangled states in the network to enhance the quantum advantage. We provide a detailed examination of the large-scale behavior of these networks, obtaining the limiting value of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
