Title: When are quantum states antidistinguishable?

Abstract: Distinguishing quantum states is a central task in quantum computing and has been well studied. In this talk, we discuss a twist on this task where, given a quantum state from a fixed set, we now wish to guess which state it is not. In particular, a set of quantum states is antidistinguishable if you can win this game perfectly. We give optimal bounds on when a set of states must be antidistinguishable as well as optimal bounds on when it cannot be.
This is joint work with Vincent Russo and Nathaniel Johnston.