<p>Private set intersection is a crucial cryptographic primitive that finds extensive applications in areas such as data sharing and data analysis. In this paper, we utilize the properties of discrete-time quantum walk on a circular graph to design an efficient multiparty quantum private set intersection protocol. The protocol involves a two-particle pair prepared by a semi-honest third party, which serves as the information carrier and is circulated among multiple participants. Each participant encodes their private dataset into these carrier particles and then executes the quantum walk as the permutation operation. Ultimately, all participants are able to obtain the set intersection with the help of a semi-honest third party, without obtaining any information about the other partys’ set beyond the intersection. The security analysis demonstrates that this protocol can effectively resist common external and internal attacks, indicating that the proposed protocol is secure in theory. Finally, we implemented the protocol using a quantum circuit constructed in Qiskit and conducted simulations on the IBM platform, demonstrating its practical feasibility.</p>