The authors show that the process tensor of standard quantum reservoir computing reduces to a classical-quantum state, then use its Holevo quantities to diagnose information scrambling and fading memory in a six-qubit Ising reservoir.
Coding Theorems for Quantum Channels
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The more than thirty years old issue of the (classical) information capacity of quantum communication channels was dramatically clarified during the last years, when a number of direct quantum coding theorems was discovered. The present paper gives a self contained treatment of the subject, following as much in parallel as possible with classical information theory and, on the other side, stressing profound differences of the quantum case. An emphasis is made on recent results, such as general quantum coding theorems including cases of infinite (possibly continuous) alphabets and constrained inputs, reliability function for pure state channels and quantum Gaussian channel. Several still unsolved problems are briefly outlined.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Storage, Scrambling, and Loss of Information in the Quantum Reservoir Computing Paradigm
The authors show that the process tensor of standard quantum reservoir computing reduces to a classical-quantum state, then use its Holevo quantities to diagnose information scrambling and fading memory in a six-qubit Ising reservoir.