Optimality in Quantum Data Compression using Dynamical Entropy

04/10/2019
by   George Androulakis, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2023

On dynamical measures of quantum information

In this work, we use the theory of quantum states over time to define an...
research
06/25/2021

Quantum Data Compression and Quantum Cross Entropy

Quantum machine learning is an emerging field at the intersection of mac...
research
02/26/2022

Use of Set Shaping theory in the development of locally testable codes

In developing locally testable codes, information is added to the coded ...
research
11/16/2021

Introduction to Set Shaping Theory

In this article, we define the Set Shaping Theory whose goal is the stud...
research
04/15/2019

Deterministic Preparation of Dicke States

The Dicke state |D_k^n〉 is an equal-weight superposition of all n-qubit ...
research
09/06/2019

Extreme dimensional compression with quantum modelling

Effective and efficient forecasting relies on identification of the rele...
research
08/21/2009

Another Look at Quantum Neural Computing

The term quantum neural computing indicates a unity in the functioning o...

Please sign up or login with your details

Forgot password? Click here to reset