Perfect Quantum Teleportation and Superdense coding with $P_{max} = 1/2$ states
Eylee Jung, Mi-Ra Hwang, DaeKil Park, Jin-Woo Son, S. Tamaryan

TL;DR
This paper proposes a conjecture linking perfect quantum teleportation to a specific Groverian entanglement measure and verifies it through analysis of certain quantum states allowing perfect teleportation and superdense coding.
Contribution
It introduces a conjecture that perfect teleportation requires Groverian entanglement of 1/√2 and provides explicit examples supporting this claim.
Findings
States with Groverian measure 1/√2 enable perfect teleportation.
The conjecture is supported by analyzing specific quantum states.
Explicit calculations confirm the link between entanglement measure and teleportation perfection.
Abstract
We conjecture that criterion for perfect quantum teleportation is that the Groverian entanglement of the entanglement resource is . In order to examine the validity of our conjecture we analyze the quantum teleportation and superdense coding with , where and 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 and , which also allow the perfect quantum teleportation. It is shown that both states have Groverian entanglement measure, which strongly supports that our conjecture is valid.
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.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
