An upper bound on the success probability of minimum-error discrimination

Lü, Xin

doi:10.1016/j.physleta.2022.128461

Cited by 2 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, it can be effectively solved by semidefinite programming [28]. There are efforts of relating quantum state discrimination to other fundamental concepts, such as complementarity [29][30][31][32], quantum coherence [33][34][35][36] and the no-signaling principle [37][38][39][40][41], where numerical solutions are inadequate. Consequently, various bounds of the success probability for discrimination have been derived [30,[40][41][42][43][44][45][46][47][48][49], which are helpful in specific theoretical considerations.…”

Section: Introductionmentioning

confidence: 99%

Discrimination of geometrically uniform states and the no-signaling principle

Lü

2023

Phys. Scr.

Self Cite

View full text Add to dashboard Cite

The link between quantum state discrimination and the no-signaling principle is applied to discriminating geometrically uniform states. Specifically, the original discrimination problem is converted to constructing the complementary matrix with predetermined off-diagonal entries. Two such constructions are given explicitly, and therefore three upper bounds on the success probability are derived. Those upper bounds are then employed to estimate the robustness of coherence, where we establish a larger class of states with equal robustness of coherence and l_1 -norm of coherence, and provide the exact answer of the robustness of coherence for any states that are diagonalized by Hadamard matrices.

show abstract