478 research outputs found

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

    Get PDF
    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

    Irreversibility in asymptotic manipulations of entanglement

    Get PDF
    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

    Entanglement cost of mixed states

    Full text link
    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

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

    Get PDF
    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.

    On a conjecture of Widom

    Get PDF
    We prove a conjecture of H.Widom stated in [W] (math/0108008) about the reality of eigenvalues of certain infinite matrices arising in asymptotic analysis of large Toeplitz determinants. As a byproduct we obtain a new proof of A.Okounkov's formula for the (determinantal) correlation functions of the Schur measures on partitions.Comment: 9 page

    Distributed Entanglement

    Get PDF
    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

    Limits for entanglement measures

    Get PDF
    We show that {\it any} entanglement measure EE suitable for the regime of high number of entangled pairs satisfies ED≤E≤EFE_D\leq E\leq E_F where EDE_D and EFE_F are entanglement of distillation and formation respectively. We also exhibit a general theorem on bounds for distillable entanglement. The results are obtained by use of a very transparent reasoning based on the fundamental principle of entanglement theory saying that entanglement cannot increase under local operations and classical communication.Comment: 4 pages, Revtex, typos correcte

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

    Full text link
    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

    From Skew-Cyclic Codes to Asymmetric Quantum Codes

    Full text link
    We introduce an additive but not F4\mathbb{F}_4-linear map SS from F4n\mathbb{F}_4^{n} to F42n\mathbb{F}_4^{2n} and exhibit some of its interesting structural properties. If CC is a linear [n,k,d]4[n,k,d]_4-code, then S(C)S(C) is an additive (2n,22k,2d)4(2n,2^{2k},2d)_4-code. If CC is an additive cyclic code then S(C)S(C) is an additive quasi-cyclic code of index 22. Moreover, if CC is a module θ\theta-cyclic code, a recently introduced type of code which will be explained below, then S(C)S(C) is equivalent to an additive cyclic code if nn is odd and to an additive quasi-cyclic code of index 22 if nn is even. Given any (n,M,d)4(n,M,d)_4-code CC, the code S(C)S(C) is self-orthogonal under the trace Hermitian inner product. Since the mapping SS 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

    Maximally entangled mixed states of two qubits

    Get PDF
    We consider mixed states of two qubits and show under which global unitary operations their entanglement is maximized. This leads to a class of states that is a generalization of the Bell states. Three measures of entanglement are considered: entanglement of formation, negativity and relative entropy of entanglement. Surprisingly all states that maximize one measure also maximize the others. We will give a complete characterization of these generalized Bell states and prove that these states for fixed eigenvalues are all equivalent under local unitary transformations. We will furthermore characterize all nearly entangled states closest to the maximally mixed state and derive a new lower bound on the volume of separable mixed states
    • …
    corecore