Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
Distributed quantum approximate counting algorithm
arXiv
Authors: Huaijing Huang, Daowen Qiu
Year
2025
Paper ID
17501
Status
Preprint
Abstract Read
~2 min
Abstract Words
79
Citations
N/A
Abstract
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.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- In this article, we propose a distributed quantum algorithm for solving counting problem using Grover operator and a classical post-processing procedure.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.