“…In numerical simulations we demonstrate that the structure-exploiting mGST (i) allows for maximal flexibility in the design of gate sequences, so that standard GST gate sequences and random sequences work equally well, and (ii) obtains lowrank approximations of the implemented gate set from a significantly reduced number of sequences and samples. This allows us to successfully perform GST with gate sets and sequences that are not amenable to the standard GST implementation pyGSTi [15,38]. As one example, while the sequence design of pyGSTi uses at least 907 specific sequences to reconstruct a two-qubit gate set, we numerically demonstrate low-rank reconstruction from 200 random sequences of maximal length 7 with runtimes of less than an hour on a standard desktop computer.…”