Quantum entanglement and teleportation assisted by multiple parties
Takeshi Hayashida

TL;DR
This paper proves the necessary and sufficient conditions for quantum teleportation involving multiple parties and extends the understanding of entanglement requirements for teleporting single-qubit messages.
Contribution
It provides a formal proof of the feasibility condition for quantum teleportation and generalizes the condition for multi-party scenarios.
Findings
Proof of the original feasibility condition for quantum teleportation
Extension of the condition to three-party and n-party systems
Clarification of entanglement requirements for multi-party teleportation
Abstract
Quantum teleportation can be performed if and only if a message is combined with a maximally entangled state. Bennett et al. originally claimed this feasibility condition. In this paper, I give a proof of that condition. Moreover, I specify the condition for teleportation when a single-qubit message is combined with a three-qubit state distributed among three parties. I also consider the situation that a single-qubit message is combined with an -qubit state distributed among parties.
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 Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
