Probabilistic Dense Coding Using Non-Maximally Entangled Three-Particle State
Zhang Guo-Hua, Yan Feng-Li

TL;DR
This paper proposes a probabilistic dense coding scheme utilizing a non-maximally entangled three-particle quantum state, where success depends on auxiliary particles and collective unitaries, with average information transmission analyzed.
Contribution
It introduces a novel probabilistic dense coding protocol using non-maximally entangled three-particle states, including success probability and information transmission analysis.
Findings
Success probability depends on the entanglement degree.
Average information transmitted is quantitatively calculated.
The scheme enhances understanding of quantum communication with non-maximal entanglement.
Abstract
We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. Furthermore, the average information transmitted in this scheme is calculated.
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
