Quantum walks on undirected graphs have been studied using symmetric matrices, such as the adjacency or Laplacian matrix, and many results about perfect state transfer are known. We extend some of those results to oriented graphs. We also study the phenomena, unique to oriented graphs, of multiple state transfer, where there is a set of vertices such that perfect state transfer occurs between every pair in that set. We give a characterization of multiple state transfer, and a new example of a graph where it occurs.