  Nonstabilizerness, also known as magic, is a crucial resource for quantum
computation. The growth in complexity of quantum processing units (QPUs)
demands robust and scalable techniques for characterizing this resource. We
introduce the notion of set magic: a set of states has this property if at
least one state in the set is a non-stabilizer state. We show that certain
two-state overlap inequalities, recently introduced as witnesses of
basis-independent coherence, are also witnesses of multi-qubit set magic. We
also show it is possible to certify the presence of magic across multiple QPUs
without the need for entanglement between them and reducing the demands on each
individual QPU.
