Perfect Quantum Teleportation and Superdense coding with Pmax=1/2 states
We conjecture that criterion for perfect quantum teleportation is that the Groverian entanglement of the entanglement resource is 1/2. In order to examine the validity of our conjecture we analyze the quantum teleportation and superdense coding with ∣Φ>=(1/2)(∣00q1>+∣11q2>), where ∣q1> and ∣q2> are arbitrary normalized single qubit states. It is shown explicitly that ∣Φ> allows perfect two-party quantum teleportation and superdense coding scenario. Next we compute the Groverian measures for ∣ψ>=1/2−b2∣100>+b∣010>+a∣001>+1/2−a2∣111> and ∣ψ~>=a∣000>+b∣010>+1/2−(a2+b2)∣100>+(1/2)∣111>, which also allow the perfect quantum teleportation. It is shown that both states have 1/2 Groverian entanglement measure, which strongly supports that our conjecture is valid.
We investigate the usefulness of a recently introduced five-qubit state by Brown et al. [I. D. K. Brown, S. Stepney, A. Sudbery, and S. L. Braunstein, J. Phys. A 38, 1119 (2005)] for quantum teleportation, quantum-state sharing, and superdense coding. It is shown that this state can be utilized for perfect teleportation of arbitrary single and two-qubit systems. We devise various schemes for quantum-state sharing of an arbitrary single- and two-particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits.