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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
