Polynomial approximations to continuous functions and stochastic compositions

This paper presents a stochastic approach to theorems concerning the behavior of iterations of the Bernstein operator $B_n$ taking a continuous function $f \in C[0,1]$ to a degree-$n$ polynomial when the number of iterations $k$ tends to infinity and $n$ is kept fixed or when $n$ tends to infinity as well. In the first instance, the underlying stochastic process is the so-called Wright-Fisher model, whereas, in the second instance, the underlying stochastic process is the Wright-Fisher diffusion. Both processes are probably the most basic ones in mathematical genetics. By using Markov chain theory and stochastic compositions, we explain probabilistically a theorem due to Kelisky and Rivlin, and by using stochastic calculus we compute a formula for the application of $B_n$ a number of times $k=k(n)$ to a polynomial $f$ when $k(n)/n$ tends to a constant.Comment: 21 pages, 5 figure

Exponential Decay of Correlations Implies Area Law

We prove that a finite correlation length, i.e. exponential decay of correlations, implies an area law for the entanglement entropy of quantum states defined on a line. The entropy bound is exponential in the correlation length of the state, thus reproducing as a particular case Hastings proof of an area law for groundstates of 1D gapped Hamiltonians. As a consequence, we show that 1D quantum states with exponential decay of correlations have an efficient classical approximate description as a matrix product state of polynomial bond dimension, thus giving an equivalence between injective matrix product states and states with a finite correlation length. The result can be seen as a rigorous justification, in one dimension, of the intuition that states with exponential decay of correlations, usually associated with non-critical phases of matter, are simple to describe. It also has implications for quantum computing: It shows that unless a pure state quantum computation involves states with long-range correlations, decaying at most algebraically with the distance, it can be efficiently simulated classically. The proof relies on several previous tools from quantum information theory - including entanglement distillation protocols achieving the hashing bound, properties of single-shot smooth entropies, and the quantum substate theorem - and also on some newly developed ones. In particular we derive a new bound on correlations established by local random measurements, and we give a generalization to the max-entropy of a result of Hastings concerning the saturation of mutual information in multiparticle systems. The proof can also be interpreted as providing a limitation on the phenomenon of data hiding in quantum states.Comment: 35 pages, 6 figures; v2 minor corrections; v3 published versio

An area law for entanglement from exponential decay of correlations

Area laws for entanglement in quantum many-body systems give useful information about their low-temperature behaviour and are tightly connected to the possibility of good numerical simulations. An intuition from quantum many-body physics suggests that an area law should hold whenever there is exponential decay of correlations in the system, a property found, for instance, in non-critical phases of matter. However, the existence of quantum data-hiding state--that is, states having very small correlations, yet a volume scaling of entanglement--was believed to be a serious obstruction to such an implication. Here we prove that notwithstanding the phenomenon of data hiding, one-dimensional quantum many-body states satisfying exponential decay of correlations always fulfil an area law. To obtain this result we combine several recent advances in quantum information theory, thus showing the usefulness of the field for addressing problems in other areas of physics.Comment: 8 pages, 3 figures. Short version of arXiv:1206.2947 Nature Physics (2013