activity
20022014
most citedA quantum version of Sanov's theorem

74 citations · 185 across the 12 of their papers we have counts for

collaborators

12 papers

cs.IT2014

Sequential Recurrence-Based Multidimensional Universal Source Coding of Lempel-Ziv Type

Tyll Krueger, Guido Montufar, Ruedi Seiler +1

We define an algorithm that parses multidimensional arrays sequentially into mainly unrepeated but nested multidimensional sub-arrays of increasing size, and show that the resultin…

cs.IT2011★ 1 cited

Universally Typical Sets for Ergodic Sources of Multidimensional Data

Tyll Krueger, Guido Montufar, Ruedi Seiler +1

We lift important results about universally typical sets, typically sampled sets, and empirical entropy estimation in the theory of samplings of discrete ergodic information source…

math.PR2007★ 25 cited

Typical support and Sanov large deviations of correlated states

I. Bjelakovic, J. -D. Deuschel, T. Krueger +3

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 g…

math.PR2006★ 4 cited

Induced gelation in a two-site spatial coagulation model

Rainer Siegmund-Schultze, Wolfgang Wagner

A two-site spatial coagulation model is considered. Particles of masses and at the same site form a new particle of mass at rate . Independently, particles jump t…

quant-ph2005★ 35 cited

Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem

Fabio Benatti, Tyll Krueger, Markus Mueller +2

In classical information theory, entropy rate and Kolmogorov complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, co…

quant-ph2004★ 74 cited

A quantum version of Sanov's theorem

I. Bjelakovic, J. -D. Deuschel, T. Krueger +3

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…