Entanglement Assisted Classical Capacity of a Class of Quantum Channels with Long-Term Memory
Nilanjana Datta, Yurii Suhov, Tony C. Dorlas

TL;DR
This paper calculates the maximum rate of reliable classical information transmission over a specific class of quantum channels with long-term memory, using entanglement assistance, considering channels modeled by a Markov chain.
Contribution
It introduces a method to evaluate the entanglement-assisted capacity for quantum channels with long-term memory modeled by a non-irreducible Markov chain.
Findings
Derived capacity formulas for channels with long-term memory.
Extended existing models to include aperiodic Markov chain memory.
Provided insights into quantum communication over correlated channels.
Abstract
In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by a Markov chain which is aperiodic but not irreducible.
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
