Charles H. Bennett

TL;DR: Landauer's principle, often regarded as the basic principle of the thermodynamics of information processing, holds that any logically irreversible manipulation of information, such as the erasure of a bit or the merging of two computation paths, must be accompanied by a corresponding entropy increase in non-information-bearing degrees of freedom of the information processing apparatus or its environment as mentioned in this paper.

TL;DR: Let A be a language chosen randomly by tossing a fair coin for each string x to determine whether x belongs to A, and${\bf NP}^A is shown, with probability 1, to contain a-immune set, i.e., a set having no infinite subset in ${\bf P]^A $.

TL;DR: Using a pebbling argument, this paper shows that, for any $\varepsilon > 0$, ordinary multitape Turing machines using time T and space S can be simulated by reversible ones using time $O(T^{1 + \varpsilon } )$ and space $O (S\log T)$ or in linear time and space$O(ST^\varePSilon )$.

TL;DR: The fundamentals of the field, source coding, quantum error-correcting codes, capacities of quantum channels, measures of entanglement and quantum cryptography are discussed.

Abstract: Two separated observers, by applying local operations to a supply of not-too-impure entangled states ({\\em e.g.} singlets shared through a noisy channel), can prepare a smaller number of entangled pairs of arbitrarily high purity ({\\em e.g.} near-perfect singlets). These can then be used to faithfully teleport unknown quantum states from one observer to the other, thereby achieving faithful transfrom one observer to the other, thereby achieving faithful transmission of quantum information through a noisy channel. We give upper and lower bounds on the yield $D(M)$ of pure singlets ($\\ket{\\Psi^-}$) distillable from mixed states $M$, showing $D(M)>0$ if $\\bra{\\Psi^-}M\\ket{\\Psi^-}>\\half$.