Distributed quantum approximate counting algorithm
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909891954737152 |
|---|---|
| author | Huang, Huaijing Qiu, Daowen |
| author_facet | Huang, Huaijing Qiu, Daowen |
| contents | In this article, we propose a distributed quantum algorithm for solving counting problem using Grover operator and a classical post-processing procedure. We apply the proposed algorithm to estimate inner products and Hamming distances. Simulations are conducted on the Qisikit platform, further demonstrating the effectiveness of our algorithm and its suitability for the NISQ era. Compared to existing counting algorithms, the proposed algorithm has advantages in terms of the number of qubits, circuit depth, and the number of quantum gates. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_04945 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Distributed quantum approximate counting algorithm Huang, Huaijing Qiu, Daowen Quantum Physics In this article, we propose a distributed quantum algorithm for solving counting problem using Grover operator and a classical post-processing procedure. We apply the proposed algorithm to estimate inner products and Hamming distances. Simulations are conducted on the Qisikit platform, further demonstrating the effectiveness of our algorithm and its suitability for the NISQ era. Compared to existing counting algorithms, the proposed algorithm has advantages in terms of the number of qubits, circuit depth, and the number of quantum gates. |
| title | Distributed quantum approximate counting algorithm |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2511.04945 |