Quick Navigation
Topics
Quantum Algorithms
Quantum counting, and a relevant sign
arXiv
Authors: Natalie Chung, Rafael I. Nepomechie
Year
2023
Paper ID
53924
Status
Preprint
Abstract Read
~2 min
Abstract Words
66
Citations
N/A
Abstract
Two indispensable algorithms in an introductory course on Quantum Computing are Grover's search algorithm and quantum phase estimation. Quantum counting is a simple yet beautiful blend of these two algorithms, and it is therefore an attractive topic for a student project in such a course. However, a sign that is irrelevant when implementing Grover's algorithm becomes relevant. We briefly review these algorithms, highlighting the aforementioned sign.
Why This Paper Matters
- It adds a 2023 reference point for readers tracking recent quantum research.
- Two indispensable algorithms in an introductory course on Quantum Computing are Grover's search algorithm and quantum phase estimation.
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.