Efficient Distributed Quantum Computing
Quantum Physics
2013-03-13 v2
Abstract
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.
Cite
@article{arxiv.1207.2307,
title = {Efficient Distributed Quantum Computing},
author = {Robert Beals and Stephen Brierley and Oliver Gray and Aram Harrow and Samuel Kutin and Noah Linden and Dan Shepherd and Mark Stather},
journal= {arXiv preprint arXiv:1207.2307},
year = {2013}
}
Comments
Some material rearranged and references added