Affiliation:
1. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK
Abstract
We show that the optimal rate of lossless quantum data compression is closely related to Berthiaume, van Dam and Laplante's quantum Kolmogorov complexity. We show that: • The expected quantum Kolmogorov complexity of a mixture is close to the optimal rate of lossless data compression of that mixture. • If quantum Kolmogorov complexity obeys some inequality, then so does the optimal rate of lossless quantum data compression.
Publisher
World Scientific Pub Co Pte Lt
Subject
Physics and Astronomy (miscellaneous)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Second quantised information distance;IET Quantum Communication;2022-09-28
2. Quantum information distance;International Journal of Quantum Information;2021-09