Efficient superdense coding in the presence of non-Markovian noise
Bi-Heng Liu, Xiao-Min Hu, Yun-Feng Huang, Chuan-Feng Li, Guang-Can, Guo, Antti Karlsson, Elsi-Mari Laine, Sabrina Maniscalco, Chiara, Macchiavello, Jyrki Piilo

TL;DR
This paper demonstrates a superdense coding scheme resilient to noise by exploiting non-Markovian effects, achieving high information transfer efficiency despite significant entanglement loss, with potential applications in secure quantum communication.
Contribution
The authors experimentally show that non-Markovian features can be exploited to maintain high superdense coding efficiency even with highly dephased entangled states.
Findings
Achieved mutual information close to 1.52 bits with 3-state encoding.
Maintained high interference visibility of 99.6%, enabling efficient information transfer.
Demonstrated robustness of superdense coding against non-Markovian noise.
Abstract
Many quantum information tasks rely on entanglement, which is used as a resource, for example, to enable efficient and secure communication. Typically, noise, accompanied by loss of entanglement, reduces the efficiency of quantum protocols. We develop and demonstrate experimentally a superdense coding scheme with noise, where the decrease of entanglement in Alice's encoding state does not reduce the efficiency of the information transmission. Having almost fully dephased classical two-photon polarization state at the time of encoding with concurrence , we reach values of mutual information close to () with 3-state (4-state) encoding. This high efficiency relies both on non-Markovian features, that Bob exploits just before his Bell-state measurement, and on very high visibility () of the Hong-Ou-Mandel interference within the…
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.
