A study of teleportation and super dense coding capacity in remote entanglement distribution
1 Institute of Physics, Sainik School
2 International Institute of Information Technology, Gachibowli, 500032 Hyderabad, Andhra Pradesh, India
Received in final form: 9 May 2013
Published online: 6 August 2013
In this work we consider a quantum network consisting of nodes and entangled states connecting them. In every 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 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 concurrence. These relations are quite similar to the bounds obtained in references [G. Gour, Phys. Rev. A 71, 012318 (2005); G. Gour, B.C. Sanders, Phys. Rev. Lett. 93, 260501 (2005)]. More specifically, in an arbitrary quantum network when two nodes are not connected, our result shows how much information, both quantum and classical can be transmitted between these nodes. We show that the amount of transferable information depends on the capacities of the inter connecting entangled resources. These results have a tremendous future application in the context of determining the optimal path in a quantum network to send the maximal possible information.
Key words: Quantum Information
© EDP Sciences, Società Italiana di Fisica and Springer-Verlag 2013