Efficient Distributed Quantum Computing
  We provide algorithms for efficiently 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. As a result, the circuit model can be used by algorithm designers without worrying whether the underlying architecture supports the connectivity of the circuit. In addition, we apply our results to existing memory intensive quantum algorithms. We present a parallel quantum search algorithm and improve the time-space trade-off for the Element Distinctness and Collision problems. 
Robert Beals, Stephen Brierley, Oliver Gray, Aram Harrow, Samuel   Kutin, Noah Linden, Dan Shepherd and Mark Stather
quant-ph