中国物理B ›› 2026, Vol. 35 ›› Issue (3): 30303-030303.doi: 10.1088/1674-1056/adfb58
Peng-Yu Yang(杨鹏宇)1, Xin Zhang(张新)2, and Song Lin(林崧)1,†
Peng-Yu Yang(杨鹏宇)1, Xin Zhang(张新)2, and Song Lin(林崧)1,†
摘要: As an important quantum cryptanalysis algorithm, Kuperberg's algorithm efficiently addresses the dihedral hidden subgroup problem with sub-exponential acceleration. However, when dealing with large numbers, the algorithm demands a deeper quantum circuit depth, rendering its implementation on current quantum devices prone to noise interference and thereby significantly reducing its efficiency. To mitigate this challenge, this paper proposes a distributed Kuperberg's algorithm. It decomposes the original function into sub-functions which can be executed on different nodes in parallel. The implementation of these sub-functions necessitates a shallower quantum circuit depth and a reduced number of qubits when contrasted with the execution of the original function. Furthermore, the proposed algorithm can be directly generalized to an arbitrary number of nodes by adjusting the quantity of input qubits. The utilization of multi-node parallel processing makes the proposed algorithm a linear enhancement in query complexity relative to the original algorithm. To validate the feasibility and demonstrate the superiority of our algorithm, experiments are conducted on the Qiskit platform.
中图分类号: (Quantum algorithms, protocols, and simulations)