Distributed Quantum Algorithm for the NISQ Era: A Novel Approach to Solving Simon's Problem with Reduced Resources

作     者：Zhou, Xu Wang, Yuchen Tao, Wenxuan Zhou, Zhuojun Luo, Le 

作者机构：Sun Yat Sen Univ Sch Phys & Astron Zhuhai 519082 Peoples R China QUDOOR Co Ltd Beijing 100089 Peoples R China QUDOOR Co Ltd Hefei 230000 Peoples R China Sun Yat Sen Univ Guangdong Prov Key Lab Quantum Metrol & Sensing Zhuhai 519082 Peoples R China Quantum Sci Ctr Guangdong Hong Kong Macao Greater Shenzhen 518045 Peoples R China 

出 版 物：《ADVANCED QUANTUM TECHNOLOGIES》 (Adv. Quant. Tech.)

年 卷 期：2025年第8卷第5期

核心收录：

基　　金：China Postdoctoral Science Foundation Guangdong Provincial Quantum Science Strategic Initiative CPS-Yangtze Delta Region Industrial Innovation Center of Quantum and Information Technology-MindSpore Quantum Open Fund 2023M740874 

主　　题：distributed quantum computation noisy intermediate-scale quantum (nisq) era distributed Simon's algorithm (dsa) mindspore quantum quantum simulation software 

摘      要：Distributed quantum computation has gained significant interest in the noisy intermediate-scale quantum (NISQ) era. This paradigm requires each computing node to possess a reduced number of qubits and quantum gates. In this study, a Distributed Simon s Algorithm (DSA) is designed to tackle Simon s problem, which entails the discovery of a hidden string s is an element of {0, 1}n of a promised Boolean function f : {0, 1}n - {0, 1}m, where f (x) = f (y) if and only if x = y or x circle plus y = s. Specifically, 1) our algorithm is capable of being partitioned into any t nodes, where 2 = t = n;2) the number of queries required by the DSA is n - t, while that of the original Simon s algorithm (SA) is n - 1;3) the maximum number of qubits required by our approach at a single node is max ( n0, n1, ... , nt-1 ) + m, which is fewer than the qubits required by both the SA and existing distributed Simon s algorithm. Here, nj denotes the number of computing qubits needed for the j-th node and satisfies t-1 j=0 nj = n;4) the optimal circuit depth of the DSA is (m + 1) . 2 n t + 2, which is reduced compared to the circuit depth of the SA, (m + 1) . 2n + 2;5) in contrast to currently distributed schemes, the DSA eliminates the need for classical queries;6) how the DSA solves a specific Simon s problem (e.g., s = 1000) is also simulated using MindSpore Quantum, a quantum simulation software. The simulation results show that the DSA features a shallower quantum circuit, thereby demonstrating enhanced resistance to circuit noise. This characteristic makes it more feasible for implementation in the NISQ era.