Teleportation Fidelity of Binary Tree Quantum Repeater Networks

• URL: http://arxiv.org/abs/2508.10417v2
• Date: Sat, 06 Sep 2025 11:06:27 GMT
• Title: Teleportation Fidelity of Binary Tree Quantum Repeater Networks
• Authors: Soumit Roy, Md Rahil Miraj, Chittaranjan Hens, Ganesh Mylavarapu, Subrata Ghosh, Indranil Chakrabarty,
• Abstract summary: We consider four types of binary tree repeater networks (directed, undirected, asymmetric and symmetric)<n>Our work investigates the role of directionality and symmetry in this measure.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: The idea of average of maximum teleportation fidelities was introduced in [1] to measure the capability of the network to act as a resource for distributed teleportation between any pair of nodes. 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. Our work investigates the role of directionality and symmetry in this measure. Like [1], here also 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 explore the role of maximally entangled states in the network to enhance the quantum advantage. We explore the large $N$ (nodes) scenario for each of these networks and find out the limiting value of the average of the maximum teleportation fidelity for each of these networks. We also include the scenarios when the Werner state parameters for each link are different and chosen from a uniform distribution. According to our analysis, the directed symmetric binary tree is the most beneficial topology in this context. Our results pave the way to identify the resourceful network in transmitting quantum information.

Related papers

• Teleportation fidelity of quantum repeater networks [0.0]
  We show that the average of the maximum teleportation fidelities between all pairs of nodes in a large quantum repeater network is a measure of the resourcefulness of the network as a whole.
  arXiv  Detail & Related papers  (2024-09-30T14:02:58Z)
• Entanglement topography of large-scale quantum networks [0.0]
  Large-scale quantum networks, necessary for distributed quantum information processing, are posited to have quantum entangled systems between distant network nodes. We uncover the parametric entanglement topography and introduce the notion of typical and maximal viable regions for entanglement-enabled tasks in a general model of large-scale quantum networks. We show that such a topographical analysis, in terms of viability regions, reveals important functional information about quantum networks, provides experimental targets for the edge parameters and can guide efficient quantum network design.
  arXiv  Detail & Related papers  (2023-12-26T11:34:58Z)
• Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
  Quantum networks rely on entanglement between qubits at distant nodes to transmit information. We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links. We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
  arXiv  Detail & Related papers  (2022-12-17T05:40:09Z)
• Scaling Network Topologies for Multi-User Entanglement Distribution [0.0]
  Future quantum internet relies on large-scale entanglement distribution. Quantum decoherence is a significant obstacle in large-scale networks, which otherwise perform better with multiple paths between the source and destination. We propose a new topology, connected tree, with a significant amount of redundant edges to support multi-path routing of entangled pairs.
  arXiv  Detail & Related papers  (2022-12-06T10:48:08Z)
• Routing a quantum state in a bio-inspired network [0.0]
  We consider a spin network resembling an $alpha$-helix structure and study quantum information transfer over this network. We investigate analytically and numerically the perfect state transfer (PST) in such a network which provides an upper bound on the probability of quantum states transfer from one node to another.
  arXiv  Detail & Related papers  (2022-11-25T15:27:26Z)
• Multiparty Entanglement Routing in Quantum Networks [0.0]
  A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks. The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
  arXiv  Detail & Related papers  (2022-11-12T15:40:34Z)
• Optimized Quantum Networks [68.8204255655161]
  Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests. We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
  arXiv  Detail & Related papers  (2021-07-21T18:00:07Z)
• Full network nonlocality [68.8204255655161]
  We introduce the concept of full network nonlocality, which describes correlations that necessitate all links in a network to distribute nonlocal resources. We show that the most well-known network Bell test does not witness full network nonlocality. More generally, we point out that established methods for analysing local and theory-independent correlations in networks can be combined in order to deduce sufficient conditions for full network nonlocality.
  arXiv  Detail & Related papers  (2021-05-19T18:00:02Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks [78.65792427542672]
  Dynamic Graph Network (DG-Net) is a complete directed acyclic graph, where the nodes represent convolutional blocks and the edges represent connection paths. Instead of using the same path of the network, DG-Net aggregates features dynamically in each node, which allows the network to have more representation ability.
  arXiv  Detail & Related papers  (2020-10-02T16:50:26Z)
• ReActNet: Towards Precise Binary Neural Network with Generalized Activation Functions [76.05981545084738]
  We propose several ideas for enhancing a binary network to close its accuracy gap from real-valued networks without incurring any additional computational cost. We first construct a baseline network by modifying and binarizing a compact real-valued network with parameter-free shortcuts. We show that the proposed ReActNet outperforms all the state-of-the-arts by a large margin.
  arXiv  Detail & Related papers  (2020-03-07T02:12:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.