Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2503.06478 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916647226310656 |
|---|---|
| author | Yang, Pengyu Zhang, Xin Lin, Song |
| author_facet | Yang, Pengyu Zhang, Xin Lin, Song |
| contents | To address the issue of excessive quantum resource requirements in Kuperberg's algorithm for the dihedral hidden subgroup problem, this paper proposes a distributed algorithm based on the function decomposition. By splitting the original function into multiple subfunctions and distributing them to multiple quantum nodes for parallel processing, the algorithm significantly reduces the quantum circuit depth and qubit requirements for individual nodes. Theoretical analysis shows that when $n\gg t$ ($t$ is the number of quantum nodes), the time complexity of the distributed version is optimized from $2^{O(\sqrt{n})}$ (the traditional algorithm's complexity) to $2^{o(\sqrt{n-t})}$. Furthermore, we carried out the simulation on the Qiskit platform, and the accuracy of the algorithm is verified. Compared to the original algorithm, the distributed version not only reduces the influence of circuit depth and noise, but also improves the probability of measurement success. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_06478 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Distributed quantum algorithm for the dihedral hidden subgroup problem Yang, Pengyu Zhang, Xin Lin, Song Quantum Physics To address the issue of excessive quantum resource requirements in Kuperberg's algorithm for the dihedral hidden subgroup problem, this paper proposes a distributed algorithm based on the function decomposition. By splitting the original function into multiple subfunctions and distributing them to multiple quantum nodes for parallel processing, the algorithm significantly reduces the quantum circuit depth and qubit requirements for individual nodes. Theoretical analysis shows that when $n\gg t$ ($t$ is the number of quantum nodes), the time complexity of the distributed version is optimized from $2^{O(\sqrt{n})}$ (the traditional algorithm's complexity) to $2^{o(\sqrt{n-t})}$. Furthermore, we carried out the simulation on the Qiskit platform, and the accuracy of the algorithm is verified. Compared to the original algorithm, the distributed version not only reduces the influence of circuit depth and noise, but also improves the probability of measurement success. |
| title | Distributed quantum algorithm for the dihedral hidden subgroup problem |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.06478 |