Optimality in Quantum Data Compression using Dynamical Entropy

Abstract

In this article we study lossless compression of strings of pure quantum states of indeterminate-length quantum codes which were introduced by Schumacher and Westmoreland. Past work has assumed that the strings of quantum data are prepared to be encoded in an independent and identically distributed way. We introduce the notion of quantum stochastic ensembles, allowing us to consider strings of quantum states prepared in a more general way. For any identically distributed quantum stochastic ensemble we define an associated quantum Markov chain and prove that the optimal average codeword length via lossless coding is equal to the quantum dynamical entropy of the associated quantum Markov chain.

References in corpus (5)

• Open Quantum Random Walks
• A random walk approach to quantum algorithms
• Quantum walks on graphs representing the firing patterns of a quantum neural network
• Lossless Quantum Prefix Compression for Communication Channels that are Always Open
• Lossless quantum data compression with exponential penalization: an operational interpretation of the quantum Rényi entropy