Rogers, C. (Caroline) and Nagarajan, Rajagopal (2011) Lossless quantum data compression and quantum Kolmogorov complexity. International Journal of Quantum Information, Volume 9 (Number 2). pp. 637-650. doi:10.1142/S0219749911007848 ISSN 0219-7499.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Kolmogorov complexity, Quantum computers, Data compression (Computer science)
Journal or Publication Title:	International Journal of Quantum Information
Publisher:	World Scientific Publishing Co. Pte. Ltd.
ISSN:	0219-7499
Official Date:	2011
Dates:	Date Event 2011 Published
Volume:	Volume 9
Number:	Number 2
Page Range:	pp. 637-650
DOI:	10.1142/S0219749911007848
Status:	Peer Reviewed
Publication Status:	Published
Funder:	Engineering and Physical Sciences Research Council (EPSRC)

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item