Quantum Teleportation with One Classical Bit
Abhishek Parakh

TL;DR
This paper proposes a modified quantum teleportation protocol that reduces classical communication from two bits to one bit by leveraging multiple copies of the qubit, enhancing efficiency and security in quantum communication.
Contribution
It introduces a new teleportation protocol that requires only one classical bit, improving upon the standard two-bit protocol by utilizing multiple copies of the qubit.
Findings
Requires only one classical bit with probability > 0.5
Allows resetting the entangled pair to initial state locally
Implications for more efficient quantum communication and cryptography
Abstract
Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical information and assumes that the sender has access to only one copy of the arbitrary qubit to the sent. Here, we ask whether we can do better than two bits of classical information if the sender has access to multiple copies of the qubit to be teleported. We place no restrictions on the qubit states. Consequently, we propose a modified quantum teleportation protocol that allows Alice to reset the state of the entangled pair to its initial state using only local operations. As a result, the proposed teleportation protocol requires the transmission of only one classical bit with a probability greater than one-half. This has implications for efficient…
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.
