Manuscript Oai265-B@2 · Oai265-B-v2.tex · section · 94b6f42f

Explicit qubit Choi confidence region

A tighter channel-confidence-region route › Explicit qubit Choi confidence region · lines 1549–1564

Oai265-B@2#eq:tight

If validated bounds give $h_{L} \leq d_{⋄} (E, id) \leq h_{U}$ , then

max {0, h_{L} - η - b} \leq e (E_{⋆}) \leq min {1, h_{U} + η + b} .

Minimizing or maximizing the linear Bell overlap over $C$ is a semidefinite optimization. Maximizing a convex diamond-distance function over this confidence region is not thereby one simple SDP.

Displayed formulas in this passage

Oai265-B@2#eq:tight · line 1553
$max {0, h_{L} - η - b} \leq e (E_{⋆}) \leq min {1, h_{U} + η + b} .$

Nearby in this section

section: Explicit qubit Choi confidence region
proposition: Proposition: Computable confidence radius