Efficient parallelization of quantum basis state shift

Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving the quantum speedup for computational applications. We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods, giving a logarithmic scaling in the number of gates versus states. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.