Improved distributed quantum algorithm for Simon's problem
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917984438583296 |
|---|---|
| author | Li, Hao Qiu, Daowen |
| author_facet | Li, Hao Qiu, Daowen |
| contents | Simon's problem is one of the most important problems demonstrating the power of quantum computing. Recently, an interesting distributed quantum algorithm for Simon's problem was proposed, where a key sorting operator requiring a large number of qubits was employed. In this paper, we design an improved distributed quantum algorithm for Simon's problem without using sorting operators, and our algorithm has the advantage of reducing half number of qubits required for a single computing node. Moreover, our algorithm does not involve the classical search process. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_09605 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Improved distributed quantum algorithm for Simon's problem Li, Hao Qiu, Daowen Quantum Physics Simon's problem is one of the most important problems demonstrating the power of quantum computing. Recently, an interesting distributed quantum algorithm for Simon's problem was proposed, where a key sorting operator requiring a large number of qubits was employed. In this paper, we design an improved distributed quantum algorithm for Simon's problem without using sorting operators, and our algorithm has the advantage of reducing half number of qubits required for a single computing node. Moreover, our algorithm does not involve the classical search process. |
| title | Improved distributed quantum algorithm for Simon's problem |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.09605 |