Manybody localisation implies that eigenvectors are matrixproduct states
Abstract
The phenomenon of manybody localisation received a lot of attention recently, both for its implications in condensedmatter physics of allowing systems to be an insulator even at nonzero temperature as well as in the context of the foundations of quantum statistical mechanics, providing examples of systems showing the absence of thermalisation following outofequilibrium dynamics. In this work, we establish a novel link between dynamical properties – a vanishing group velocity and the absence of transport – with entanglement properties of individual eigenvectors. Using LiebRobinson bounds and filter functions, we prove rigorously under simple assumptions on the spectrum that if a system shows strong dynamical localisation, all of its manybody eigenvectors have clustering correlations. In one dimension this implies directly an entanglement area law, hence the eigenvectors can be approximated by matrixproduct states. We also show this statement for parts of the spectrum, allowing for the existence of a mobility edge above which transport is possible.
The concept of disorder induced localisation has been introduced in the seminal work by Anderson (1) who captured the mechanism responsible for the absence of diffusion of waves in disordered media. This mechanism is specifically well understood in the singleparticle case, where one can show that in the presence of a suitable random potential, all eigenfunctions are exponentially localised (1). In addition to this spectral characterisation of localisation there is a notion of dynamical localisation, which requires that the transition amplitudes between lattice sites decay exponentially (2); (3).
Naturally, there is a great interest in extending these results to the manybody setting (4); (5). In the case of integrable systems that can be mapped to free fermions, such as the XY chain, results on single particle localisation can be applied directly (6); (7). A far more intricate situation arises in interacting systems. Such manybody localisation (8); (9) has received an enormous attention recently. In terms of condensedmatter physics, this phenomenon allows for systems to remain an insulator even at nonzero temperature (10), in principle even at infinite temperature (11). In the foundations of statistical mechanics, such manybody localised systems provide examples of systems that fail to thermalise. When pushed out of equilibrium, signatures of the initial condition will locally be measurable even after long times, in contradiction to what one might expect from quantum statistical mechanics (12); (4); (13).
Despite great efforts to approach the phenomenon of manybody localisation, many aspects are not fully understood and a comprehensive definition is still lacking. Similar to the case of singleparticle Anderson localisation, there are two complementary approaches to capture the phenomenon. On the one hand probes involving realtime dynamics (14); (15) have been discussed, showing excitations “getting stuck”, or seeing suitable signatures in densityautocorrelation functions (16), leading to a dynamic reading of the phenomena. On the other hand, statistics of energy levels has been considered as an indicator (11) as well as a lack of entanglement in the eigenbasis (5) and a resulting violation of the eigenstate thermalisation hypothesis (ETH) (17); (18); (19). In such a static description of manybody localisation, it has for example been suggested to define manybody localised states as those states that can be prepared from product states or Slater determinants of singleparticle localised states with a finitedepth local unitary transformation. Accordingly, a manybody localised phase is one where most eigenvectors have this property (5).
It seems fair to say that the connection between these static and dynamic readings is still unclear. In this work, we make a substantial first step in relating these approaches: If the evolution of an interacting manybody system is dynamically localising (and its spectrum is generic), then all eigenvectors have exponentially clustering correlations in general and, in one dimension, satisfy an area law and can be efficiently written as a matrixproduct state (MPS) (20); (21) with a low bond dimension. Our proof uses advanced mathematical tools developed for the analysis of interacting manybody systems, such as energy filtering and does not rely on the precise details of the considered model. We show that short ranged correlations in individual energy eigenstates necessarily follow from absence of transport in localising models.
Setting. For simplicity, we will state all our results in the language of spin systems of local dimension , but they can equivalently be derived for fermionic systems. We consider local Hamiltonians , where each interaction term is supported on finitely many sites of a lattice with vertices, and the physical system associated with each site is finitedimensional. We make for most of the argument no assumptions concerning the dimensionality or the kind of the lattice. In what follows, we will consider observables and that are supported on finitely many sites on the lattice. There is a natural distance in the lattice related to the length of the shortest path of interactions connecting the supports of and . For convenience of notation, we will choose from here on, which does not restrict generality (22); (23); (24); (25); (26). For any local Hamiltonian of this sort there is an upper bound to the largest group velocity, referred to as LiebRobinson velocity. There are several possible formulations of such a bound (see Appendix .1 for a detailed discussion). One convenient and common way is to compare the timeevolution of a local observable under the full Hamiltonian with its timeevolution under a truncated Hamiltonian that only includes interactions contained in a region of distance no more than from the support of . The LiebRobinson theorem then states that there exists a constant and a velocity such that
(1) 
is true for all times . Such a bound limits the speed of information propagation: In any such lattice with shortranged interactions, all interactions are causal in this sense. A related, but in the case of weaker estimate is given by the following commutator bound (see also .1)
(2) 
Our results will rely on two generic and natural assumptions on the spectrum of the Hamiltonian. To state those, we express the manybody Hamiltonian in its eigenbasis as
(3) 

Nondegenerate energies (AI): The energies of the full Hamiltonian are assumed to be nondegenerate. The smallest gap between these energies will be called .

Locally independent gaps (AII): The energies of reduced Hamiltonians and which include all interactions inside rectangular regions and respectively, are assumed to be nondegenerate when viewing them as operators on their respective truncated Hilbert spaces and . The smallest gap will be called . Moreover, the gaps of these Hamiltonians need to be locally independent with respect to each other, in the sense that
(4) where and label the eigenvalues of and respectively. The smallest difference of these gaps will be called .

Nonsymmetric gaps (AIII): For all eigenvalues of the full Hamiltonian the spectrum is nowhere symmetric in the sense that
(5)
Similar reasonable conditions have already been considered in the context of equilibration of closed systems and are assumed to hold when a small amount of random noise is added to a local Hamiltonian (27). Especially in the context of localising systems which are typically based on large random terms in the Hamiltonian, these assumptions are very natural indeed. Our assumptions are, however, considerably weaker than assuming fully nondegenerate energy gaps (27). Another quantity that will be important later on is the number of states up to energy given by .
Notions of dynamical localisation. One defining feature of localisation is that the system shows no transport of information. There are many possible readings of this. The first and strongest is that the time evolution can be truncated to a finite region independent of time and is directly connected to an absence of thermalisation in the model (see Appendix .7).
Definition 1 (Strong dynamical localisation).
A Hamiltonian exhibits strong dynamical localisation iff its time evolution satisfies
(6) 
for a suitable , where is an arbitrary local observable, a constant independent of the system size and denotes a Hamiltonian which includes all interactions contained in a region of distance no more than from the support of .
This corresponds to setting the LiebRobinson velocity to zero in Eq. (2). A potential candidate for such a model is given by free fermionic systems with strong local disorder. There, it is known that transport is strongly suppressed and it is still being debated to what extent they satisfy zero velocity LiebRobinson bounds (6); (28). This definition also implies that information cannot be transported by encoding it locally in the chosen Hamiltonian (see Appendix .1 for details). As such, it does not allow for a growth of entanglement entropies logarithmically in time, a phenomenon that has been numerically observed in spin chains with random onsite noise (15).
In a second step, we relax our dynamical assumption to a weaker variant of zero velocity LiebRobinson bounds and restricting it to a suitable subspace. It is natural to assume that the transport properties of an electronic system are closely connected to the energy available in the system. In fact, often the notion of a mobility edge is introduced (29); (28). The intuition is that for all energies below this mobility edge, transport is fully blocked, while it might be possible for higher energies. The following definition is making this precise and allows for transport in highly excited sectors.
Definition 2 (Mobility edge).
A Hamiltonian is said to have a mobility edge at energy iff its time evolution satisfies for all times ,
(7) 
with constants independent of . That is, all transport is suppressed for states supported only on the lowenergy sector below energy .
This definition relies on a rather weak version of zero velocity LiebRobinson bounds (see Appendix .1). While our results will be applicable to all eigenvectors below the mobility edge, they can naturally also be used to capture the ground state, yielding an extension of the previous results (28).
In experiments, a natural setting for dynamical localisation is one where a system is excited locally. For example, in case of a ground state vector , this corresponds to the action of a unitary operator with local support where denotes its generator. In this setting, suppression of transport means that the excitation cannot be measured at far distances, even for long times, in the sense that
(8) 
for arbitrary observables . Here are constants independent of the time and the system size. If excitations are stuck in the above sense in an entire certain energy subspace, then this implies our zero velocity LiebRobinson estimate in Eq. (7), thus relating Definition 2 to a quantity that can in principle be experimentally measured (see Appendix .1).
Main result. We are now in the position to state our main result. It provides a clear link between the dynamical properties of the system and the static correlation behaviour of the corresponding eigenvectors and can be applied to quantum systems of arbitrary dimension. In one dimension it directly implies an area law and the existence of an approximating MPS (see Corollary 2).
Theorem 1 (Clustering of correlations of eigenvectors).
The dynamical properties of a local Hamiltonian imply clustering correlations of its eigenvectors in the following way.

If the Hamiltonian shows strong dynamical localisation and its spectrum fulfils assumptions AI and AII then all its eigenvectors have exponentially clustering correlations, i.e.
(9) 
If the Hamiltonian has a mobility edge at energy and its spectrum fulfils assumptions AI and AIII, then all eigenvectors up to that energy cluster exponentially, in the sense that for all
(10) where is the number of eigenstates up to energy and can be chosen arbitrarily to optimise the bound.
Part b of the theorem only requires LiebRobinson bounds on a subspace and is thus perfectly compatible with a growth of entanglement entropies following quenches. In fact, for the proof it is sufficient to assume Eq. (2) on the level of the individual eigenstates (see Appendix .5). It further allows to freely choose an energy cutoff that serves as an artificial energy gap and can be used to optimise the bound. For typical local models, we expect the density of states to behave like a Gaussian, an intuition that can be numerically tested for small systems (see Fig. 1), and rigorously proved in a weak sense (30). In this case the number of states will behave like a loworder polynomial in the system size at energies close to the ground state energy . Thus fixing a independent of the system size will lead to a prefactor that scales like a loworder polynomial in the system size where the order of the polynomial will increase as one moves to higher energies. In the bulk of the spectrum, the number of states will grow exponentially with the system size, thus rendering our bounds useless as one moves to high energies. Interestingly, this feature of stronger correlations, associated with a larger entanglement in the state, at higher energies seems to be shared by the Heisenberg chain with random onsite magnetic field (see Fig. 1). Naturally our theorem can also be applied to the ground state where it extends previous results (28) and for example for the case of an almost degenerate ground state will be a substantial improvement. Naturally, our results can also be applied to the highly excited states at the other end of the spectrum.
The proofs for both parts of the theorem rely on energy filtering techniques (29); (31). This is a versatile tool especially in the study of perturbation bounds for Hamiltonian systems and allows to partly diagonalise a local observable in the energy eigenbasis, while still keeping some locality structure. Energy filtering of an observable is defined as
(11) 
Here is a filter function that can be used to interpolate between locality of the resulting observable and the strength of the offdiagonal elements in the Hamiltonian basis (see Appendix .2).
In order to show part a of the theorem, we will make use of energy filterings of the local observables and with respect to the full Hamiltonian as well as with respect to local restrictions and . Those restrictions contain the support of the corresponding observable and are chosen as large as possible, while still satisfying . The main idea is to choose a suitable (Gaussian) filter function and use the gap assumptions AI and AII to show that the joint filter of the observables decouples into energy filters for and separately. Then strong dynamical localisation can be used to make these filters local. Finally choosing the width of the energy filter small enough, and in particular exponentially small in the system size, allows to conclude the proof (for details see Appendix .4). The proof of part b of the theorem is more involved, relies on a highpass filter (see Appendix .2) and is contained in Appendix .5.
Implications on area laws and matrixproduct states. In one dimension, the conclusions of our main theorem about the correlation behaviour of eigenvectors can be turned into a statement about their entanglement structure. It has been noted before that manybody localisation should be connected to eigenvectors fulfilling an area law (see Conjecture 1 in Ref. (5)), and eigenvectors being well approximated by matrixproduct state vectors of the form
(12) 
where is the bond dimension and for all . Our main theorem allows to rigorously prove this connection.
Corollary 2 (Area laws and matrixproduct states).
An eigenvector of a localising Hamiltonian can be approximated by an MPS with fidelity , where the bond dimension for a sufficiently large system is given as follows.

If the Hamiltonian shows strong dynamical localisation and its spectrum fulfils assumptions AI and AII, then the statement holds for all eigenvectors and, for some constant , the approximation has a bond dimension
(13) 
If the Hamiltonian has a mobility edge at energy , and its spectrum fulfils assumptions AI and AIII, then the statement holds for all eigenvectors below this energy and the bond dimension is given by
(14) for any fixed which enters in the precise form of the polynomial.
The proof is a direct consequence of our main theorem together with the fact that exponential clustering in one dimension implies strong bounds on entanglement entropies between any bipartite cut of the chain (32). Using techniques from (33) this leads to an efficient MPS approximation with the above bounds on the bond dimension (see Appendix .6 for details).
Summary & outlook. Despite considerable progress in understanding the effects of random potentials on quantum manybody systems, a precise definition of the phenomenon of manybody localisation continues to be elusive. Attempts to capture the phenomenology can largely be classified into two complementary approaches: One of them puts characteristic properties of the eigenfunctions into the focus of attention and asks for a lack of entanglement and a violation of the ETH. The other one takes the suppression of transport as the basis, which seems closer to being experimentally testable.
In this work, we have established a clear link between these two approaches, by showing that dynamical localisation implies that eigenvectors cluster exponentially. This result, together with the existence of an approximating MPS description in one dimension, reminds of the definition of Ref. (5), that defines manybody localisation in terms of matrixproduct state approximations of eigenstates. In contrast, in our work, this feature is shown to follow from an absence of transport. For future research, it would be interesting to further explore this connection and to address the converse direction, namely to establish that an arealaw for all eigenvectors implies that excitations cannot travel through the system.
A different approach towards approximating the individual eigenstates with a matrixproduct state could potentially be provided by constructing meaningful local constants of motion that give a set of local quantum numbers (34). It seems likely that tools using energy filtering will again prove useful in this context, a prospect that we briefly discuss in Appendix .3. On the practical side, further numerical effort will be needed to understand the behaviour of individual models and to fully understand the transport properties for different energy scales. Our work could well provide a first stepping stone for further endeavours in this direction: Showing that eigenstates are well approximated by matrixproduct states implies that not only ground states, but in fact also excited states can efficiently be described in terms of tensor networks. Our result as such does not yet provide an efficient algorithm to find the respective matrixproduct states: this reminds of the situation of the existence of lattice models for which the ground states are exact matrixproduct states, but it amounts to a computationally difficult problem to find them (35). Still, this appears to be a major step in the direction of formulating such numerical prescriptions of describing the lowenergy sector of manybody localizing systems. Eventually, the leading vision in any of these endeavours appears to be a rigorous proof of manybody localisation in the spirit of the original results by Anderson. For this, creating a unifying framework and linking the possible definitions seems a key first step.
Acknowledgements. We thank H. Wilming, C. Gogolin, T. Osborne, F. Verstraete and F. Pollmann for insightful discussions and M. Goihl for collaboration on the numerical code. We would like to thank the EU (SIQS, AQuS, RAQUEL, COST), the ERC (TAQ), the BMBF, and the Studenstiftung des deutschen Volkes for support. VBS is supported by the Swiss National Science Foundation through the National Centre of Competence in Research ‘Quantum Science and Technology’ and by an ETH postdoctoral fellowship. WB is supported by EPSRC.
Appendix
.1 LiebRobinson bounds
Zero velocity LiebRobinson bounds are a way to rigorously capture the suppression of transport. Since there is no comprehensive discussion of such bounds available in the literature, we precisely discuss the relationships between different possible definitions here. Depending on the precise notion of transport adapted, the formulation of the bound slightly varies. The strongest variant is that information cannot be send through a system by locally changing the Hamiltonian and is rigorously captured by our definition of strong dynamical localisation (Def. 1).
Definition 3.
(Zero velocity LiebRobinson bounds: Truncated Hamiltonian) A Hamiltonian is said to satisfy zero velocity LiebRobinson bounds in the truncated Hamiltonian formulation, iff
(15) 
Here is an observable in the Heisenberg picture, the truncated Hamiltonian including all Hamiltonian terms within a distance of the support of and are constants.
As in this whole work, was chosen for convenience. In constrast to the definition in the main text (Def. 1), we here include a factor , which is stronger than what we need for our proof of Theorem 1 part a. However, since it seems reasonable to assume that the left hand side of Eq. (15) initially grows continuously with and this way of stating the bound allows for an easier connection between the different LiebRobinson versions, we decided to include the factor here. Indeed the strongest standard LiebRobinson bounds in nearestneighbour systems also include such a factor (36).
Another possible and very physical way of stating that a system has no transport, is to say that excitations cannot spread through the system. Mathematically, this can be captured by demanding that the action of a local unitary cannot be detected far away, even for long times.
Definition 4.
(Zero velocity LiebRobinson bounds: Excitations) A Hamiltonian is said to satisfy zero velocity LiebRobinson bounds in the excitation formulation, iff for any locally supported Hermitian operator with
(16)  
(17) 
where is an arbitrary state vector and are independent constants.
Most useful for mathematical manipulations is often the formulation in terms of a commutator (29); (28).
Definition 5.
(Zero velocity LiebRobinson bounds: Commutator) A Hamiltonian is said to satisfy zero velocity LiebRobinson bounds in the commutator formulation, iff
(18) 
with suitable independent constants .
Interestingly, these definitions can be closely related, similar to the case of standard LiebRobinson bounds (37); (38); (39).
Lemma 6.
Proof.
Going from the truncation formulation (Def. 3) to the commutator formulation (Def. 5) is straightforward
(21)  
(22)  
(23) 
where has been chosen to make the second commutator zero.
To show the one implication of the second part of the lemma, going from Def. 4 to Def. 5, we rewrite the excitations formulation as
(24) 
where is the commutator and denotes multiple applications of it. Dividing by and taking the limit yields
(25) 
Since the bound holds for arbitrary Hermitian observables and arbitrary state vectors , this concludes the proof.
Using common tools (39), one can also use the commutator formulation to arrive at estimates similar to the truncation formulation, but with a slightly weaker prefactor, depending on the time .
.2 Energy filtering
A tool that plays an important role in this work is energyfiltering with respect to a suitable filter function. Energyfiltering of a local observable is defined as follows
(30) 
Here is a socalled filter function, usually taken as a function. Here, refers to time evolution under the full Hamiltonian , but we will later also consider filters with respect to truncated Hamiltonians, such as . Energyfiltering allows to alter the matrix elements of a local observable in the eigenbasis of a Hamiltonian, while still keeping some form of locality (29). We will work with two types of filter functions. Gaussian filter functions in particular provide a good compromise between locality in Fourier space and decay behaviour in real time and hence allow us to pick out narrow energy windows, while still preserving the approximate locality of the observable.
Definition & Lemma 7 (Gaussian filters).
A Gaussian filter is defined as
(31) 
where defines the sharpness of the filter. The matrix elements in the eigenbasis of the Hamiltonian fulfil
(32) 
For strongly localizing systems (Def. 1), local observables filtered with a Gaussian filter still remain approximately local in the sense that
(33) 
For systems with a mobility edge (Def. 2), we have
(34) 
Proof.
The Gaussian suppression of offdiagonal elements readily follows from the definition
(35)  
(36) 
and the fact that the Fourier transform of a Gaussian is again a Gaussian. Assuming strong dynamical localisation, deriving locality is straightforward,
(37)  
(38)  
(39) 
where have used that the Gaussian filter is normalised. The case with a mobility edge can be shown in the same way. ∎
Another important filter is the highpass filter, which blocks large negative energy differences.
Definition & Lemma 8 (Highpass filters).
A highpass filter is defined by
(40) 
Here describes the sharpness of the filter. The matrix elements can be bounded for any by
(41) 
Local observables remain approximately local under a highpass filter, in the sense that
(42) 
Proof.
Calculating the offdiagonal elements of such a highpass filter relies on the subsequent bound on the error function of a Gaussian random variable proven in Ref. (22), stated here as Lemma 9. Making use of the identity proven in Ref. (22)
(43)  
(44) 
the bounds for the matrix elements of follow from Lemma 9. The locality statement can be shown by splitting the integral into three parts (28) and using our assumption of dynamical localisation
(45) 
Here estimating the first term used the factor included in the definition of a mobility edge (Def. 2). Choosing
(46) 
concludes the proof. ∎
Lemma 9 (HastingsKoma).
Let , then for all with
(47) 
and for all with
(48) 
For later use, we give the Gaussian and high pass filters of sharpness the symbols and , respectively. In case the local observable is filtered with the full system Hamiltonian, we will often omit the . It is an interesting insight that the locality structure of a Gaussian filter is independent of its sharpness for dynamically localising systems, while it still depends on for a highpass filter. It is precisely this property of Gaussian filters that will allow us to prove part b of Theorem 1.
.3 Local constants of motion
In this appendix, we briefly comment on how local constants of motion could be constructed using energy filtering. A natural candidate for local constants of motion are the energyfiltered versions of the local Hamiltonian terms
(49) 
Since they act nontrivially on most eigenstates, it is clear that they are retained by the energyfiltering without being averaged to zero and thus indeed provide useful quantum numbers. What is more, strong dynamical localisation implies that they will stay approximately local. This construction can be optimised by choosing suitable filter functions, allowing for an interpolation between the locality of the observables and making them completely constant in time. In particular, taking the timeaverage is equivalent to choosing a constant filter function (34) leading to quantities that are completely preserved in time, while they will usually not be strictly local anymore. Naturally, this approach is not limited to taking the local Hamiltonian terms and in principle any local observable that does not vanish after applying the energy filter will provide useful quantum numbers. Specifically, polynomials of the local Hamiltonian terms can equally well be used. In systems with a mobility edge, where not all transport is suppressed, this construction is still possible, but the resulting constants of motion might no longer be approximately local.
Since local constants of motion by definition commute with the Hamiltonian, their local eigenbasis is compatible with the global energy eigenbasis of the Hamiltonian. Thus, they could be used to directly construct local states in a matrixproduct state form, as long as enough constants of motion exist in order to use their quantum numbers to divide the full Hilbert space into suitable small fractions.
.4 Proof of Theorem 1 part a
In this appendix, we will formulate the details of the proof of Theorem 1 part a, which shows that strong dynamical localisation implies exponential clustering of all eigenvectors. For this, we will rely on the following lemma.
Lemma 10 (Decoupled energy filtering).
Under the assumption of locally independent gaps (AII), energyfiltering of two observables can be factorized into local energy filters
(50) 
with . Here and are chosen to include all Hamiltonian terms within distance of the support of and respectively (See Fig. 3).
Proof.
To show that instead of applying an energy filter to , we can also apply it to the observables individually, we need to use that the eigenvalues of are disconnected on the two regions and we can thus label them by two different quantum numbers . We hence get
(51)  
(52) 
We will use the triangle inequality and proceed to show that both energy filters give only the diagonal entires up to a small error. Starting with the first term gives the following estimate,
(53)  
(54)  
(55)  
(56) 
where we assumed locally independent gaps (AII). The second term yields the following estimate,
(57)  
(58)  
(59)  
(60) 
Here, is a diagonal matrix with entries for and 0 otherwise and we assumed locally independent gaps (AII). ∎
Finally let us briefly comment that the local independence of
gaps can alternatively be ensured by demanding that the joint Hamiltonian
supported on two disjoint rectangular regions has nondegenerate energies, since these
energies are all possible sums of the local energies .
Proof of Theorem 1 We are now in the position to prove part a of our main theorem.
Theorem 1 (Clustering of correlations of eigenvectors).
The dynamical properties of a local Hamiltonian imply clustering correlations of its eigenvectors in the following way.

If the Hamiltonian shows strong dynamical localisation and its spectrum fulfils assumptions AI and AII then all its eigenvectors have exponentially clustering correlations
(61)
Proof.
The proof uses the local Hamiltonians and (See Fig. 3) and the following estimates
(62)  
(63)  
(64)  
(65)  
(66) 
In each step, an error term of the form with to will be introduced. The constant appearing in the main theorem will simply be the sum of them. Constants directly follow from the properties of the applied Gaussian filter (Def. 7) and constant is derived in Lemma 10
(67)  
(68)  
(69)  
(70)  
(71) 
The constants and can be chosen arbitrarily small, by picking a sharp enough filter function, meaning a sufficiently small . In particular, we can choose , which yields
(72) 
Choosing concludes the proof. ∎
.5 Proof of Theorem 1 part b
In this appendix, we will show the second part of Theorem 1 based on a mobility edge. For convenience, we start by repeating Definition 2 of a mobility gap.
Definition 2 (Mobility edge).
A Hamiltonian is said to have a mobility edge at energy iff its time evolution satisfies for all times ,
(73) 
where is a independent constant. That is, all transport is suppressed for states supported only on the lowenergy sector below energy .
The first step for our proof will be to show that each eigenvectors only contributes to the correlation function by a term that is exponentially suppressed with the distance of the two observables. For this, we need the localisation assumption only for the eigenvector .
Lemma 11.
Let be local observables and a weakly localised eigenvector of , i.e. satisfying
(74) 
Then the contribution of any eigenvector , to the correlation function will be exponentially suppressed, in the sense that
(75) 
Proof.
The proof of this lemma again uses an energy filter with a Gaussian filter function (Def. 7) and works with , which can always be achieved by using a shifted observable . For this proof the filter function will be multiplied by a complex factor such that its Fourier transform approximately suppresses all transitions except the one from level to level . In a mild variant of the above filter function, we define and the corresponding filter as
(76)  
(77)  
(78) 
With this energy filter, we can proceed to prove the lemma.
(79)  
(80)  
(81)  
(82) 
Here, refers to the smallest gap and is the smallest degeneracy of the gaps for fixed as defined in the main text in AI and AIII and in the last step we used weak dynamical localisation of the eigenvector . We can now conclude the proof by choosing small enough such that
(83) 
which means that we pick a filter function that is narrow enough in Fourier space. Setting it would even be enough to choose
(84) 
independently of . ∎
With this, we are ready to prove part b of Theorem 1.
Theorem 1 (Clustering of correlations of eigenvectors).
The dynamical properties of a local Hamiltonian imply clustering correlations of its eigenvectors in the following way.

If the Hamiltonian has a mobility edge at energy and its spectrum fulfils assumptions AI and AIII, then all eigenvectors up to that energy cluster exponentially
(85) where is the number of states at energy and is a constant that can be chosen arbitrarily to optimise the bound.
Proof of Theorem 1 part b.
The proof runs along and builds upon the lines of thought of both Ref. (22) and of (28), and generalises both. The basic idea is again to start from the correlation function and to transform it into an expression depending on the commutator. For this, we fix a constant and define
(86) 
to be the projector onto the subspace of energies smaller than and write for . Decomposing the identity with respect to and and using a highpass filter for a suitable (Def. 8), we separate the correlator into terms
(87)  
(88)  
(89)  
(90) 
Lets consider the first term on the righthand side of Eq. (87) that contains and expand the projector in the eigenbasis of , which gives
(91)  
(92)  
(93) 
Here, we have used that all matrix elements decrease under a highpass filter (Lemma 8) for all . As before, we will set w.l.o.g. and then proceed by bounding all the terms in the sum individually. Using Lemma 11 yields
(94) 
where simply is the number of eigenvectors contained in . The other term in Eq. (87) containing can be bounded analogously, yielding
(95) 
The terms containing in Eq. (87) are bounded using the explicit form of the matrix elements of a highpass filter (Lemma 8), which delivers
(96) 
where is a diagonal matrix whose entries are bounded by . A simple norm estimate concludes the estimation of this term
(97) 
The other term containing can be estimated in the same way
(98) 
The commutator term in Eq. (87) is bounded by using locality of a highpass filter (Lemma 8). We are still free to choose a value for in the highpass filter. Taking
(99) 
gives
(100)  
(101) 
This concludes the proof. ∎
.6 Proof of Corollary 2
It follows from the above results that in the case of 1D systems, the corresponding eigenstates satisfy an area law for a suitable entanglement entropy, which in turn implies that they can be well approximated by a matrixproduct state of a low bond dimension. We will bound the bond dimension by using Theorem 1 from Ref. (32). For convenience, we repeat our Corollary 2 from the main text.
Corollary 2 (Area laws and matrixproduct states).
An eigenvector of a localising Hamiltonian can be written as an MPS with fidelity , where the bond dimension for a sufficiently large system size is given as follows.

If the Hamiltonian shows strong dynamical localisation and its spectrum fulfils assumptions AI and AII, then the statement holds for all eigenvectors and the approximation has a bond dimension
(102) for some constant .

If the Hamiltonian has a mobility edge at energy , and its spectrum fulfils assumptions AI and AIII, then the statement holds for all eigenvectors below this energy and the bond dimension is given by
(103) for any fixed which enters in the precise form of the polynomial.
Proof.
As a first step of the proof, we reformulate our clustering of correlation results (Theorem 1) in terms of a correlation length according to Ref. (32). For this, we need a decay of the correlator of the form and start by rewriting our bound as
(104)  
(105) 
Next we split the decaying term and use one part to get rid of the constant prefactor and the other to preserve an exponential decay with a correlation length . This yields
(106)  
(107) 
where . Following Ref. (32), we will use the exponential clustering to obtain a description of the eigenvector in terms of MPS (see also Fig. 4). This is based on the so called smooth max entropy, which is defined as
(108) 
with
(109) 
being a ball around (see Appendix A of Ref. (32) for details). Here denotes the trace distance. According to Theorem 1 in Ref. (32), we can obtain an upper bound for the smooth max entropy for any bipartite cut, as long as the system size is larger than with a constant . Picking the approximation parameter in the smooth max entropy to be , then Ref. (32) provides a bound of the form
(110) 
for all with constants . In the following, we will make Corollary 3 in Ref. (32) explicit, by deriving concrete bounds on the bond dimension of the matrixproduct state chosen to approximate . Naturally, the first step for this is to express as a matrixproduct state vector with, a priori, exponentially large bond dimension (Fig. 4). For simplicity, we restrict the proof here to a linear system with open boundary conditions, but it can equivalently be reformulated for a periodic system on a ring (32). The bond dimension of the matrixproduct state will be bounded by truncating at each cut explicitly. For this, we start at one end of the chain and look at each cut separately. In each step, we apply a singular value decomposition (see also Fig. 4). Since we are truncating spectral values in each step, the positive operators will no longer be normalised to unit trace and are states only up to normalisation. This results in a reduction on the left side of the cut of , with being unitary and diagonal. The goal is now to truncate the diagonal matrix to a fixed bond dimension while creating only a small discarded weight (40). Following Lemma 14 in Appendix B of Ref. (32), for any , we can choose the bond dimension as
(111) 
and create a discarded weight
(112) 
where are the eigenvalues of or equivalently of . Each time we create discarded weight, the fidelity with our original pure quantum state potentially is reduced by the discarded weight (33), upper bounded by . The truncation will result in a subnormalised state. Renormalising will, however, only increase the fidelity, allowing us to obtain a normalised MPS approximation. Thus, in total, the fidelity of our MPS approximation with bond dimension is bounded by
(113) 
where is the size of the linear 1D system. For a fixed global error