Low Depth Distributed Quantum Algorithms for Unordered Database Search
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917410888482816 |
|---|---|
| author | Huang, Huaijing Qiu, Daowen Hua, Ximing Chen, Xinyu |
| author_facet | Huang, Huaijing Qiu, Daowen Hua, Ximing Chen, Xinyu |
| contents | Grover's algorithm accelerates unstructured database search quadratically compared to classical algorithms. In the NISQ era, distributed quantum computing can decrease circuit depth and reduce noise. In this paper, an algorithm for constructing query operators for subfunctions is proposed. By dividing the target string of the search problem into several substrings and integrating the query operator of each subfunction, a low-depth distributed exact quantum search algorithm is designed. The contributions of this paper are as follows: (1) The proposed distributed algorithm has a lower circuit depth and can mitigate error accumulation compared to distributed quantum search algorithms; (2) The target can be accurately located by the proposed distributed algorithm; (3) Experiments conducted with the quantum software MindQuantum confirm the effectiveness and feasibility of the proposed distributed algorithm. Moreover, the introduction of noise to the circuit during these experiments indicates that the algorithm possesses an inherent capacity for noise resistance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_14081 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Low Depth Distributed Quantum Algorithms for Unordered Database Search Huang, Huaijing Qiu, Daowen Hua, Ximing Chen, Xinyu Quantum Physics Grover's algorithm accelerates unstructured database search quadratically compared to classical algorithms. In the NISQ era, distributed quantum computing can decrease circuit depth and reduce noise. In this paper, an algorithm for constructing query operators for subfunctions is proposed. By dividing the target string of the search problem into several substrings and integrating the query operator of each subfunction, a low-depth distributed exact quantum search algorithm is designed. The contributions of this paper are as follows: (1) The proposed distributed algorithm has a lower circuit depth and can mitigate error accumulation compared to distributed quantum search algorithms; (2) The target can be accurately located by the proposed distributed algorithm; (3) Experiments conducted with the quantum software MindQuantum confirm the effectiveness and feasibility of the proposed distributed algorithm. Moreover, the introduction of noise to the circuit during these experiments indicates that the algorithm possesses an inherent capacity for noise resistance. |
| title | Low Depth Distributed Quantum Algorithms for Unordered Database Search |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2604.14081 |