Efficient distributed quantum computing
Robert Beals, STEPHEN D. BRIERLEY, Oliver Gray, Aram W. Harrow, Samuel Kutin, Noah Linden, Dan J. Shepherd, Mark Stather · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 2013
Abstract We provide algorithms for efficiently moving and addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with a low overhead by a 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 finding problems.