We study oriented graphs whose Hermitian adjacency matrices of the second kind have few eigenvalues. We give a complete characterization of the oriented graphs with two distinct eigenvalues, showing that there are only four such graphs. We extend this result to mixed graphs. We show that there are infinitely many regular tournaments with three distinct eigenvalues. We extend our main results to Hermitian adjacency matrices defined over other roots of unity.