1976
DOI: 10.1016/0034-4877(76)90060-4
|View full text |Cite
|
Sign up to set email alerts
|

The “transition probability” in the state space of a ∗-algebra

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

10
865
0
4

Year Published

1985
1985
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 1,348 publications
(895 citation statements)
references
References 1 publication
10
865
0
4
Order By: Relevance
“…Furthermore, it follows from Uhlmann's theorem [Uhl76] that this decoupling is also sufficient. More formally, choose K and L such that log K − log L = H ε 2 /13 max (A|B) ρ + 4 log(1/ε) + 2 log 13,…”
Section: One-shot State Mergingmentioning
confidence: 93%
See 3 more Smart Citations
“…Furthermore, it follows from Uhlmann's theorem [Uhl76] that this decoupling is also sufficient. More formally, choose K and L such that log K − log L = H ε 2 /13 max (A|B) ρ + 4 log(1/ε) + 2 log 13,…”
Section: One-shot State Mergingmentioning
confidence: 93%
“…We have by Uhlmann's theorem [Uhl76] that ω AB andσ B E R are related by an isometry V A→E R , and hence by the invariance of the smooth conditional max-entropy under local isometries (Lemma 2.6) that…”
Section: Proof Of the Converse Theorem (Theorem 41) Let ρ Ae R Be Amentioning
confidence: 99%
See 2 more Smart Citations
“…(We note that one may prefer normalized density operators; see the first remark at the end of the paper. )According to Uhlmann [6,7], for any A, B ∈ C + 1 (H) we define the fidelity of A and B byThis is in fact the square-root of the transition probability introduced by Uhlmann in [5] for density operators which later Jozsa called fidelity and showed its use in quantum information theory [3]. The reason that Uhlmann defined the fidelity in the way above is that after taking square-root the function F behaves significantly better.…”
mentioning
confidence: 99%