Related papers: Hard Core entropy: lower bounds
In this paper, we improve the known estimates for the invariance entropy of a nonlinear control system. For sets of complete approximate controllability we derive an upper bound in terms of Lyapunov exponents and for uniformly hyperbolic…
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…
A lower bound is derived for the boundary entropy s = ln g of a 1+1d quantum critical system with boundary, under the conditions that the bulk conformal central charge c is >=1 and the most relevant bulk scaling dimension is >(c-1)/12. This…
Bounds on the entropy of patterns of sequences generated by independently identically distributed (i.i.d.) sources are derived. A pattern is a sequence of indices that contains all consecutive integer indices in increasing order of first…
We use the structure of conditionally independent states to analyze the stability of topological entanglement entropy. For the ground state of quantum double or Levin-Wen model, we obtain a bound on the first order perturbation of…
We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a measure that we call range-partition entropy, which unifies and…
The notion of topological entropy can be conceptualized in terms of the number of forward trajectories that are distinguishable at resolution $\varepsilon$ within $T$ time units. It can then be formally defined as a limit of a limit…
Two types of information entropy are studied for the quantum states of a model for the matter core inside a black hole geometry. A detailed description is first given of the quantum mechanical picture leading to a spectrum of bound states…
In this work the topological order at finite temperature in two-dimensional color code is studied. The topological entropy is used to measure the behavior of the topological order. Topological order in color code arises from the colored…
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory…
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasi-stationary. We use the quasi-stationary property in order to…
A model-independent lower bound on the entropy S of the multiparticle system produced in high energy collisions, provided by the Renyi entropy H_2, is shown to be very effective. Estimates show that the ratio H_2/S remains close to one half…
We study a quantity called discrete layered entropy, which approximates the Shannon entropy within a logarithmic gap. Compared to the Shannon entropy, the discrete layered entropy is piecewise linear, approximates the expected length of the…
We prove a lower bound on the relative entropy between two finite-dimensional states in terms of their entropy difference and the dimension of the underlying space. The inequality is tight in the sense that equality can be attained for any…
Combining two existing rigorous computational methods, for verifying hyperbolicity (due to Arai) and for computing topological entropy bounds (due to Day et al.), we prove lower bounds on topological entropy for 43 hyperbolic plateaus of…
Two general upper bounds on the topological entropy of nonlinear time-varying systems are established: one using the matrix measure of the system Jacobian, the other using the largest real part of the eigenvalues of the Jacobian matrix with…
In this paper, we obtain fundamental $\mathcal{L}_{p}$ bounds in sequential prediction and recursive algorithms via an entropic analysis. Both classes of problems are examined by investigating the underlying entropic relationships of the…
We construct a system of nonequilibrium entropy limiters for the lattice Boltzmann methods (LBM). These limiters erase spurious oscillations without blurring of shocks, and do not affect smooth solutions. In general, they do the same work…
The tilings of lozenges in 2 dimensions and of rhomboedra in 3 dimensions are studied when they are constrained by fixed boundary conditions. We establish a link between those conditions and free or periodic boundary ones: the entropy is…