Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.20092

Entropy Concentration and Universal Typicality for Almost i.i.d. Quantum Sources

Nilanjana Datta

quant-phSubmitted May 19, 2026• Announced May 20, 2026• 5 citations• Revised Oct 10, 2026 (v2)
v1 · May 19, 2026v2 · Oct 10, 2026
arXivHTMLPDF

Abstract

We establish two concentration principles for almost i.i.d. quantum sources under the weakly almost i.i.d. condition, the broadest condition in the established hierarchy of almost i.i.d. sources. Our results therefore apply also to Wasserstein- and Mazzola-Sutter-Renner almost i.i.d. sources. Weakly almost i.i.d. sources are sequences of multipartite states whose fixed-size marginals converge, on average, to tensor powers of a reference state, while allowing arbitrary global correlations and entanglement. We prove a noncommutative weak law of large numbers for empirical observables, and a universal entropy-concentration principle showing asymptotic concentration on subspaces of exponential dimension governed by the von Neumann entropy of the reference state. These concentration principles provide a unified and conceptually transparent approach to several information-theoretic applications beyond the i.i.d. setting, including direct proofs of universal compression within classes of weakly almost i.i.d. sources sharing a common reference state and asymmetric quantum hypothesis-testing bounds. They also yield concentration of empirical local-measurement frequencies and of empirical averages of commuting single-site observables, with applications to single-site generalized Gibbs ensembles, together with bounds on smooth and spectral entropies.

Comments
27 pages;Revised version with corrections and clarifications. Main results unchanged

Related papers

New approaches to almost i.i.d. information theory

Filippo Girardi, Giacomo De Palma, Ludovico Lami

Independent and identically distributed (i.i.d.) states are ubiquitous in quantum information theory. However, in a practical setting, the i.i.d. assumption is too stringent, and possibly not realistic. A physically more compelling class of 'almost i.i.d.' sources was recently proposed by [Mazzola/Sutter/Renner, arXiv:2603.15792]. In this paper, we introduce two alternative definitions of almost i.i.d. states, based on the normalised quantum Wasserstein distance and on the idea of looking at the average $k$-body marginal. We explore some basic properties of these notions and prove a strict hierarchical relation among them, with Mazzola et al.'s notion being the strictest, the one based on $k$-body marginals the loosest, and the one based on the quantum Wasserstein distance in between. Strict separation is established by means of explicit examples.

quant-pharXiv:2605.15114•May 15, 2026•7 citations

Robustness of Entanglement Manipulation for almost i.i.d. sources

Nilanjana Datta

We study the robustness of asymptotic entanglement manipulation for Mazzola--Sutter--Renner (MSR) almost-iid sources, which allow a sublinear number of deviations from tensor-power structure. For pure sources along $|φ\rangle_{AB}$, every concentration rate below $S(φ_A)$ is achievable by a single Schur--Weyl protocol depending only on the rate and local Hilbert spaces. For general sources along $ρ_{AB}$, every distillation rate below $E_D(ρ_{AB})$ is achievable by a single LOCC protocol sequence independent of the particular source and defect size. Its error vanishes exponentially and uniformly for each prescribed defect bound $r_n=o(n)$, yielding an optimal universal distillation rate equal to $E_D(ρ_{AB})$. For dilution, the entanglement cost of every MSR almost-iid target sequence along $ρ_{AB}$ is at most $E_F^\infty(ρ_{AB})$, the regularized entanglement of formation of the reference state. Consequently, every MSR almost-iid sequence along a pure reference state $|φ\rangle_{AB}$ is asymptotically reversible, with distillable entanglement and entanglement cost equal to $S(φ_A)$, even when its individual states are mixed. The proofs establish structural and entropic properties of MSR almost-iid sources that may be useful in other information-theoretic settings.

quant-pharXiv:2606.06392•Jun 5, 2026•3 citations

Classical Typicality

Mark M. Wilde

This chapter begins our first technical foray into the asymptotic theory of information. We start with the classical setting in an effort to build up our intuition of asymptotic behavior before delving into the asymptotic theory of quantum information. The central concept of this chapter is the asymptotic equipartition property. The name of this property may sound somewhat technical at first, but it is merely an application of the law of large numbers to a sequence drawn independently and identically from a distribution p X ( x ) for some random variable X . The asymptotic equipartition property reveals that we can divide sequences into two classes when their length becomes large: those that are overwhelmingly likely to occur and those that are overwhelmingly likely not to occur. The sequences that are likely to occur are the typical sequences, and the ones that are not likely to occur are the atypical sequences. Additionally, the size of the set of typical sequences is exponentially smaller than the size of the set of all sequences whenever the random variable generating the sequences is not uniform. These properties are an example of a more general mathematical phenomenon known as “measure concentration,” in which a smooth function over a high-dimensional space or over a large number of random variables tends to concentrate around a constant value with high probability. The asymptotic equipartition property immediately leads to the intuition behind Shannon's scheme for compressing classical information. The scheme first generates a realization of a random sequence and asks the question: Is the produced sequence typical or atypical? If it is typical, compress it. Otherwise, throw it away. The error probability of this compression scheme is non-zero for any fixed length of a sequence, but it vanishes in the asymptotic limit because the probability of the sequence being in the typical set converges to one, while the probability that it is in the atypical set converges to zero. This compression scheme has a straightforward generalization to the quantum setting, in which we wish to compress qubits instead of classical bits. The bulk of this chapter is here to present the many technical details needed to make rigorous statements in the asymptotic theory of information. We begin with an example, follow with the formal definition of a typical sequence and a typical set, and prove the three important properties of a typical set.

Cambridge University Press eBooks•Nov 2, 2016•0 citations

Quantum sources and a quantum coding theorem

Christopher King, Andrezj Leśniewski

We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical source provides an upper bound for the dimension of the relevant subspace of the quantum source, via the Shannon–McMillan noiseless coding theorem. Along the way we derive a bound for the von Neumann entropy of the quantum source in terms of the Shannon entropy of the classical source, and we provide a definition of ergodicity of the quantum source. Several explicit models of quantum sources are also presented.

arXiv:quant-ph/9511019•Journal of Mathematical Physics•Jan 1, 1998•10 citations

Quantum sources and a quantum coding theorem

Christopher King, Lesniewski, A

Abstract. We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical source provides an upper bound for the dimension of the relevant subspace of the quantum source, via the Shannon-McMillan noiseless coding theorem. Along the way we derive a bound for the von Neumann entropy of the quantum source in terms of the Shannon entropy of the classical source, and we provide a definition of ergodicity of the quantum source. Several explicit models of quantum sources are also presented. 1 Supported in part by the National Science Foundation under grant DMS-9424344C. KING and A. LESNIEWSKI

•Nov 17, 1995•8 citations

Classical Typicality

Mark M. Wilde

This chapter begins our first technical foray into the asymptotic theory of information. We start with the classical setting in an effort to build up our intuition of asymptotic behavior before delving into the asymptotic theory of quantum information. The central concept of this chapter is the asymptotic equipartition property. The name of this property may sound somewhat technical at first, but it is merely an application of the law of large numbers to a sequence drawn independently and identically from a distribution pX(x) for some random variable X . The asymptotic equipartition property reveals that we can divide sequences into two classes when their length becomes large: those that are overwhelmingly likely to occur and those that are overwhelmingly likely not to occur. The sequences that are likely to occur are the typical sequences, and the ones that are not likely to occur are the atypical sequences. Additionally, the size of the set of typical sequences is exponentially smaller than the size of the set of all sequences whenever the random variable generating the sequences is not uniform. These properties are an example of a more general mathematical phenomenon known as “measure concentration,” in which a smooth function over a high-dimensional space or over a large number of random variables tends to concentrate around a constant value with high probability.

Cambridge University Press eBooks•Apr 18, 2013•0 citations
We establish two concentration principles for almost i.i.d. quantum sources under the weakly almost i.i.d. condition, the broadest condition in the established hierarchy of almost i.i.d. sources. Our results therefore apply also to Wasserstein- and Mazzola-Sutter-Renner almost i.i.d. sources. Weakly almost i.i.d. sources are sequences of multipartite states whose fixed-size marginals converge, on average, to tensor powers of a reference state, while allowing arbitrary global correlations and entanglement. We prove a noncommutative weak law of large numbers for empirical observables, and a universal entropy-concentration principle showing asymptotic concentration on subspaces of exponential dimension governed by the von Neumann entropy of the reference state. These concentration principles provide a unified and conceptually transparent approach to several information-theoretic applications beyond the i.i.d. setting, including direct proofs of universal compression within classes of weakly almost i.i.d. sources sharing a common reference state and asymmetric quantum hypothesis-testing bounds. They also yield concentration of empirical local-measurement frequencies and of empirical averages of commuting single-site observables, with applications to single-site generalized Gibbs ensembles, together with bounds on smooth and spectral entropies.
Independent and identically distributed (i.i.d.) states are ubiquitous in quantum information theory. However, in a practical setting, the i.i.d. assumption is too stringent, and possibly not realistic. A physically more compelling class of 'almost i.i.d.' sources was recently proposed by [Mazzola/Sutter/Renner, arXiv:2603.15792]. In this paper, we introduce two alternative definitions of almost i.i.d. states, based on the normalised quantum Wasserstein distance and on the idea of looking at the average kkk-body marginal. We explore some basic properties of these notions and prove a strict hierarchical relation among them, with Mazzola et al.'s notion being the strictest, the one based on kkk-body marginals the loosest, and the one based on the quantum Wasserstein distance in between. Strict separation is established by means of explicit examples.
We study the robustness of asymptotic entanglement manipulation for Mazzola--Sutter--Renner (MSR) almost-iid sources, which allow a sublinear number of deviations from tensor-power structure. For pure sources along ∣φ⟩AB|φ\rangle_{AB}∣φ⟩AB​, every concentration rate below S(φA)S(φ_A)S(φA​) is achievable by a single Schur--Weyl protocol depending only on the rate and local Hilbert spaces. For general sources along ρABρ_{AB}ρAB​, every distillation rate below ED(ρAB)E_D(ρ_{AB})ED​(ρAB​) is achievable by a single LOCC protocol sequence independent of the particular source and defect size. Its error vanishes exponentially and uniformly for each prescribed defect bound rn=o(n)r_n=o(n)rn​=o(n), yielding an optimal universal distillation rate equal to ED(ρAB)E_D(ρ_{AB})ED​(ρAB​). For dilution, the entanglement cost of every MSR almost-iid target sequence along ρABρ_{AB}ρAB​ is at most EF∞(ρAB)E_F^\infty(ρ_{AB})EF∞​(ρAB​), the regularized entanglement of formation of the reference state. Consequently, every MSR almost-iid sequence along a pure reference state ∣φ⟩AB|φ\rangle_{AB}∣φ⟩AB​ is asymptotically reversible, with distillable entanglement and entanglement cost equal to S(φA)S(φ_A)S(φA​), even when its individual states are mixed. The proofs establish structural and entropic properties of MSR almost-iid sources that may be useful in other information-theoretic settings.
This chapter begins our first technical foray into the asymptotic theory of information. We start with the classical setting in an effort to build up our intuition of asymptotic behavior before delving into the asymptotic theory of quantum information. The central concept of this chapter is the asymptotic equipartition property. The name of this property may sound somewhat technical at first, but it is merely an application of the law of large numbers to a sequence drawn independently and identically from a distribution p X ( x ) for some random variable X . The asymptotic equipartition property reveals that we can divide sequences into two classes when their length becomes large: those that are overwhelmingly likely to occur and those that are overwhelmingly likely not to occur. The sequences that are likely to occur are the typical sequences, and the ones that are not likely to occur are the atypical sequences. Additionally, the size of the set of typical sequences is exponentially smaller than the size of the set of all sequences whenever the random variable generating the sequences is not uniform. These properties are an example of a more general mathematical phenomenon known as “measure concentration,” in which a smooth function over a high-dimensional space or over a large number of random variables tends to concentrate around a constant value with high probability. The asymptotic equipartition property immediately leads to the intuition behind Shannon's scheme for compressing classical information. The scheme first generates a realization of a random sequence and asks the question: Is the produced sequence typical or atypical? If it is typical, compress it. Otherwise, throw it away. The error probability of this compression scheme is non-zero for any fixed length of a sequence, but it vanishes in the asymptotic limit because the probability of the sequence being in the typical set converges to one, while the probability that it is in the atypical set converges to zero. This compression scheme has a straightforward generalization to the quantum setting, in which we wish to compress qubits instead of classical bits. The bulk of this chapter is here to present the many technical details needed to make rigorous statements in the asymptotic theory of information. We begin with an example, follow with the formal definition of a typical sequence and a typical set, and prove the three important properties of a typical set.
We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical source provides an upper bound for the dimension of the relevant subspace of the quantum source, via the Shannon–McMillan noiseless coding theorem. Along the way we derive a bound for the von Neumann entropy of the quantum source in terms of the Shannon entropy of the classical source, and we provide a definition of ergodicity of the quantum source. Several explicit models of quantum sources are also presented.
Abstract. We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical source provides an upper bound for the dimension of the relevant subspace of the quantum source, via the Shannon-McMillan noiseless coding theorem. Along the way we derive a bound for the von Neumann entropy of the quantum source in terms of the Shannon entropy of the classical source, and we provide a definition of ergodicity of the quantum source. Several explicit models of quantum sources are also presented. 1 Supported in part by the National Science Foundation under grant DMS-9424344C. KING and A. LESNIEWSKI
This chapter begins our first technical foray into the asymptotic theory of information. We start with the classical setting in an effort to build up our intuition of asymptotic behavior before delving into the asymptotic theory of quantum information. The central concept of this chapter is the asymptotic equipartition property. The name of this property may sound somewhat technical at first, but it is merely an application of the law of large numbers to a sequence drawn independently and identically from a distribution pX(x) for some random variable X . The asymptotic equipartition property reveals that we can divide sequences into two classes when their length becomes large: those that are overwhelmingly likely to occur and those that are overwhelmingly likely not to occur. The sequences that are likely to occur are the typical sequences, and the ones that are not likely to occur are the atypical sequences. Additionally, the size of the set of typical sequences is exponentially smaller than the size of the set of all sequences whenever the random variable generating the sequences is not uniform. These properties are an example of a more general mathematical phenomenon known as “measure concentration,” in which a smooth function over a high-dimensional space or over a large number of random variables tends to concentrate around a constant value with high probability.