Related papers: R\'enyi entropy and pattern matching for run-lengt…
Tight bounds on the block entropy of patterns of sequences generated by independent and identically distributed (i.i.d.) sources are derived. A pattern of a sequence is a sequence of integer indices with each index representing the order of…
We investigated long range correlations in two literary texts, Moby Dick by H. Melville and Grimm's tales. The analysis is based on the calculation of entropy like quantities as the mutual information for pairs of letters and the entropy,…
We study the Renyi entanglement entropies of two disjoint intervals in XY chains. We exploit the exact solution of the model in terms of free Majorana fermions and we show how to construct the reduced density matrix in the spin variables by…
We explore the R\'enyi entanglement entropies of a one-dimensional (line) subsystem of length $L$ embedded in two-dimensional $L\times L$ square lattice for quantum spin models whose ground-state breaks a continuous symmetry in the…
The Longest Common Subsequence (LCS) Problem asks for the longest sequence of (non-contiguous) matches between two given strings of characters. Using extensive Monte Carlo simulations, we find a finite size scaling law of the form E(L)/N =C…
We compute the total amount of entanglement produced between momentum modes at late times after a smooth mass quench in free bosonic and fermionic quantum field theories. The entanglement and R\'enyi entropies are obtained in closed form as…
A repetition free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols each one chosen…
We present a new algorithm for calculating the Renyi entanglement entropy of interacting fermions using the continuous-time quantum Monte Carlo method. The algorithm only samples interaction correction of the entanglement entropy, which by…
We review connections between the cumulant generating function of full counting statistics of particle number and the R\'enyi entanglement entropy. We calculate these quantities based on the fermionic and bosonic path-integral defined on…
One of the most influential results in neural network theory is the universal approximation theorem [1, 2, 3] which states that continuous functions can be approximated to within arbitrary accuracy by single-hidden-layer feedforward neural…
The coefficient of the logarithmic term in the entropy on even spheres is re-computed by the local technique of integrating the finite temperature energy density up to the horizon on static d--dimensional de Sitter space and thence finding…
In the face of mounting numerical evidence, Metlitski and Grover [arXiv:1112.5166] have given compelling analytical arguments that systems with spontaneous broken continuous symmetry contain a sub-leading contribution to the entanglement…
We compute R\'enyi entropies for the statistics of a noisy simultaneous observation of two complementary observables in two-dimensional quantum systems. The relative amount of uncertainty between two states depends on the uncertainty…
Numerous entropy-type characteristics (functionals) generalizing R\'enyi entropy are widely used in mathematical statistics, physics, information theory, and signal processing for characterizing uncertainty in probability distributions and…
We study the entanglement between soft and hard particles produced in generic scattering processes in QED. The reduced density matrix for the hard particles, obtained via tracing over the entire spectrum of soft photons, is shown to have a…
The R\'enyi entropy is a generalization of the Shannon entropy and is widely used in mathematical statistics and applied sciences for quantifying the uncertainty in a probability distribution. We consider estimation of the quadratic R\'enyi…
Monitored quantum circuits can exhibit an entanglement transition as a function of the rate of measurements, stemming from the competition between scrambling unitary dynamics and disentangling projective measurements. We study how…
We study how the Shannon entropy of sequences produced by an information source converges to the source's entropy rate. We synthesize several phenomenological approaches to applying information theoretic measures of randomness and memory to…
We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…
The R\'enyi-Shannon entropy associated to critical quantum spins chain with central charge $c=1$ is shown to have a phase transition at some value $n_c$ of the R\'enyi parameter $n$ which depends on the Luttinger parameter (or…