Comment on "Teleportation of Three-Qubit State via Six-qubit Cluster State"
Anindita Banerjee, Chitra Shukla

TL;DR
This paper proposes a simplified protocol for teleporting n-qubit states using only a 2-qubit Bell state, replacing complex multi-qubit cluster states, with success probability depending on the Bell state coefficients.
Contribution
It introduces an optimal method for n-qubit state teleportation via non-maximally entangled Bell states, simplifying previous complex approaches.
Findings
Feasibility of teleporting 3-qubit states with Bell states
Success probability equals |b|^2 for the protocol
Reduction of resource complexity from 6-qubit to 2-qubit states
Abstract
Recently Yu and Sun [Int. J. Theor. Phys. DOI 10.1007/s10773-014-2360-x] have presented probabilistic teleportation of 3-qubit cat state via 6-qubit cluster state. The success probability depends on absolute value of only two of the coefficients of cluster state i.e. |c|^2 + |d|^2. We have demonstrated the feasibility to teleport 3-qubit cat state via 2-qubit non maximally entangled Bell state instead of a complex state like 6-qubit non maximally entangled cluster state. In this comment we have prescribed an optimal protocol for teleportation of n-qubit state of the form (\alpha|x> + \beta|\bar{x}>)_n via non maximally entangled Bell state a|00> + b|11> henceforth allowing teleportation of n-qubit state via 2-qubit Bell state. The success probability of the prescribed protocol is |b|^2.
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 Mechanics and Applications · Quantum Information and Cryptography
