Visible compression of commuting mixed states
classification
🪐 quant-ph
keywords
compressioncommutingvisibleanalyzeboundcasedatadensity
read the original abstract
We analyze the problem of quantum data compression of commuting density operators in the visible case. We show that the lower bound for the compression factor given by the Levitin--Holevo function is reached by providing an explicit protocol.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.