Superdense coding using multipartite states
G. Rigolin

TL;DR
This paper demonstrates a superdense coding protocol using four-partite entangled states, enabling the transmission of 4 classical bits with only 2 qubits, and generalizes the protocol for N qubits.
Contribution
It introduces a superdense coding scheme with multipartite states that surpasses previous limits and generalizes to N qubits, linking it to Bell states for teleportation.
Findings
Transmits 4 bits using 2 qubits with four-partite entangled states.
Generalizes superdense coding to 2N bits via N qubits.
Shows equivalence between four-partite channels and two Bell states.
Abstract
We show that with the fourpartite quantum channel used to teleport an arbitrary two qubit state, we can construct a superdense coding protocol where it is possible to transmit 4 bits of classical information sending only 2 qubits. Alice and Bob initially share a four qubit maximally entangled state and by locally manipulating her two qubits Alice can generate 16 orthogonal maximally entangled states, which are used to encode the message transmitted to Bob. He reads the 4 bit message by a generalized Bell state measurement. A generalized protocol in which 2N bits of classical information is transmitted via N qubits is also presented. We also show that this four(2N-)partite channel is equivalent to two(N) Bell states, which proves that we need two(N) Bell states to teleport a two(N) qubit system.
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
TopicsNeural Networks and Applications · Computability, Logic, AI Algorithms
