Related papers: Universal quantum state merging
We investigate the irreversibility of entanglement distillation for a symmetric d-1 parameter family of mixed bipartite quantum states acting on Hilbert spaces of arbitrary dimension d x d. We prove that in this family the entanglement cost…
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…
We present an alternative approach to the derivation of benchmarks for quantum channels, such as memory or teleportation channels. Using the concept of effective entanglement and the verification thereof, a testing procedure is derived…
In the paper, we show that when a quantum state can be decomposed as a convex combination of locally orthogonal mixed states, its entanglement can be decomposed into the entanglement of these mixed states without losing them. The obtained…
Most states in the Hilbert space are maximally entangled. This fact has proven useful to investigate - among other things - the foundations of statistical mechanics. Unfortunately, most states in the Hilbert space of a quantum many body…
The ``entanglement of formation'' of a mixed state of a bipartite quantum system can be defined in terms of the number of pure singlets needed to create the state with no further transfer of quantum information. We find an exact formula for…
It is often argued that entanglement is at the root of the speedup for quantum compared to classical computation, and that one needs a sufficient amount of entanglement for this speedup to be manifest. In measurement-based quantum computing…
We find that a bipartite quantum state is entangled if and only if it is quantum coherent with respect to complete bases of states in the corresponding system that are distinguishable under local quantum operations and classical…
The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…
Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this work, we develop computable and faithful lower bounds on the entanglement cost…
The bipartite entanglement of a pure quantum state is known to be characterized by its Schmidt decomposition. In particular the state is maximally entangled when all the Schmidt coefficients are equal. We point out a convenient method which…
We question the role of entanglement in masking quantum information contained in a set of mixed quantum states. We first show that a masker that can mask any two single-qubit pure states, can mask the entire set of mixed states comprising…
The emerging quantum technologies rely on our ability to establish and control quantum systems in nonclassical states, exhibiting entanglement and quantum coherence. It is thus crucial to understand how entanglement and coherence can be…
We study entanglement distillation and dilution of states and channels in the single-shot regime. With the help of a recently introduced conversion distance, we provide compact closed-form expressions for the dilution and distillation of…
Multipartite entanglement determines the strength and range of interactions in many-body quantum systems. Yet, it is hard to evaluate it, due to the complex structures of quantum states. Here, we introduce a generic method to quantify the k…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement is explored for bi-partite and multi-partite pure and mixed states.…
As quantum technologies advance, the ability to generate increasingly large quantum states has experienced rapid development. In this context, the verification and estimation of large entangled systems represents one of the main challenges…
We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states…
The cluster state, the highly entangled state that is the central resource for one-way quantum computing, can be efficiently generated in a variety of physical implementations via global nearest-neighbor interactions. In practice, a…
In quantum information theory, it is widely believed that entanglement concentration for bipartite pure states is asymptotically reversible. In order to examine this, we give a precise formulation of the problem, and show a trade-off…