Concurrence of Stochastic 1-Qubit Maps
| dc.creator | Hellmund, Meik | |
| dc.creator | Uhlmann, Armin | |
| dc.date | 2008-02-14 | |
| dc.date | 2008-12-04 | |
| dc.date.accessioned | 2026-07-07T12:08:57Z | |
| dc.date.available | 2026-07-07T12:08:57Z | |
| dc.description | Explicit expressions for the concurrence of all positive and trace-preserving ("stochastic") 1-qubit maps are presented. By a new method we find the relevant convex roof pattern. We conclude that two component optimal decompositions always exist. Our results can be transferred to $2 \times n$-quantum systems providing the concurrence for all rank two density operators as well as a lower bound for their entanglement of formation. | |
| dc.description | longer intro, small changes in text | |
| dc.identifier | https://arxiv.org/abs/0802.2092 | |
| dc.identifier | http://arxiv.org/abs/0802.2092 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/209469 | |
| dc.subject | Quantum Physics | |
| dc.title | Concurrence of Stochastic 1-Qubit Maps | |
| dc.type | text |