Quick Navigation
Topics
Quantum Foundations
Probabilistic Bounds on the Number of Elements to Generate Finite Nilpotent Groups and Their Applications
arXiv
Authors: Ziyuan Dong, Xiang Fan, Tengxun Zhong, Daowen Qiu
Year
2025
Paper ID
16755
Status
Preprint
Abstract Read
~2 min
Abstract Words
143
Citations
N/A
Abstract
This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let varphik(G) denote the probability that k random elements generate a finite nilpotent group G. For any 0 < ε< 1, we prove that varphik(G) ge 1 - ε if k ge operatorname{rank}(G) + lceil log2(2/ε) rceil (a bound based on the group rank) or if k ge operatorname{len}(G) + lceil log2(1/ε) rceil (a bound based on the group chain length). Moreover, these bounds are shown to be nearly tight. Both bounds sharpen the previously known requirement of k ge lceil log2 |G| + log2(1/ε) rceil + 2. Our results provide a foundational tool for analyzing probabilistic algorithms, enabling a better estimation of the iteration count for the finite Abelian hidden subgroup problem (AHSP) standard quantum algorithm and a reduction in the circuit repetitions required by Regev's factoring algorithm.
Why This Paper Matters
- This paper contributes to the Quantum Foundations research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups.
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.