Efficient Distributed Quantum Computing

TL;DR

This paper introduces algorithms for efficient distributed quantum computing, enabling standard quantum algorithms to run on more realistic architectures with low overhead, and improves key quantum algorithms' performance.

Contribution

It provides the first efficient algorithms for parallel quantum memory access and demonstrates their application to improve existing quantum algorithms.

Findings

Standard circuit models can be simulated efficiently in distributed settings.

Parallel quantum search algorithm with improved performance.

Enhanced time-space trade-offs for Element Distinctness and Collision problems.

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.