Before revision:  We propose a tensor-based multilinear system representation to characterize the multidimensional state dynamics of uniform hypergraphs , and derive a Kalman-rank-like condition to identify the minimum number of driver vertices in order to achieve full control of the whole hypergraph. We discover that the minimum number of driver vertices can be determined by the hypergraph degree distributions, and high degree vertices are preferred to be the drivers in the chain, ring and star hypergraph configurations .
After revision:  We propose a tensor-based multilinear system representation to characterize the multidimensional state dynamics of uniform hypergraphs , and derive a Kalman-rank-like condition to identify the minimum number of control nodes (MCN) needed to achieve controllability of even uniform hypergraphs. We present an efficient heuristic to obtain the MCN. MCN can be used as a measure of robustness, and we show that it is related to the hypergraph degree distribution in simulated examples .