Coarse graining Shannon and von Neumann entropies

The nature of coarse graining is intuitively"obvious", but it is rather difficult to find explicit and calculable models of the coarse graining process (and the resulting entropy flow) discussed in the literature. What we would like to have at hand is some explicit and calculable process that takes an arbitrary system, with specified initial entropy S, and monotonically and controllably drives the entropy to its maximum value. This does not have to be a physical process, in fact for some purposes it is better to deal with a gedanken-process, since then it is more obvious how the"hidden information"is hiding in the fine-grain correlations that one is simply agreeing not to look at. We shall present several simple mathematically well-defined and easy to work with conceptual models for coarse graining. We shall consider both the classical Shannon and quantum von Neumann entropies, including models based on quantum decoherence, and analyze the entropy flow in some detail. When coarse-graining the quantum von Neumann entropy, we find it extremely useful to introduce an adaptation of Hawking's super-scattering matrix. These explicit models that we shall construct allow us to quantify and keep clear track of the entropy that appears when coarse-graining the system, and the information that can be hidden in unobserved correlations. (While not the focus of the current article, in the longer run these considerations are of interest when addressing black hole information puzzle.)


Introduction
In this article we will aim to clarify some issues related with the "coarse graining" process that is typically asserted to be associated with the monotone increase of entropy implied by the second law of thermodynamics. While many sources discuss the "coarse graining" process in a somewhat intuitive manner, it is extremely difficult to find explicit, controllable, and fully calculable models, see for instance references [1][2][3][4][5][6][7][8]. (More general background, on coarse-graining in various renormalization group settings, can be found in references [9][10][11][12][13][14][15][16][17].) What we would be seeking in this current article is some process, (either purely mathematical or possibly physical), that takes an arbitrary system with specified initial entropy S, and monotonically drives the entropy to its maximum value -that is, ln N , for any finite classical or quantum system described by the Shannon or von Neumann entropies [18][19][20]. Whenever possible it would be desirable to introduce an adjustable smearing parameter to continuously interpolate between the original system and the smeared system.
For some purposes it is better to deal with a gedanken-process, since a gedanken-process is in principle reversible, and then it is more obvious how the "hidden information" is hiding in the correlations. The techniques that work best for classical Shannon entropy often do not carry over to quantum von Neumann entropy, or vice versa. We shall develop a number of different and complementary models for coarse graining, adapted to either classical or quantum behaviour, and (classically) to the continuum versus discretium character of the system. (The discretium is often alternatively referred to as the discretum; the choice is a matter of taste. Discretum is more Latinate, discretium is more Anglophone.) The relevance of having explicit, controllable, and calculable methods available to describe coarsegraining emerges when we deal with physical issues of information; specifically the "hidden information" lurking in the correlations rendered unobservable by the coarse graining. The current study provides some tools to treat these processes, which we plan to adapt to understand what is happening with the quantum information in black hole formation and evaporation, where the classical gravitational collapse that initially forms the black hole is an extremely dramatic coarse-graining process; one that encodes ideas about a possible resolution of the black hole information puzzle [21][22][23][24][25][26][27][28][29].

Structure of the article
We shall first present a brief historical survey of the coarse graining problem in section 3, and then discuss coarse graining in the context of classical Shannon entropy in section 4. For Shannon entropy in the continuum a coarse-graining in terms of an idealized and generalized diffusion process, (possibly a gedanken-process rather than real physical diffusion), is the easiest to implement. More generally, for Shannon entropy the distinction between continuum and discretium is important, and any coarse graining that maps the continuum into the discretium is particularly delicate. We then turn to the quantum von Neumann entropy in section 5, elucidating several coarse-graining processes based on maximal mixing, on partial traces, and on decoherence. We introduce Hawking's super-scattering operator in section 6, with an aim to using it in section 7 where we define a wide class of diffusion-like processes on Hilbert space (rather than in physical space). Finally we wrap up with a discussion in section 8.

History
Coarse-graining plays a crucial role in our description of the world. It allows us to work with very large or complex systems by choosing a more reasonable and tractable number of variables, (and consequently reducing the observable degrees of freedom of the system under consideration). See for instance references [1][2][3][4][5][6][7][8]. Coarse-graining should be chosen so as to still describe the key properties we are most interested in, "integrating over" properties of percieved lesser importance. These coarsegraining processes are used in very different fields, (from biology to physics to astronomy), but for the current article we are mostly interested applications to quantum information theory. (Though in future we plan to consider quantum fields in curved spacetimes.) The price of coarse-graining is that some properties or physical effects, corresponding to the degrees of freedom that we are not looking at, will be "hidden" in the system. When calculating the entropy of these coarse-grained systems there is an associated increase of system entropy due to uncertainty regarding the coarse-grained degrees of freedom. We shall see that the difference of entropy after imposing coarse-graining can be understood as "hidden information": Because coarse-graining can sometimes be viewed as a gedanken-process, an agreement to simply "not look at" certain features of the system, the coarse-grained entropy is unavoidably contextual and may be observer dependent.
Classically, the way to describe entropy associated with information is provided by the Shannon entropy, which first introduced the interpretation of entropy as a measure of lack of information [18,19].
In the language of communications engineers: where p i is the probability associated with each microstate and the entropy is measured in "shannons"/"bits". Physicists prefer to use the natural logarithm, ln, and measure the entropy in "natural units" (nats). There are several ways to define information, though in general, the information can be considered as the reduction of uncertainty. The maximum information, can be defined as the difference between the maximum possible entropy and the value we measure This is often called negentropy [18,19] and it is a measure of distance to complete uncertainty, p i = 1 N . In the context of quantum resource theory, this can be interpreted as the unique measure of information that is stable under a subset of "noisy operations" [30]. In terms of our hidden information due to coarse graining In the realm of quantum mechanics, the previous picture changes because the information is stored in a different way and the states can be entangled. The operator that represents the statistics of the physical states can be represented as a density matrix. The analogous entropy now refers to the entanglement entropy between different subsystems that were coarse-grained, and it is formulated by the von Neumann entropy [20]: Here ρ is the density matrix, and tr denotes the trace. This von Neumann entropy has to be conserved in unitary quantum evolution. However, there exists the possibility, (or necessity in some cases), that we decide to "look" only at one part of the system and forget about the rest. This process is different when quantum properties have to be taken into account, and will often correspond to "trace" over a specified subsystem. In this quantum case it can also be seen that coarse-graining corresponds to an increment of the entropy completely related with the "hidden" quantum information.
Other interesting questions emerge when the transition from quantum to classical systems is taken into account. Despite valiant efforts this process, the emergence of classicality and its interpretation, is still not completely well-understood. One of the strong possibilities comes from the idea of decoherence [31][32][33][34][35][36][37], that is based on the separation of relevant and irrelevant degrees of freedom of the system, and removing the interference terms (off-diagonal terms of the density matrix), that precisely comes from the interaction of the emergent classical system (relevant degrees of freedom) with the environment (irrelevant degree of freedom). It is easy to see that this process arises from a specific process for coarse-graining the system.
So in this approximation, the classical realm corresponds to a set of coarse-grained non-interfering histories, (called decoherent histories approach to quantum mechanics) [2,37]. It is important to note that there also exist other interesting ideas about classical emergence, that also involves some notion of coarse-graining. (See, for instance, references [3,4].) In both cases, classical and quantum, it is important to understand that the "hidden information" corresponds to correlations that we decide not to look at with our particular coarse-graining method. This implies that the measured entropy depends on the choice of the particular coarse-graining developed, entropy is contextual and can be observer dependent. For this reason, it is interesting for the physical interpretation to have some knowledge of "where" the hidden information is hidden, and "what" we hide, and how we hide it, in order to have complete control of our system. The importance of understanding these processes can be understood for instance in the study of some open questions related with information, (as for instance the black hole information puzzle [21][22][23][24][25][26][27][28][29], where it is not completely well understood where the information flows during the Hawking evaporation process).
In previous literature, coarse graining has been widely considered, (for instance, in references [1][2][3][4][5][6][7][8] and [38][39][40][41][42][43][44][45][46]), but in most of those cases coarse-graining is assumed ab initio, preventing one from having a complete control of the system. In this paper we shall study different quantifiable models of coarse-graining the entropy, and the selection of a suitable tuneable smearing parameter that will allow us to manipulate coarse-graining in a controllable manner, and understand what is hidden and what is correlated.

Coarse graining the classical Shannon entropy
For a classical system with a finite, or at worst denumerable, number of states (a discretium of states) the Shannon entropy can be defined as There are many abstract theorems that can be proved for this quantity, but which will not be the main focus here [47][48][49][50]. In contrast for a non denumerable number of states (a continuum of states; say 3-space for definiteness) it is better to write Here ρ * is some arbitrary-but-fixed parameter that is needed for dimensional consistency; it is just a convenient normalizing constant that effectively sets the zero for S. (In particular, continuum entropy differences are always independent of ρ * .) Note that under re-scaling we have the trivial result S(ρ; λρ * ) = S(ρ; ρ * ) + ln λ.

Continuum −→ continuum: Diffusion-based forms of coarse graining
Starting from the probability density ρ(x), coarse-grain using some sort of convolution process Here K(x, y; t) is some positive normalized kernel; t is not necessarily physical time, it is simply a parameter that controls how far you smear out the probability distribution. This kernel can be viewed as representing a "defocussing" process. A delta-function initially concentrated at x 0 , that is δ(x−x 0 ), becomes "smeared out" to a time-dependent and space-dependent "blob" K(x, x 0 , t). Now from the basic definition of Shannon entropy (in the continuum) we have Even before specializing the kernel K we seė Here, thanks to the normalizing condition, the RHS is actually independent of ρ * . Now let us be more specific: Let K be an ordinary diffusion operator, (that is, formally we can write K = exp{tσ∇ 2 }), where σ is the diffusion constant. Theṅ Therefore, in this ordinary diffusion situation, Integration by parts (noting that ρ * drops out of the calculation) now yieldṡ So under diffusion-like-smoothing, entropy always rises as the smearing parameter t increases. We can easily generalize this to position-dependent, direction-dependent, (and even density-dependent) diffusivity. Suppose the kernel (and so the probability density) satisfẏ This now describes a generalized diffusion process, with σ ij (x, ρ(x)) being a position-dependent, direction-dependent, (and even density-dependent), diffusion "constant". Then under the same logic as previouslyṠ with non-negativity holding as long as the matrix σ ij (x, ρ t (x)) is positive semidefinite. For either simple or generalized diffusion we can then define Here t is not necessarily physical time; it is simply the smearing parameter. If we view the diffusion process as a gedanken-process, a simple de-focussing of our vision described by the smearing parameter t, then the effect is clearly reversible, and I correlations is simply the information hiding in the correlations that we can no longer see due to our deliberately blurred vision -but this is information we can easily regain simply by refocussing our vision. Overall, this construction yields a nice explicitly controllable entropy flow as a function of the coarse graining parameter t.

Continuum −→ discretium: Box-averaging forms of coarse graining
Starting from the continuum, let us now divide the universe up into a denumerable set of nonoverlapping boxes B i , that nevertheless cover the entire universe. Then define individual probabilities p i for each box, so that you are throwing away (agreeing not to look at) detailed information of the probability distribution inside each individual box. Now compare the continuum and discretium entropies We shall consider 2 cases; a "simple" all-or-nothing box averaging, and a more subtle box averaging where one first diffuses the probability density in the continuum before implementing box-averaging.

Simple box-averaging
For "simple" box averaging, where we fix individual boxes B i but do not have any tuneable parameter to work with, we shall show that, (unfortunately the ρ * dependence is unavoidable): To prove this, use the idea of (classical) relative entropy (a measure of distinguishability between two entropies). It is a standard result that if ρ(x) and ρ 0 (x) are any two normalized probability distributions then Let us now define a "box-wise-constant" probability density ρ B (x) as follows (We do not care what happens on the box boundaries, simply because they are of measure zero.) Whence This further implies and we see that S(ρ B ) ≥ S(ρ). But we can actually do quite a bit more, since working in a slightly different direction we have Now using the normalization i p i = 1 we have But note that we can interpret where V is just the (probability weighted) geometric mean volume of the boxes B i . That is, we have Rearranging, we have the rigorous inequality: The RHS is actually independent of ρ * . To verify this note So we are free to pick ρ * to taste. Three particularly useful options are: • If all boxes have the same volume V then automatically we have V = V . In this situation we simply pick ρ * = V −1 , in which case • Alternatively, keep ρ * arbitrary, and simply live with the fact that the best we can say is The central result is always S B > S(ρ, ρ * ) + (some ρ * -dependent normalization to set the zero of entropy).
Subject to these technical quibbles we can then define This is both independent of ρ * and guaranteed non-negative. Physically this represents the "hidden information" encoded in the density-density correlations inside each of the boxes B i , correlations that we are simply agreeing not to look into. Note that box-averaging in this context is an all-or-nothing proposition, there is no tuneable parameter to adjust.

Continuum diffusion followed by box-averaging
Now let us introduce a tuneable parameter t, allowing the continuum probability density ρ(x) to evolve under some diffusion process, (either physical or a gedanken-process), so that ρ(x) → ρ t (x) before box-averaging. Then in terms of the (now time-dependent) boxed probability density we immediately have without any further need of calculation But a more subtle result is this: Here we have used the fact that ρ Bt is box-wise constant as a function of x, and the positivity of relative Shannon entropy. This argument now guarantees that S(ρ Bt ) is monotone non-decreasing as a function of the smearing parameter t. If V is held fixed, (for example if all boxes are the same size so that V = V ), this furthermore impliesṠ Bt ≥ 0. However in general, because we have which in general is nonzero (but independent of ρ * ) without imposing extra conditions. Nevertheless what we do have is already quire powerful: We always have the result that S(ρ Bt ) is monotone nondecreasing, and wheneverV = 0 we even have S Bt monotone non-decreasing as a function of the smearing parameter t. We can then define the "hidden information" as This is both independent of ρ * and guaranteed non-negative. Physically this represents the "hidden information" encoded in the now smearing-parameter-dependent density-density correlations inside each of the boxes B i , correlations that we are simply agreeing not to look into. Note that boxaveraging in this context thus yields a nice explicitly controllable entropy flow as a function of the coarse graining parameter t.

Discretium −→ discretium: Aggregation/averaging forms of coarse graining
Suppose we have a denumerable set of states with probabilities p i for which we define (This could be done for instance, after breaking the universe up into a denumerable set of boxes.) Let us now consider two ways of "aggregating" these probabilities.

Naive aggregation
Take any 2 states, (any two boxes), say a and b, and simply average their probabilities, so that Note that this process leaves the number of states (boxes) fixed; it is inadvisable to merge the boxes, as that tends ultimately to decrease the entropy in a manner that is physically uninteresting. Then set p a =p ± , and p b =p ∓ , (where we can always choose signs so that ≥ 0). We have: But Therefore That is Thus the result of aggregating (averaging) any two states in this manner is always to increase the Shannon entropy: Note that the end point of this aggregation process occurs when all of the p i are equal, so p i = 1/N , and S → ln N , which is its maximum possible value. We can now define the "hidden information" as These are now correlations between the states (boxes) that we lumped together in the averaging process. (This is at this stage an "all-or-nothing" process with no tuneable parameter).

Asymmetric aggregation
A generalization of this notion of aggregation is to define an "asymmetric averaging" Thenp new =p, the average is unaffected, whereas |p a, So the new p a and p b move "closer together".
Then we can again write p a =p ± , and p b =p ∓ , and in addition we have p a,new =p ± 2 , and p b,new =p∓ 2 , with both and 2 positive, and 2 < . But then the same argument as used previously now gives That is Thus the result of aggregating (averaging) any two states in this manner is always to increase the Shannon entropy. The rest of the argument follows as previously; with the same conclusions. (This argument can also be rephrased in terms of concavity of the Shannon entropy as a function of the p i .) We can again define the "hidden information" as These are now correlations between the states (boxes) that we lumped together in the asymmetric averaging process.

Summary: Coarse graining classical Shannon entropy
As we have just seen, it is possible to construct a number of reasonably well-behaved models for classical coarse-graining of the Shannon entropy. Some of these models are "all-or-nothing", without any tuneable smearing parameter, whereas other models depend on a tuneable coarse graining parameter, (that we have chosen to designate t even when it might not represent physical time). The trickiest of these classical constructions is when one coarse-grains a continuum down to a discretium, since the normalizing parameter ρ * , (which is essential to normalizing the continuum Shannon entropy), no longer appears in the discrete Shannon entropy. Which if any of these models is most relevant depends on the particular process under consideration; in all cases these constructions provide a well-defined framework to use, and allow explicit definition and determination of the hidden information.

Coarse graining the quantum von Neumann entropy
For quantum systems described by a normalized density matrix ρ the von Neumann entropy is There is no continuum versus discretium distinction to worry about, and since the density matrix is automatically dimensionless, similarly there is never any need to introduce a "reference density" ρ * .
There are still at least three interesting and fundamental notions of coarse graining to consider: • Maximal mixing.
In section 7 we shall subsequently extend the constructions of this current section by the use of a variant of Hawking's super-scattering operator to be introduced in section 6.

Quantum coarse-graining by maximal mixing
For simplicity let the dimension of the Hilbert space be finite: N . Now let I N denote the N -dimensional identity matrix. Then I N N is a properly normalized density matrix with entropy ln N . In fact this is the maximally mixed density matrix with maximum entropy given the dimensionality of the Hilbert space. Now consider this gedanken-process: Acting on the density matrix ρ, to keep things properly normalized, take: Here one is using the smearing parameter s (which is certainly not physical time) to selectively ignore what would otherwise be physically accessible information; effectively one is "blurring", (that is, coarse-graining) the system by throwing away (ignoring) position information in Hilbert space. (This is strictly a gedanken-process, we know of no physical way of implementing this particular mapping. Nevertheless it is still appropriate to call this a [mathematical] coarse graining.) Now use the fact that the von Neumann entropy is strictly concave in the density matrix whence That is Then we can formally define the hidden information by setting This represents the amount of information that is temporarily lost in the s-dependent blurring process, which in view of the gadanken-nature of the blurring process, is recoverable simply by de-blurring one's vision. In this construction one also has a strict upper bound on the hidden information It is important to note that this partial maximal mixing procedure involves some subtleties in its interpretation. Compared to other more physical coarse-graining procedures, maximal mixing has a more mathematical flavour. Nevertheless it is still appropriate to call it coarse graining due it continues to satisfy the crucial feature of selectively ignoring some physical aspects of the system, which in turn leads to an effective amount of hidden information.

Quantum coarse-graining by partial traces
Many quantum information sources and texts hint at how taking partial traces is an example of "coarse graining", but never quite seem to really get explicit about it. Below we outline a few explicit constructions, some tuneable, some "all-or-nothing".

Non-tuneable partial traces
Suppose the Hilbert space factorizes H AB = H A ⊗ H B , (though the density matrix need not factorize), and define "simultaneous coarse grainings" onto the sub-spaces H A and H B by: Here the notation A:B effectively means this: Slide a (unphysical, purely mathematical) barrier between the sub-spaces A and B so there is no longer any cross-talk between the two sub-spaces. (Notationally it is more common to see notation such as S A;B , but this seems to us to unnecessarily suggest an asymmetry between the two factor sub-spaces.) The idea is that people "living in" A agree not to look into B and vice versa. Then it is relatively easy to prove the quite standard result that: and furthermore to derive the "triangle inequalities": Combining these results we see The hidden information can be defined by This is just the completely usual notion of mutual information. The triangle inequalities give (so the hidden information is always non-negative), and futhermore so the hidden information is always bounded from above. Note the current construction has no tuneable parameter; the coarse-graining is "all-or-nothing", a feature that we shall now show how to evade.

Tuneable partial traces
Let us now consider this model: This smoothly interpolates between the identity process at s = 0 and the factorized subspace process described in the previous subsection at s = 1. (The parameter s is not physical time; it merely characterizes the amount of coarse graining; so this is at this stage a gedanken-process.) Concavity of the von Neumann entropy yields whence By the triangle inequality this implies On the other hand, because partial trace applied to ρ s yields ρ s → ρ A ⊗ ρ B (independent of the value of s as long as it is in the range s ∈ [0, 1]) we have Now consider the entropy flow under evolution of the parameter s: But we can write this as Ṡ (ρ s ) = +tr Now applying the Klein inequality for quantum relative entropies, the positivity of relative von Neumann entropy, we have Thus this tuned entropy is nicely monotonic (non-decreasing) in the tuning parameter s, and is a good candidate for a (explicit and controllable) coarse-graining process. We can then safely define the "hidden information" as There is still a nice lower bound guaranteeing positivity of the hidden information. On the other hand, the best general upper bound seems to be relatively weak

Asymmetric partial trace and maximal mixing
Here is a more brutal asymmetric combination of partial trace and maximal mixing: Here one is not just taking a partial trace over the subsystem B, one is also maximally mixing the subspace B. So this process is asymmetric in the way it treats subsystems A and B. (This is best thought of as a gedanken-process.) To verify that entropy has increased in this "all-or-nothing" coarse graining process we simply note that Where, specifically, it is easy to see that The hidden information can easily be defined by and is guaranteed non-negative.
There is also an upper bound This seems to be the best upper bound one can extract in this context.

Asymmetric partial trace plus maximal mixing, with tuneable parameter
Starting from the previous case, now consider the effect of adding a tuneable parameter: (This is again best thought of as a gedanken-process, rather than a physical coarse graining.) By concavity of the von Neumann entropy so that To establish an upper bound note that under the process envisaged in the previous subsection 5.2.3 (asymmetric partial trace and mixing) we have (now for all s in the appropriate interval) so by the arguments in the previous subsection 5.2.3 we have Checking monotonicity in the parameter s now requires that we investigatė To proceed we adapt the discussion in subsection 5.2.2 (tuneable partial traces). We note we can write the above aṡ Now applying the Klein inequality, the positivity of relative von Neumann entropy, we have Thus this partial trace plus maximal mixing tuneable entropy is nicely monotonic (non-decreasing) in the tuning parameter s, and is another good candidate for a (explicit and controllable) coarse-graining process. Then for the "hidden information" we can safely define We note thereby guaranteeing non-negativity and a nice lower bound. The best general upper bound in this context seems to be

Quantum coarse-graining defined by decoherence
Choose any fixed but arbitrary basis for the Hilbert space, and let P a be the corresponding onedimensional projection operators onto these basis elements. So we have Now use these projection operators to define decoherence (relative to the specified basis). Decoherence is typically viewed as a physical process associated with a semi-classical environment associated with the specified basis, but we could also think of it as a gedanken-process where we are just agreeing to ignore part of the density matrix. (For general background on decoherence see for instance references [31][32][33][34][35][36][37].)

Full decoherence
Define full decoherence as follows: (This preserves the tr(ρ) = 1 condition, and kills off all non-diagonal elements in the density matrix.) When viewed as a gedanken-process one is effectively agreeing to not look at the off-diagonal elements. Now in this particular case concavity does not tell one anything useful: S(ρ D ) = S a P a tr(P a ρ) ≥ a tr(P a ρ)S(P a ) = 0.
One just obtains the trivial bound S(ρ D ) ≥ 0. Considerably more interesting in this context is the relative entropy inequality, (the Klein inequality), which states that for any two density matrices ρ and σ: In particular which can be rearranged to yield − tr(ρ ln ρ D ) ≥ −tr(ρ ln ρ) = S(ρ).
Now ρ D is diagonal, so ln ρ D is diagonal, so in the trace in the LHS above only the diagonal elements of ρ contribute: − tr(ρ ln ρ D ) = −tr(ρ D ln ρ D ) = S(ρ D ).
So overall we see that S(ρ D ) ≥ S(ρ), the decoherence process is entropy non-decreasing, (as it should be). In a completely standard manner we now define the hidden information as where the hidden information is hiding in the off-diagonal correlations that one has agreed to not look at in implementing the decoherence process. The best upper bound seems to be The full decoherence of the off-diagonal terms allow us to completely forget about quantum effects; the coarse grained system is effectively classical, (albeit a classical stochastic system).

Partial (tuneable) decoherence
Now define partial decoherence as follows: (This preserves the tr(ρ) = 1 condition, but now only partially suppresses all non-diagonal elements in the density matrix.) We note that concavity implies By using the Klein inequality tr(ρ Ds ln ρ Ds ) ≤ tr(ρ Ds ln ρ D ) But since in the current situation ρ D is diagonal, (and so ln ρ D is also diagonal), and since all the diagonal elements of ρ Ds are by construction constants independent of s, this implies tr(ρ Ds ln ρ Ds ) ≤ tr(ρ D ln ρ D ) Thus S(ρ D ) ≥ S(ρ Ds ), which has the nice interpretation that partial decoherence involves less entropy than full decoherence. Overall we obtain the chain of inequalities We can do even more, and demonstrate that under partial decoherence the entropy increases monotonically in the control parameter s. We notė S(ρ Ds ) = −tr(ρ Ds ln ρ Ds ) Again appealing to the Klein inequality, we have tr(ρ D ln(ρ Ds )) ≤ tr(ρ D ln(ρ D )) = −S(ρ D ), whencė So again we have a nice calculable monotonically non-decreasing explicit model for coarse graining.
In a completely standard manner we now define the hidden information as where the hidden information is hiding in the off-diagonal correlations that have been partially suppressed because one has agreed to not look at them too carefully in implementing the decoherence process. The best generic upper bound seems to be Thus we have obtained the same upper bound as in the previous subsection, where we completely suppressed the off-diagonal terms.

Summary: Coarse graining quantum von Neumann entropy
In the current section we have built three distinct explicit mathematical/physical models of quantum coarse-graining of the von Neumann entropy. These models were based on maximal mixing; on partial traces (4 sub-varieties); and on decoherence (2 sub-varieties), 7 sub-varieties in total. Some of these models were "all-or-nothing" (untuneable) models; others have an explicit coarse graining parameter s, and for these tuneable models we carefully proved that the entropy was monotonic in the smearing parameter. This already gives one a much more concrete idea of what coarse graining in a quantum context should be taken to be. In the next two sections we shall extend these ideas first by showing that these coarse graining processes can be viewed as specific examples of Hawking's super-scattering operator [21]; and then apply super-scattering to define a notion of diffusion in Hilbert space. 6 Hawking's super-scattering operator In an attempt to develop a non-unitary version of quantum mechanics Hawking introduced the notion of a super-scattering operator $, see reference [21]. At its most basic, a super-scattering operator is taken to be a trace-preserving linear mapping from density matrices to density matrices: ρ → $ρ, with tr(ρ) = 1 implying tr($ρ) = 1. A proper super-scattering operator is one that cannot simply be factorized into a tensor product of unitary scattering matrices S. That is $ = S † ⊗ S, implying ρ → $ρ = S † ρ S. While these ideas were originally mooted in a black hole context, there is nothing intrinsically black hole related in the underlying concept. It is sometimes implicitly demanded that super-scattering operators be entropy non-decreasing S($ρ) ≥ S(ρ), but one could just as easily demand linearity and trace-preservation as the key defining characteristics, and then divide superscattering operators into entropy non-decreasing, entropy non-increasing, and other. This point of view has the advantage that the inverse of a super-scattering operator $ −1 , if it exists, is also a super-scattering operator.
To add to the confusion, depending on the sub-field, people often use different terminology for essentially the same concept, such as "trace-preserving (completely) positive operators", or "quantum maps", or "quantum process", or "quantum channels". Usage (and precise definition) within various sub-fields is (unfortunately) not entirely standardized. We will try to keep things simple with a minimal set of assumptions, and with terminology that is likely to resonate widely with the larger sub-communities of interest.
Perhaps the simplest super-scattering process one can think of is this: Pick a set of positive numbers p i such that i p i = 1 (which you might like to think of as classical probabilities) and a set of unitary matrices U i . Now consider the mapping This is not a unitary transformation, it is instead an "incoherent sum of unitary transformations". But note that the process is linear and trace preserving. Then for this particular super-scattering process we have By concavity of the von Neumann entropy That is, this particular super-scattering operator is entropy non-decreasing, S {p,U } ≥ S. Unfortunately we do not have any nice monotonicity result describing how S {p,U } grows as a function of the p i and the U i , this is again an "all-or-nothing scenario". (Indeed, systematically finding constructions for which we are always guaranteed a nice monotonicity result is the topic of the next section.) As an aside we point out that if one chooses the p i and U i from some classical stochastic ensemble then one should work with (classical) expectation values: A suitable choice of (classical) statistical ensemble for the p i and U i could then be used to build the decoherence operator ρ → ρ D described in subsection 5.3.1 above.
In a rather different direction, many of the coarse graining processes considered in section 5 above can be reinterpreted as super-scattering processes. For instance, in addition to the construction given immediately above, the following are all entropy non-decreasing super-scattering processes: Incoherent sum Oddly enough it is the partial trace process ρ AB → ρ A ⊗ ρ B which is not a super-scattering process. The problem is that while the individual partial traces ρ AB → ρ A and ρ AB → ρ B are both linear functions; the direct-product reassembly process ρ A ⊗ ρ B is not linear. So ρ AB → ρ A ⊗ ρ B is not a linear mapping; it is not a super-scattering process. However, when viewed as a nonlinear process ρ AB → N ρ AB = ρ A ⊗ ρ B , the nonlinear operator N is idempotent, N 2 = N . We will come back to this point later.

Diffusion on Hilbert space
We shall now develop a notion of diffusion on Hilbert space, similar to what we did in physical space when considering continuum Shannon entropies. There are two routes to consider: • Diffusion via super-scattering.

Super-scattering based diffusion
Now consider the class of super-scattering operators $ * that are entropy increasing Certainly the decoherence super-scattering operator $ D falls in this class; so does $ Ds . Ditto for the other super-scattering operators, (based on maximal mixing, partial traces, and the like), considered above: $ M , $ P , $ Ps , and $ {p,U } . In particular such entropy non-decreasing super-scattering operators must leave maximally mixed states maximally mixed: For any one of these entropy non-decreasing $ * operators, we now define ρ t = e −t e t$ * ρ; Then for the von Neumann entropy we havė But the relative entropy inequality (the Klein inequality) is so automatically That is, as long as the super-scattering operator $ * is guaranteed entropy non-decreasing, then so is the Hilbert-space diffusion process ρ → ρ t = e −t e t$ * ρ. Since the entropy is always non-decreasing, the only thing that ρ t can possibly converge on as t → ∞ is the maximally mixed state I N N with the maximal entropy ln N . That is, the compound object is itself a super-scattering process that can be thought of as a diffusion operator on Hilbert space, corresponding to a "Laplacian"-like operator ∆ = $ * − I N ⊗N which has the property tr(∆ρ) = 0, (in analogy with the property ∆ρ(x) d 3 x = 0 holding in the continuum for classical probability distributions). As usual we can define the hidden information as which is guaranteed positive and monotonic in the coarse-graining parameter t. The t parameter may or may not represent physical time -we could view the entire construction as a gedanken-process in which case t would just be a tuning parameter giving explicit control of the extent of coarse graining. The only generic upper bound on the hidden information in this context seems to be I correlations = S(e t∆ ρ) − S(ρ) ≤ ln N − S(ρ).

Partial trace based diffusion
Recall that the partial trace process can be viewed as a nonlinear process ρ AB → N ρ AB = ρ A ⊗ ρ B . The nonlinear operator N is idempotent, N 2 = N . Now consider ρ → ρ t = e −t e tN ρ = e −t {ρ + (e t − 1)N ρ} = e −t ρ + (1 − e −t )N ρ.
Here we have set s = 1 − e −t ∈ [0, 1] as t ∈ [0, ∞). That is, a diffusion-like process based on the nonlinear operator N recovers the process of quantum coarse-graining by tuning the partial traces that we had previously considered, see equation (71). That is, the compound object while it represents a nonlinear process when acting on density matrices, nevertheless has formal similarities to a diffusion process. As usual we can define the hidden information as which is guaranteed positive and monotonic in the coarse-graining parameter t. Again, the t parameter may of may not represent physical time -we could view the entire construction as a gedanken-process in which case t would just be a tuning parameter giving explicit control of the extent of coarse graining. The only generic upper bound on the hidden information in this context seems to be I correlations = S e t{N −I N ⊗N } ρ − S(ρ) ≤ ln N − S(ρ).

Discussion
We see that we can model the coarse-graining procedure, in a quantifiable and controllable manner, by following different methods depending on what aspect of the system one is taking into account. Classically, when considering the Shannon entropy, we have studied coarse-graining allowing the system change (or not) between continuum and discretium character, and also differentiating situations where we introduce a tuneable smearing parameter to track the change from continuum to discretium. We have studied coarse-graining that involves diffusion, density-density correlations in a box, (depending on a smearing parameter or not), and correlation between the states of two boxes, obtaining in every cases a controllable and monotonic flux of entropy.
On the other hand we have considered the quantum von Neumann entropy, coarse-grained by maximal mixing or by partial traces, tuneable or not, asymmetric in the treatment and also combined with maximal mixing. That corresponds to blurring process depending on a smearing parameter, and choice of separate subsystems that "decide" not to look each other. In all cases we have found a positivity of entropy flow and generic upper bound.
We have also studied the coarse-graining induced by decoherence, either partial or complete, allowing us to either remove all off-diagonal terms or control the extent to which we partially suppressed them We have obtained also a consistent definition of the hidden information and an upper bound for it, one that corresponds (as it should) to complete decoherence.
We have introduced an analogy with the Hawking's super-scattering operator that allows us to define a generic class of quantum coarse-grainings. Finally, we have developed a notion of diffusion in Hilbert space, defined by means of super-scattering or partial traces, again finding a consistent and controlled definition of the entropy flow.
It is important to note that all these models give an explicit and calculable idea of how the entropy flow increases and can be controlled when we coarse-graining a system. These models can be useful tools in order to study some physical processes concerning information issues; such as the well-known information puzzle in black hole physics [21][22][23][24][25][26][27][28][29], the ontological status of Bekenstein's horizon entropy [51][52][53][54][55][56], and the very existence of horizons themselves [57][58][59].