Teleportation fidelity of quantum repeater networks

• URL: http://arxiv.org/abs/2409.20304v1
• Date: Mon, 30 Sep 2024 14:02:58 GMT
• Title: Teleportation fidelity of quantum repeater networks
• Authors: Ganesh Mylavarapu, Subrata Ghosh, Chittaranjan Hens, Indranil Chakrabarty, Subhadip Mitra,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. We use simple Werner state-based models to characterise some fundamental (loopless) topologies (star, chain, and some trees) with respect to this measure in three (semi)realistic scenarios. Most of our results are analytic and are applicable for arbitrary network sizes. We identify the parameter ranges where these networks can achieve quantum advantages and show the large-N behaviours.

Related papers

• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
  We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks. We show that while entanglement is needed for this quantum advantage, genuine multipartite entanglement is generally unnecessary.
  arXiv  Detail & Related papers  (2024-09-25T16:55:07Z)
• 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)
• Quantum-enhanced metrology with network states [8.515162179098382]
  We prove a general bound that limits the performance of using quantum network states to estimate a global parameter. Our work establishes both the limitation and the possibility of quantum metrology within quantum networks.
  arXiv  Detail & Related papers  (2023-07-15T09:46:35Z)
• Certification of non-classicality in all links of a photonic star network without assuming quantum mechanics [52.95080735625503]
  Full network nonlocality goes beyond standard nonlocality in networks by falsifying any model in which at least one source is classical. We report on the observation of full network nonlocality in a star-shaped network featuring three independent sources of photonic qubits and joint three-qubit entanglement-swapping measurements.
  arXiv  Detail & Related papers  (2022-12-19T19:00:01Z)
• 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)
• Composable end-to-end security of Gaussian quantum networks with untrusted relays [0.0]
  We theoretically tackle composable security of arbitrary quantum networks (quantum networks) with generally untrusted nodes. We find that the key rate of a quantum amplifier-assisted chain can ideally beat the fundamental repeaterless limit with practical block sizes.
  arXiv  Detail & Related papers  (2022-03-22T18:05:07Z)
• 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)
• A Reconfigurable Quantum Local Area Network Over Deployed Fiber [1.1713998235451095]
  We implement flex-grid entanglement distribution in a deployed network for the first time. We quantify the quality of the distributed polarization entanglement via log-negativity. We demonstrate one possible quantum protocol enabled by the distributed entanglement network.
  arXiv  Detail & Related papers  (2021-02-26T17:08:03Z)
• 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)
• Disentangling Trainability and Generalization in Deep Neural Networks [45.15453323967438]
  We analyze the spectrum of the Neural Tangent Kernel (NTK) for trainability and generalization across a range of networks. We find that CNNs without global average pooling behave almost identically to FCNs, but that CNNs with pooling have markedly different and often better generalization performance.
  arXiv  Detail & Related papers  (2019-12-30T18:53:24Z)

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.