Quantum Entanglement of Moving Bodies

We study the properties of quantum information and quantum entanglement in moving frames. We show that the entanglement between the spins and the momenta of two particles can be interchanged under a Lorentz transformation, so that a pair of particles that is entangled in spin but not momentum in one reference frame, may, in another frame, be entangled in momentum at the expense of spin-entanglement. Similarly, entanglement between momenta may be transferred to spin under a Lorentz transformation. While spin and momentum entanglement each is not Lorentz invariant, the joint entanglement of the wave function is.Comment: 4 pages, 2 figures. An error was corrected in the numerical data and hence the discussion of the data was changed. Also, references were added. Another example was added to the pape

Entropy and Entanglement in Quantum Ground States

We consider the relationship between correlations and entanglement in gapped quantum systems, with application to matrix product state representations. We prove that there exist gapped one-dimensional local Hamiltonians such that the entropy is exponentially large in the correlation length, and we present strong evidence supporting a conjecture that there exist such systems with arbitrarily large entropy. However, we then show that, under an assumption on the density of states which is believed to be satisfied by many physical systems such as the fractional quantum Hall effect, that an efficient matrix product state representation of the ground state exists in any dimension. Finally, we comment on the implications for numerical simulation.Comment: 7 pages, no figure

Group entropies, correlation laws and zeta functions

The notion of group entropy is proposed. It enables to unify and generalize many different definitions of entropy known in the literature, as those of Boltzmann-Gibbs, Tsallis, Abe and Kaniadakis. Other new entropic functionals are presented, related to nontrivial correlation laws characterizing universality classes of systems out of equilibrium, when the dynamics is weakly chaotic. The associated thermostatistics are discussed. The mathematical structure underlying our construction is that of formal group theory, which provides the general structure of the correlations among particles and dictates the associated entropic functionals. As an example of application, the role of group entropies in information theory is illustrated and generalizations of the Kullback-Leibler divergence are proposed. A new connection between statistical mechanics and zeta functions is established. In particular, Tsallis entropy is related to the classical Riemann zeta function.Comment: to appear in Physical Review

Information capacity of genetic regulatory elements

Changes in a cell's external or internal conditions are usually reflected in the concentrations of the relevant transcription factors. These proteins in turn modulate the expression levels of the genes under their control and sometimes need to perform non-trivial computations that integrate several inputs and affect multiple genes. At the same time, the activities of the regulated genes would fluctuate even if the inputs were held fixed, as a consequence of the intrinsic noise in the system, and such noise must fundamentally limit the reliability of any genetic computation. Here we use information theory to formalize the notion of information transmission in simple genetic regulatory elements in the presence of physically realistic noise sources. The dependence of this "channel capacity" on noise parameters, cooperativity and cost of making signaling molecules is explored systematically. We find that, at least in principle, capacities higher than one bit should be achievable and that consequently genetic regulation is not limited the use of binary, or "on-off", components.Comment: 17 pages, 9 figure

The classical capacity of quantum thermal noise channels to within 1.45 bits

We find a tight upper bound for the classical capacity of quantum thermal noise channels that is within $1/\ln 2$ bits of Holevo's lower bound. This lower bound is achievable using unentangled, classical signal states, namely displaced coherent states. Thus, we find that while quantum tricks might offer benefits, when it comes to classical communication they can only help a bit.Comment: Two pages plus a bi

Bias Analysis in Entropy Estimation

We consider the problem of finite sample corrections for entropy estimation. New estimates of the Shannon entropy are proposed and their systematic error (the bias) is computed analytically. We find that our results cover correction formulas of current entropy estimates recently discussed in literature. The trade-off between bias reduction and the increase of the corresponding statistical error is analyzed.Comment: 5 pages, 3 figure

Word Length Perturbations in Certain Symmetric Presentations of Dihedral Groups

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities called $\lambda_{1}$ and $\lambda_{2}$ have been defined that allow for a precise measure of how stable a group is under certain types of small perturbations in the generating expressions for the elements of the group. These quantities provide a means to measure differences among all possible paths in a Cayley graph for a group, establish a group theoretic analog for the notion of stability in nonlinear dynamical systems, and play an important role in the application of groups to computational genomics. In this paper, we further expose the fundamental properties of $\lambda_{1}$ and $\lambda_{2}$ by establishing their bounds when the underlying group is a dihedral group. An essential step in our approach is to completely characterize so-called symmetric presentations of the dihedral groups, providing insight into the manner in which $\lambda_{1}$ and $\lambda_{2}$ interact with finite group presentations. This is of interest independent of the study of the quantities $\lambda_{1},\; \lambda_{2}$. Finally, we discuss several conjectures and open questions for future consideration

Determinants of a transcriptionally competent environment at the GM-CSF promoter

Granulocyte macrophage-colony stimulating factor (GM-CSF) is produced by T cells, but not B cells, in response to immune signals. GM-CSF gene activation in response to T-cell stimulation requires remodelling of chromatin associated with the gene promoter, and these changes do not occur in B cells. While the CpG methylation status of the murine GM-CSF promoter shows no correlation with the ability of the gene to respond to activation, we find that the basal chromatin environment of the gene promoter influences its ability to respond to immune signals. In unstimulated T cells but not B cells, the GM-CSF promoter is selectively marked by enrichment of histone acetylation, and association of the chromatin-remodelling protein BRG1. BRG1 is removed from the promoter upon activation concomitant with histone depletion and BRG1 is required for efficient chromatin remodelling and transcription. Increasing histone acetylation at the promoter in T cells is paralleled by increased BRG1 recruitment, resulting in more rapid chromatin remodelling, and an associated increase in GM-CSF mRNA levels. Furthermore, increasing histone acetylation in B cells removes the block in chromatin remodelling and transcriptional activation of the GM-CSF gene. These data are consistent with a model in which histone hyperacetylation and BRG1 enrichment at the GM-CSF promoter, generate a chromatin environment competent to respond to immune signals resulting in gene activation

Quantum Capacity Approaching Codes for the Detected-Jump Channel

The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit-flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel

Optimizing information flow in small genetic networks. I

In order to survive, reproduce and (in multicellular organisms) differentiate, cells must control the concentrations of the myriad different proteins that are encoded in the genome. The precision of this control is limited by the inevitable randomness of individual molecular events. Here we explore how cells can maximize their control power in the presence of these physical limits; formally, we solve the theoretical problem of maximizing the information transferred from inputs to outputs when the number of available molecules is held fixed. We start with the simplest version of the problem, in which a single transcription factor protein controls the readout of one or more genes by binding to DNA. We further simplify by assuming that this regulatory network operates in steady state, that the noise is small relative to the available dynamic range, and that the target genes do not interact. Even in this simple limit, we find a surprisingly rich set of optimal solutions. Importantly, for each locally optimal regulatory network, all parameters are determined once the physical constraints on the number of available molecules are specified. Although we are solving an over--simplified version of the problem facing real cells, we see parallels between the structure of these optimal solutions and the behavior of actual genetic regulatory networks. Subsequent papers will discuss more complete versions of the problem