Related papers: The distillability problem revisited
A new additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial…
Magic state distillation is an important primitive in fault-tolerant quantum computation. The magic states are pure non-stabilizer states which can be distilled from certain mixed non-stabilizer states via Clifford group operations alone.…
We consider entanglement distillation under the assumption that the input states are allowed to be correlated among each other. We hence replace the usually considered independent and identically-distributed hypothesis by the weaker…
Estimating noise processes is an essential step for practical quantum information processing. Standard estimation tools require consuming valuable quantum resources. Here we ask the question of whether the noise affecting entangled states…
Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the…
The resource theory of quantum coherence is an important topic in quantum information science. Standard coherence distillation and dilution problems have been thoroughly studied. In this paper, we introduce and study the problem of one-shot…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider the problem for states in infinite dimensional Hilbert spaces.…
Quantum network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial…
The use of ancillary quantum systems known as catalysts is known to be able to enhance the capabilities of entanglement transformations under local operations and classical communication. However, the limits of these advantages have not…
We present a numerical method for solving the separability problem of Gaussian quantum states in continuous-variable quantum systems. We show that the separability problem can be cast as an equivalent problem of determining the feasibility…
Via nonlocality distillation, a number of copies of a given nonlocal correlation can be turned into a new correlation displaying a higher degree of nonlocality. Apart from its clear relevance in situations where nonlocality is a resource,…
This paper will address the question of the distillation of entanglement from a finite number of multi-partite mixed states. It is shown that if one can distill a pure entangled state from n copies of a mixed state $\sigma _{ABC...}$ there…
PhD thesis (University of York). The thesis covers in a unified way the material presented in quant-ph/0403073, quant-ph/0502040, quant-ph/0504160, quant-ph/0510035, quant-ph/0512012 and quant-ph/0603283. It includes two large review…
Entanglement distillation is a fundamental task in quantum information processing. It not only extracts entanglement out of corrupted systems but also leads to protecting systems of interest against intervention with environment. In this…
The precise quantification of the ultimate efficiency in manipulating quantum resources lies at the core of quantum information theory. However, purely information-theoretic measures fail to capture the actual computational complexity…
We show that any bipartite quantum state of rank four is distillable, when the partial transpose of the state has at least one negative eigenvalue, i.e., the state is NPT. For this purpose we prove that if the partial transpose of a…
The distillable randomness of a bipartite quantum state is an information-theoretic quantity equal to the largest net rate at which shared randomness can be distilled from the state by means of local operations and classical communication.…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…
The reduction criterion is a well known necessary condition for separable states, and states violating this condition are entangled and also 1-distillable. In this paper we introduce a new set of necessary conditions for separability of…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…