  In this note, I define error exponents and strong converse exponents for the
tasks of distinguishability distillation and dilution. These are counterparts
to the one-shot distillable distinguishability and the one-shot
distinguishability cost, as previously defined in the resource theory of
asymmetric distinguishability. I show that they can be evaluated by
semi-definite programming, establish a number of their properties, bound them
using Renyi relative entropies, and relate them to each other.
