We present a quantum extension of a version of Sanov's theorem focussing on a hypothesis testing aspect of the theorem: There exists a sequence of typical subspaces for a given set Ψ of stationary quantum product states asymptotically separating them from another fixed stationary product state. Analogously to the classical case, the exponential separating… (More)
A two-site spatial coagulation model is considered. Particles of masses m and n at the same site form a new particle of mass m + n at rate mn. Independently, particles jump to the other site at a constant rate. The limit (for increasing particle numbers) of this model is expected to be non-deterministic after the gelation time, namely, one or two giant… (More)
We formulate and prove a quantum Shannon-McMillan theorem. The theorem demonstrates the significance of the von Neumann entropy for translation invariant ergodic quantum spin systems on Z ν-lattices: the en-tropy gives the logarithm of the essential number of eigenvectors of the system on large boxes. The one-dimensional case covers quantum information… (More)
Discrete stationary classical processes as well as quantum lattice states are asymptotically confined to their respective typical support, the exponential growth rate of which is given by the (maximal ergodic) entropy. In the iid case the distinguishability of typical supports can be asymp-totically specified by means of the relative entropy, according to… (More)
We prove the ergodic version of the quantum Stein's lemma which was conjectured by Hiai and Petz. The result provides an operational and statistical interpretation of the quantum relative entropy as a statistical measure of distinguishability, and contains as a special case the quantum version of the Shannon-McMillan theorem for ergodic states. A version of… (More)
In classical information theory, entropy rate and algorithmic complexity per symbol are related by a theorem of Brudno. In this paper , we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of quantum Kolmogorov complexity , both based on the shortest qubit descriptions of qubit strings that, run by a universal… (More)
We give an equivalent finitary reformulation of the classical Shannon-McMillan-Breiman theorem which has an immediate translation to the case of ergodic quantum lattice systems. This version of a quantum Breiman theorem can be derived from the proof of the quantum Shannon-McMillan theorem presented in .
We give a self-contained, new proof of the monotonicity of the quantum relative entropy which seems to be natural from the point of view of quantum information theory. It is based on the quantum version of Stein's lemma which provides an operational interpretation of the quantum relative entropy.
We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is O(n −1/2). Moment or symmetry assumptions are not necessary. In removing symmetry the (sharp) inequality P (|X + Y | ≤ 1) < 2P (|X − Y | ≤ 1) for independent identically distributed X, Y is used. In part II we shall… (More)
In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is O(n −1/2). In higher dimensions we call a random walk 'polygonally recurrent' (resp. transient) if a.s. infinitely many (resp. finitely many) of the straight lines between two… (More)