A Study of Teleportation and Super Dense Coding capacity in Remote Entanglement Distribution
Sk Sazim, Indranil Chakrabarty

TL;DR
This paper investigates the capacities of teleportation and super dense coding in a quantum network, establishing theoretical bounds and relations based on entanglement measures, with implications for quantum communication efficiency.
Contribution
It introduces new theorems linking teleportation and super dense coding capacities to entanglement measures in remote entanglement distribution.
Findings
Derived bounds for teleportation fidelity based on resource entanglement.
Established relations between super dense coding capacity and entanglement measures.
Demonstrated potential applications in quantum network information transfer.
Abstract
In this work we consider a quantum network consisting of nodes and entangled states connecting the nodes. In evrey node there is a single player. The players at the intermediate nodes carry out measurements to produce an entangled state between the initial and final node. Here we address the problem that how much classical as well as quantum information can be sent from initial node to final node. In this context, we present strong theorems along with proosf, which state that how the teleportation capability of this remotely prepared state is linked up with the fidelities of teleportation of the resource states. Similarly, we analyze the super dense coding capacity of this remotely prepared state in terms of the capacities of the resource entangled states. However, we first obtain the relations involving the amount of entanglement of the resource states with the final state in terms 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.
