The degree of non-Markovianity of quantum processes has been characterized in several different ways in the recent literature. However, the relationship between the non-Markovian behavior and the flow of information between the system and the environment through an entropic measure has not been yet established. We propose an entanglement-based measure of non-Markovianity by employing the concept of assisted knowledge, where the environment $\mathcal{E}$, acquires information about a system $\mathcal{S}$, by means of its measurement apparatus $\mathcal{A}$. The assisted knowledge, based on the accessible information in terms of von Neumann entropy, monotonically increases in time for all Markovian quantum processes. We demonstrate that the signatures of non-Markovianity can be captured by the nonmonotonic behavior of the assisted knowledge. We explore this scenario for a two-level system undergoing a relaxation process, through an experimental implementation using an optical approach that allows full access to the state of the environment.

We present a direct relation, based upon a monogamic principle, between entanglement of formation (EOF) and quantum discord (QD), showing how they are distributed in an arbitrary tripartite pure system. By extending it to a paradigmatic situation of a bipartite system coupled to an environment, we demonstrate that the EOF and the QD obey conservation relation. By means of this relation we show that in the deterministic quantum computer with one pure qubit the protocol has the ability to rearrange the EOF and the QD, which implies that quantum computation can be understood on a different basis as a coherent dynamics where quantum correlations are distributed between the qubits of the computer. Furthermore, for a tripartite mixed state we show that the balance between distributed EOF and QD results in a stronger version of the strong subadditivity of entropy.

We derive a general relation between the nonanalyticities of the ground state energy and those of a subclass of the multipartite generalized global entanglement (GGE) measure defined by de Oliveira et al. [ Phys. Rev. A 73, 010305(R) (2006)] for many-particle systems. We show that GGE signals both a critical point location and the order of a quantum phase transition (QPT). We also show that GGE allows us to study the relation between multipartite entanglement and QPTs, suggesting that multipartite but not bipartite entanglement is favored at the critical point. Finally, using GGE we were able, at a second-order QPT, to define a diverging entanglement length (EL) in terms of the usual correlation length. We exemplify this with the $XY$ spin-$1/2$ chain and show that the EL is half the correlation length.

We relate the problem of irreversibility of entanglement with the recently defined measures of quantum correlation\char22{}quantum discord and one-way quantum deficit. We show that the entanglement of formation is always strictly larger than the coherent information and the entanglement cost is also larger in most cases. We prove irreversibility of entanglement under local operations and classical communication for a family of entangled states. This family is a generalization of the maximally correlated states for which we also give an analytic expression for the distillable entanglement, the relative entropy of entanglement, the distillable secret key, and the quantum discord.

We demonstrate that the global-entanglement (GE) measure defined by Meyer and Wallach [J. Math. Phys. 43, 4273 (2002)] is maximal at the critical point for the Ising chain in a transverse magnetic field. Our analysis is based on the equivalence of GE to the averaged linear entropy, allowing an understanding of multipartite entanglement (ME) features through a generalization of GE for bipartite blocks of qubits. Moreover, in contrast to GE, the proposed ME measure can distinguish three paradigmatic entangled states: ${\mathrm{GHZ}}_N$ (Greenberger-Horne-Zeilinger), $W_N$, and ${\mathrm{EPR}}^{\otimes N∕2}$. As such the generalized measure can detect a genuine ME and is maximal at the critical point.

Inspired by the Solovay-Kitaev decomposition for approximating unitary operations as a sequence of operations selected from a universal quantum computing gate set, we introduce a method for approximating any single-qubit channel using single-qubit gates and the controlled-not (cnot). Our approach uses the decomposition of the single-qubit channel into a convex combination of “quasiextreme” channels. Previous techniques for simulating general single-qubit channels would require as many as 20 cnot gates, whereas ours only needs one, bringing it within the range of current experiments.