On the generalization of quantum state comparison

We investigate the unambiguous comparison of quantum states in a scenario that is more general than the one that was originally suggested by Barnett et al. First, we find the optimal solution for the comparison of two states taken from a set of two pure states with arbitrary a priori probabilities. We show that the optimal coherent measurement is always superior to the optimal incoherent measurement. Second, we develop a strategy for the comparison of two states from a set of N pure states, and find an optimal solution for some parameter range when N=3. In both cases we use the reduction method for the corresponding problem of mixed state discrimination, as introduced by Raynal et al., which reduces the problem to the discrimination of two pure states only for N=2. Finally, we provide a necessary and sufficient condition for unambiguous comparison of mixed states to be possible.Comment: 8 pages, 4 figures, Proposition 1 corrected, appendix adde

Easy implementable algorithm for the geometric measure of entanglement

We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a singular value decomposition, no further numerical techniques are needed. To provide examples, the algorithm was applied to the isotropic states of 3 qubits and the 3-qubit XX model with external magnetic field.Comment: 9 pages, 3 figure

Distributed super dense coding over noisy channels

We study multipartite super dense coding in the presence of a covariant noisy channel. We investigate the case of many senders and one receiver, considering both unitary and non-unitary encoding. We study the scenarios where the senders apply local encoding or global encoding. We show that, up to some pre-processing on the original state, the senders cannot do better encoding than local, unitary encoding. We then introduce general Pauli channels as a significant example of covariant maps. Considering Pauli channels, we provide examples for which the super dense coding capacity is explicitly determined

Physical Purification of Quantum States

We introduce the concept of a physical process that purifies a mixed quantum state, taken from a set of states, and investigate the conditions under which such a purification map exists. Here, a purification of a mixed quantum state is a pure state in a higher-dimensional Hilbert space, the reduced density matrix of which is identical to the original state. We characterize all sets of mixed quantum states, for which perfect purification is possible. Surprisingly, some sets of two non-commuting states are among them. Furthermore, we investigate the possibility of performing an imperfect purification.Comment: 5 pages, 1 figure; published versio