I'll present algorithms for efficiently moving and addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic model of a distributed quantum computer. In addition, our results apply to existing memory intensive quantum algorithms. I'll show you a new parallel quantum search algorithm and explain how to improve the time-space trade-off for the Element Distinctness and Collision problems.