Efficient distributed quantum computing

• Main Authors: Beals, Robert (Author), Brierley, Stephen (Author), Gray, Oliver (Author), Harrow, Aram W. (Contributor), Kutin, Samuel (Author), Linden, Noah (Author), Shepherd, Dan (Author), Stather, Mark (Author)
• Other Authors: Massachusetts Institute of Technology. Center for Theoretical Physics (Contributor)
• Format: Article
• Language: English
• Published: Royal Society, The, 2014-07-18T14:47:15Z.
• Subjects: Article
• Online Access: Get fulltext

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.
National Science Foundation (U.S.) (Grant 0916400)
National Science Foundation (U.S.) (Grant 0829937)
National Science Foundation (U.S.) (Grant 0803478)
United States. Defense Advanced Research Projects Agency (DARPA QuEST contract FA9550-09-1-0044)
United States. Intelligence Advanced Research Projects Activity (DoI NBC contract no. D11PC20167)