Efficient distributed quantum computing

Robert Beals, Stephen Brierley, Oliver Gray, Aram W. Harrow, Samuel Kutin, Noah Linden, Dan Shepherd, Mark Stather

Research output: Contribution to journalArticlepeer-review

126 Scopus citations


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 memoryintensive quantum algorithms. We present a parallel quantum search algorithm and improve the time- space trade-off for the element distinctness and collision finding problems.

Original languageEnglish (US)
Article number20120686
JournalProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Issue number2153
StatePublished - May 8 2013

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Engineering(all)
  • Physics and Astronomy(all)


  • Distributed quantum computing
  • Quantum algorithms
  • Quantum architectures


Dive into the research topics of 'Efficient distributed quantum computing'. Together they form a unique fingerprint.

Cite this