Related papers: Unambiguous discrimination of mixed states
We generalize Hardy's proof of nonlocality to the case of bipartite mixed statistical operators, and we exhibit a necessary condition which has to be satisfied by any given mixed state $\sigma$ in order that a local and realistic hidden…
Based on the ranks of reduced density matrices, we derive necessary conditions for the separability of multiparticle arbitrary-dimensional mixed states, which are equivalent to sufficient conditions for entanglement. In a similar way we…
The ability to uniquely identify a quantum state is integral to quantum science, but for non-orthogonal states, quantum mechanics precludes deterministic, error-free discrimination. However, using the non-deterministic protocol of…
We review the problem of discriminating entangled states from separable states for bipartite systems. We formally define what entangled states are, present some important criteria to detect entanglement, and show how they can be classified…
We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled…
While the detection of entanglement has been proved already to be quite a difficult task, experimental quantification of entanglement is even more challenging. In this work, we derive an analytical lower bound for the concurrence of a…
We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…
We derive measurable lower bounds on concurrence of arbitrary mixed states, for both bipartite and multipartite cases. First, we construct measurable lower bonds on the purely algebraic bounds of concurrence [F. Mintert et al. (2004), Phys.…
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…
Distinguishing different quantum states is a fundamental task having practical applications for information processing. Despite the efforts devoted so far, however, strategies for optimal discrimination are known only for specific examples.…
We put the pure-state decomposition mathematical property of a mixed state to a physical test. We begin by characterizing all the possible decompositions of a rank-two mixed state by means of the complex overlap between two involved states.…
We consider bipartite quantum state discrimination using positive-partial-transpose measurements and show that minimum-error discrimination by positive-partial-transpose measurements is closely related to entanglement witness. By using the…
Quantum state discrimination is a fundamental concept in quantum information theory, which refers to a class of techniques to identify a specific quantum state through a positive operator-valued measure. In this work, we investigate how…
The problem of unambiguously distinguishing among nonorthogonal but linearly independent quantum states can be solved by mapping the set of nonorthogonal quantum states onto a set of orthogonal ones, which can then be distinguished without…
For the longest time, languages have been competing for their speakers to survive, although this problem has only recently gained rigorous attention from the scholarly community as a means to address the risk of losing speakers for the…
We investigate unambiguous discrimination between given quantum states with a sequential measurement, which is restricted to local measurements and one-way classical communication. If the given states are binary or those each of whose…
We present an inequality for detecting entanglement and distillability of arbitrary dimensional bipartite systems. This inequality provides a sufficient condition of entanglement for bipartite mixed states, and a necessary and sufficient…
We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly…
For two bipartite pure states, we consider the problem of unambiguous identification without classical knowledge on the states. The optimal success probability by means of local operations and classical communication is shown to be less…
A mixed type dual to a nondifferentiable variational problem involving higher order derivative is formulated and duality results are proved under generalized invexity conditions. Special cases are generated from our results.