We define the entropic bounds, i.e. minimal uncertainty for pairs of unitary testers in distinguishing between unitary transformations not unlike the well known entropic bounds for observables. We show that in the case of specific sets of testers which pairwise saturate the trivial zero bound, the testers are all equivalent in the sense their statistics are the same. On the other hand, when maximal bounds are saturated by such sets of testers, the unitary operators would form unitary bases which are mutually unbiased. This resembles very much the role of mutually unbiased bases in maximising the entropic bounds for observables. We show how such a bound can be useful in certain quantum cryptographic protocols. (C) 2019 Elsevier Inc. All rights reserved.
展开▼
