Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.19494 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $φ_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < ε< 1$, we prove that $φ_k(G) \ge 1 - ε$ if $k \ge \operatorname{rank}(G) + \lceil \log_2(2/ε) \rceil$ (a bound based on the group rank) or if $k \ge \operatorname{len}(G) + \lceil \log_2(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 \log_2 |G| + \log_2(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.