pith. sign in

arxiv: 1703.02945 · v1 · pith:XSI5GM46new · submitted 2017-03-08 · 🪐 quant-ph

Parametric separation of symmetric pure quantum states

classification 🪐 quant-ph
keywords quantumdiscriminationseparationstatestateshighermaximum-confidenceminimum-error
0
0 comments X
read the original abstract

Quantum state separation is a probabilistic map that transforms a given set of pure states into another set of more distinguishable ones. Here we investigate such a map acting onto uniparametric families of symmetric linearly dependent or independent quantum states. We obtained analytical solutions for the success probability of the maps--which is shown to be optimal--as well as explicit constructions in terms of positive operator valued measures. Our results can be used for state discrimination strategies interpolating continuously between minimum-error and unambiguous (or maximum-confidence) discrimination, which, in turn, have many applications in quantum information protocols. As an example, we show that quantum teleportation through a nonmaximally entangled quantum channel can be accomplished with higher probability than the one provided by unambiguous (or maximum-confidence) discrimination and with higher fidelity than the one achievable by minimum-error discrimination. Finally, an optical network is proposed for implementing parametric state separation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.