Distributed quantum algorithm for Simon's problem

TL;DR

This paper introduces a distributed quantum algorithm for Simon's problem that achieves exponential and quadratic speedups over classical and previous quantum algorithms, respectively, and can be extended to multiple nodes.

Contribution

It presents a novel distributed quantum algorithm for Simon's problem that extends to multiple nodes and offers significant speedups over prior methods.

Findings

Achieves exponential acceleration over classical distributed algorithms.

Provides quadratic speedup compared to previous distributed quantum algorithms.

Can be extended to multiple computing nodes beyond two.

Abstract

Limited by today's physical devices, quantum circuits are usually noisy and difficult to be designed deeply. The novel computing architecture of distributed quantum computing is expected to reduce the noise and depth of quantum circuits. In this paper, we study the Simon's problem in distributed scenarios and design a distributed quantum algorithm to solve the problem. The algorithm proposed by us has the advantage of exponential acceleration compared with the classical distributed computing, and has the advantage of square acceleration compared with the best distributed quantum algorithm proposed before. In particular, the previous distributed quantum algorithm for Simon's problem can not be extended to the case of more than {\it two computing nodes} (i.e. two subproblems), but our distributed quantum algorithm can be extended to the case of {\it multiple computing nodes} (i.e. multiple subproblems) as well.