Distributed quantum algorithm for Simon's problem

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.

arXiv comment6 pages, 2 figures, comments are welcome

References in corpus (6)

• Quantum Computing in the NISQ era and beyond
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Efficient Distributed Quantum Computing
• Quantum advantage and noise reduction in distributed quantum computing

Cited by in corpus (4)

• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Networked Quantum Services
• Distributed Quantum Computing for Chemical Applications
• Distributed Exact Generalized Grover's Algorithm