“…When trying to discriminate between two states, it is known that online strategies attain optimal global performance, regardless of whether one considers minimum error discrimination [22] or unambiguous identification [19,21], the two usual approaches to state discrimination. Discriminating more than two hypotheses is a much harder problem: optimal protocols are only known for certain special cases [34,4,35,36,37,38,39], and results on local distinguishability are even more scarce [24,25,40,41,42]. Here we tackle the problem of unambiguous (zero error) identification of three symmetric pure quantum states with constant (but arbitrary) overlap c when n copies are provided, characterizing for which parameter ranges do online schemes attain global performance.…”