Increasing subsequences and the hard-to-soft edge transition in matrix ensembles

Our interest is in the cumulative probabilities Pr(L(t) \le l) for the maximum length of increasing subsequences in Poissonized ensembles of random permutations, random fixed point free involutions and reversed random fixed point free involutions. It is shown that these probabilities are equal to the hard edge gap probability for matrix ensembles with unitary, orthogonal and symplectic symmetry respectively. The gap probabilities can be written as a sum over correlations for certain determinantal point processes. From these expressions a proof can be given that the limiting form of Pr(L(t) \le l) in the three cases is equal to the soft edge gap probability for matrix ensembles with unitary, orthogonal and symplectic symmetry respectively, thereby reclaiming theorems due to Baik-Deift-Johansson and Baik-Rains.Comment: LaTeX, 19 page

Symmetrized models of last passage percolation and non-intersecting lattice paths

It has been shown that the last passage time in certain symmetrized models of directed percolation can be written in terms of averages over random matrices from the classical groups $U(l)$, $Sp(2l)$ and $O(l)$. We present a theory of such results based on non-intersecting lattice paths, and integration techniques familiar from the theory of random matrices. Detailed derivations of probabilities relating to two further symmetrizations are also given.Comment: 21 pages, 5 figure

Entanglement cost of mixed states

We compute the entanglement cost of several families of bipartite mixed states, including arbitrary mixtures of two Bell states. This is achieved by developing a technique that allows us to ascertain the additivity of the entanglement of formation for any state supported on specific subspaces. As a side result, the proof of the irreversibility in asymptotic local manipulations of entanglement is extended to two-qubit systems.Comment: 4 pages, no figures, (v4) new results, including a new method to determine E_c for more general mixed states, presentation changed significantl

Irreversibility in asymptotic manipulations of entanglement

We show that the process of entanglement distillation is irreversible by showing that the entanglement cost of a bound entangled state is finite. Such irreversibility remains even if extra pure entanglement is loaned to assist the distillation process.Comment: RevTex, 3 pages, no figures Result on indistillability of PPT states under pure entanglement catalytic LOCC adde

Reversible transformations from pure to mixed states, and the unique measure of information

Transformations from pure to mixed states are usually associated with information loss and irreversibility. Here, a protocol is demonstrated allowing one to make these transformations reversible. The pure states are diluted with a random noise source. Using this protocol one can study optimal transformations between states, and from this derive the unique measure of information. This is compared to irreversible transformations where one does not have access to noise. The ideas presented here shed some light on attempts to understand entanglement manipulations and the inevitable irreversibility encountered there where one finds that mixed states can contain "bound entanglement".Comment: 10 pages, no figures, revtex4, table added, to appear in Phys. Rev.

Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions

We investigate the average bipartite entanglement, over all possible divisions of a multipartite system, as a useful measure of multipartite entanglement. We expose a connection between such measures and quantum-error-correcting codes by deriving a formula relating the weight distribution of the code to the average entanglement of encoded states. Multipartite entangling power of quantum evolutions is also investigated.Comment: 13 pages, 1 figur

Distributed Entanglement

Consider three qubits A, B, and C which may be entangled with each other. We show that there is a trade-off between A's entanglement with B and its entanglement with C. This relation is expressed in terms of a measure of entanglement called the "tangle," which is related to the entanglement of formation. Specifically, we show that the tangle between A and B, plus the tangle between A and C, cannot be greater than the tangle between A and the pair BC. This inequality is as strong as it could be, in the sense that for any values of the tangles satisfying the corresponding equality, one can find a quantum state consistent with those values. Further exploration of this result leads to a definition of the "three-way tangle" of the system, which is invariant under permutations of the qubits.Comment: 13 pages LaTeX; references added, derivation of Eq. (11) simplifie

Methodological Challenges in Studies Examining the Effects of Breakfast on Cognitive Performance and Appetite in Children and Adolescents

Breakfast is purported to confer a number of benefits on diet quality, health, appetite regulation, and cognitive performance. However, new evidence has challenged the long-held belief that breakfast is the most important meal of the day. This review aims to provide a comprehensive discussion of the key methodological challenges and considerations in studies assessing the effect of breakfast on cognitive performance and appetite control, along with recommendations for future research. This review focuses on the myriad challenges involved in studying children and adolescents specifically. Key methodological challenges and considerations include study design and location, sampling and sample section, choice of objective cognitive tests, choice of objective and subjective appetite measures, merits of providing a fixed breakfast compared with ad libitum, assessment and definition of habitual breakfast consumption, transparency of treatment condition, difficulty of isolating the direct effects of breakfast consumption, untangling acute and chronic effects, and influence of confounding variables. These methodological challenges have hampered a clear substantiation of the potential positive effects of breakfast on cognition and appetite control and contributed to the debate questioning the notion that breakfast is the most important meal of the day

{\bf τ\tau-Function Evaluation of Gap Probabilities in Orthogonal and Symplectic Matrix Ensembles}

It has recently been emphasized that all known exact evaluations of gap probabilities for classical unitary matrix ensembles are in fact $\tau$-functions for certain Painlev\'e systems. We show that all exact evaluations of gap probabilities for classical orthogonal matrix ensembles, either known or derivable from the existing literature, are likewise $\tau$-functions for certain Painlev\'e systems. In the case of symplectic matrix ensembles all exact evaluations, either known or derivable from the existing literature, are identified as the mean of two $\tau$-functions, both of which correspond to Hamiltonians satisfying the same differential equation, differing only in the boundary condition. Furthermore the product of these two $\tau$-functions gives the gap probability in the corresponding unitary symmetry case, while one of those $\tau$-functions is the gap probability in the corresponding orthogonal symmetry case.Comment: AMS-Late

From Skew-Cyclic Codes to Asymmetric Quantum Codes

We introduce an additive but not $\mathbb{F}_4$-linear map $S$ from $\mathbb{F}_4^{n}$ to $\mathbb{F}_4^{2n}$ and exhibit some of its interesting structural properties. If $C$ is a linear $[n,k,d]_4$-code, then $S(C)$ is an additive $(2n,2^{2k},2d)_4$-code. If $C$ is an additive cyclic code then $S(C)$ is an additive quasi-cyclic code of index $2$. Moreover, if $C$ is a module $\theta$-cyclic code, a recently introduced type of code which will be explained below, then $S(C)$ is equivalent to an additive cyclic code if $n$ is odd and to an additive quasi-cyclic code of index $2$ if $n$ is even. Given any $(n,M,d)_4$-code $C$, the code $S(C)$ is self-orthogonal under the trace Hermitian inner product. Since the mapping $S$ preserves nestedness, it can be used as a tool in constructing additive asymmetric quantum codes.Comment: 16 pages, 3 tables, submitted to Advances in Mathematics of Communication