Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA new class of entropic information measures, formal group theory and information geometry
220
0
0.0
(
0
)
Added by
Piergiulio Tempesta
Publication date
2018
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this work, we study generalized entropies and information geometry in a group-theoretical framework. We explore the conditions that ensure the existence of some natural properties and at the same time of a group-theoretical structure for a large class of entropies. In addition, a method for defining new entropies, using previously known ones with some desired group-theoretical properties is proposed. In the second part of this work, the information geometrical counterpart of the previous construction is examined and a general class of divergences are proposed and studied. Finally, a method of constructing new divergences from known ones is discussed; in particular, some results concerning the Riemannian structure associated with the class of divergences under investigation are formulated.
rate research
Read More
We present a mathematical construction of new quantum information measures that generalize the notion of logarithmic negativity. Our approach is based on formal group theory. We shall prove that this family of generalized negativity functions, due their algebraic properties, is suitable for studying entanglement in many-body systems. Under mild hypotheses, the new measures are computable entanglement monotones. Also, they are composable: their evaluation over tensor products can be entirely computed in terms of the evaluations over each factor, by means of a specific group law. In principle, they might be useful to study separability and (in a future perspective) criticality of mixed states, complementing the role of Renyis entanglement entropy in the discrimination of conformal sectors for pure states.
We introduce some multiple integrals that are expected to have the same singularities as the singularities of the $ n$-particle contributions $chi^{(n)}$ to the susceptibility of the square lattice Ising model. We find the Fuchsian linear differential equation satisfied by these multiple integrals for $ n=1, 2, 3, 4$ and only modulo some primes for $ n=5$ and $ 6$, thus providing a large set of (possible) new singularities of the $chi^{(n)}$. We discuss the singularity structure for these multiple integrals by solving the Landau conditions. We find that the singularities of the associated ODEs identify (up to $n= 6$) with the leading pinch Landau singularities. The second remarkable obtained feature is that the singularities of the ODEs associated with the multiple integrals reduce to the singularities of the ODEs associated with a {em finite number of one dimensional integrals}. Among the singularities found, we underline the fact that the quadratic polynomial condition $ 1+3 w +4 w^2 = 0$, that occurs in the linear differential equation of $ chi^{(3)}$, actually corresponds to a remarkable property of selected elliptic curves, namely the occurrence of complex multiplication. The interpretation of complex multiplication for elliptic curves as complex fixed points of the selected generators of the renormalization group, namely isogenies of elliptic curves, is sketched. Most of the other singularities occurring in our multiple integrals are not related to complex multiplication situations, suggesting an interpretation in terms of (motivic) mathematical structures beyond the theory of elliptic curves.
How violently do two quantum operators disagree? Different fields of physics feature different measures of incompatibility: (i) In quantum information theory, entropic uncertainty relations constrain measurement outcomes. (ii) In condensed matter and high-energy physics, the out-of-time-ordered correlator (OTOC) signals scrambling, the spread of information through many-body entanglement. We unite these measures, proving entropic uncertainty relations for scrambling. The entropies are of distributions over weak and strong measurements possible outcomes. The weak measurements ensure that the OTOC quasiprobability (a nonclassical generalization of a probability, which coarse-grains to the OTOC) governs terms in the uncertainty bound. The quasiprobability causes scrambling to strengthen the bound in numerical simulations of a spin chain. This strengthening shows that entropic uncertainty relations can reflect the type of operator disagreement behind scrambling. Generalizing beyond scrambling, we prove entropic uncertainty relations satisfied by commonly performed weak-measurement experiments. We unveil a physical significance of weak values (conditioned expectation values): as governing terms in entropic uncertainty bounds.
One of the primary motivations of the research in the field of computation is to optimize the cost of computation. The major ingredient that a computer needs is the energy to run a process, i.e., the thermodynamic cost. The analysis of the thermodynamic cost of computation is one of the prime focuses of research. It started back since the seminal work of Landauer where it was commented that the computer spends kB T ln2 amount of energy to erase a bit of information (here T is the temperature of the system and kB represents the Boltzmanns constant). The advancement of statistical mechanics has provided us the necessary tool to understand and analyze the thermodynamic cost for the complicated processes that exist in nature, even the computation of modern computers. The advancement of physics has helped us to understand the connection of the statistical mechanics (the thermodynamics cost) with computation. Another important factor that remains a matter of concern in the field of computer science is the error correction of the error that occurs while transmitting the information through a communication channel. Here in this article, we have reviewed the progress of the thermodynamics of computation starting from Landauers principle to the latest model, which simulates the modern complex computation mechanism. After exploring the salient parts of computation in computer science theory and information theory, we have reviewed the thermodynamic cost of computation and error correction. We have also discussed about the alternative computation models that have been proposed with thermodynamically cost-efficient.
The Clebsch-Gordan coefficients of the group SU(2) are shown to satisfy new inequalities. They are obtained using the properties of Shannon and Tsallis entropies. The inequalities associated with the Wigner 3-j symbols are obtained using the relation of Clebsch-Gordan coefficients with probability distributions interpreted either as distributions for composite systems or distributions for noncomposite systems. The new inequalities were found for Hahn polynomials and hypergeometric functions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
