Quantum Information, Kolmogorov Complexity and Applications

Anoop Saxena1 , Apoorv Bansal1 , Darpit Choudhary1 , and Kartavya Jain1

1
Department of Physics, Indian Institute of Technology - Kanpur, Kanpur, UP 208016

March 2019

Abstract
The underlying motivation for classical information theory is sending information, typically bit-
strings, through communication channels. Supplementing this rich theory with the power of quantum
computing is sure to fetch more efficiency when one is able to build a Quantum Communication Channel.
In this article we will be dealing with quantifying resource trade-offs which are incurred in elementary
quantum dynamics processes pertaining quantum information processing. We begin by giving a short ex-
posure to the classical information theory through the basic definitions and elementary but indispensable
results (Entropy, Shannon-Fano Codes). We then proceed to quantify the quantum information principles
(Holevo bound, noiseless coding theorem, etc)[4]. These lay the groundwork for presenting Kolmogorov
Complexity[3], and its quantum version[2] which, in simple terms is the degree of randomization of a bit
string. We then proceed to study some recently developed applications of Quantum Kolmogorov Com-
plexity in thermodynamics by Bennett[1] and Zurek[5], where we conclude with a discussion of Maxwell’s
demon from KC’s perspective.

References
[1] Charles H. Bennett. “The thermodynamics of computation—a review”. In: International Journal of
Theoretical Physics 21 (1982), pp. 905–940.
[2] André Berthiaume, Wim van Dam, and Sophie Laplante. “Quantum Kolmogorov Complexity”. In:
Journal of Computer and System Sciences 63.2 (Sept. 2001), pp. 201–221. issn: 0022-0000. doi: 10.
1006/jcss.2001.1765. url: http://dx.doi.org/10.1006/jcss.2001.1765.
[3] Ming Li and Paul Vitanyi. An Introduction to Kolmogorov Complexity and Its Applications. 3rd.
Springer.
[4] Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information: 10th An-
niversary Edition. 10th. USA: Cambridge University Press, 2011. isbn: 1107002176.
[5] W. H. Zurek. “Algorithmic randomness and physical entropy”. In: Phys. Rev. A 40 (8 Oct. 1989),
pp. 4731–4751. doi: 10 . 1103 / PhysRevA . 40 . 4731. url: https : / / link . aps . org / doi / 10 . 1103 /
PhysRevA.40.4731.