Quantum discord in finite XY chains

We examine the quantum discord between two spins in the exact ground state of finite spin 1/2 arrays with anisotropic XY couplings in a transverse field B. It is shown that in the vicinity of the factorizing field B_s, the discord approaches a common finite non-negligible limit which is independent of the pair separation and the coupling range. An analytic expression of this limit is provided. The discord of a mixture of aligned pairs in two different directions, crucial for the previous results, is analyzed in detail, including the evaluation of coherence effects, relevant in small samples and responsible for a parity splitting at B_s. Exact results for finite chains with first neighbor and full range couplings and their interpretation in terms of such mixtures are provided.Comment: 9 pages, 6 figure

Quantum correlations and least disturbing local measurements

We examine the evaluation of the minimum information loss due to an unread local measurement in mixed states of bipartite systems, for a general entropic form. Such quantity provides a measure of quantum correlations, reducing for pure states to the generalized entanglement entropy, while in the case of mixed states it vanishes just for classically correlated states with respect to the measured system, as the quantum discord. General stationary conditions are provided, together with their explicit form for general two-qubit states. Closed expressions for the minimum information loss as measured by quadratic and cubic entropies are also derived for general states of two-qubit systems. As application, we analyze the case of states with maximally mixed marginals, where a general evaluation is provided, as well as X states and the mixture of two aligned states.Comment: 10 pages, 3 figure

Generalized entropic measures of quantum correlations

We propose a general measure of non-classical correlations for bipartite systems based on generalized entropic functions and majorization properties. Defined as the minimum information loss due to a local measurement, in the case of pure states it reduces to the generalized entanglement entropy, i.e., the generalized entropy of the reduced state. However, in the case of mixed states it can be non-zero in separable states, vanishing just for states diagonal in a general product basis, like the Quantum Discord. Simple quadratic measures of quantum correlations arise as a particular case of the present formalism. The minimum information loss due to a joint local measurement is also discussed. The evaluation of these measures in a few simple relevant cases is as well provided, together with comparison with the corresponding entanglement monotones.Comment: 9 pages, 2 figure

Quantum discord and related measures of quantum correlations in XY chains

We examine the quantum correlations of spin pairs in the ground state of finite XY chains in a transverse field, by evaluating the quantum discord as well as other related entropic measures of quantum correlations. A brief review of the latter, based on generalized entropic forms, is also included. It is shown that parity effects are of crucial importance for describing the behavior of these measures below the critical field. It is also shown that these measures reach full range in the immediate vicinity of the factorizing field, where they become independent of separation and coupling range. Analytical and numerical results for the quantum discord, the geometric discord and other measures in spin chains with nearest neighbor coupling and in fully connected spin arrays are also provided.Comment: accepted in Int. J. Mod. Phys. B, special issue "Classical Vs Quantum correlations in composite systems" edited by L. Amico, S. Bose, V. Korepin and V. Vedra

Toward Defining Literacy

Literacy is a topic much on the public\u27s mind these days. It is one of those subjects on which all laypersons think they are experts. When it comes time, however, to establish measures of illiteracy rates or to set policies, it becomes apparent that we know less than we thought we did. It is small comfort to know that specialists also have their differences

Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources

A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryless sequences can be compressed. We propose a linear complexity compressor based on the extended belief propagation, into which an inertia term is heuristically introduced, and show that it has near-optimal performance for moderate block lengths.Comment: 4 pages, 1 figur