For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform parallel ones. Additionally, we show that general strategies that involve indefinite causal order are also advantageous for this task. However, for the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are indeed optimal, even when compared to general strategies. We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of unitary channels. Finally, we derive an ultimate upper bound for the maximal probability of successfully discriminating any set of unitary channels with any number of copies, for the most general strategies that are suitable for channel discrimination. Our bound is tight since it is saturated by sets of unitary channels forming a group k-design.
Download