Back to News
quantum-computing

Probabilistic Bounds on the Number of Elements to Generate Finite Nilpotent Groups and Their Applications

Ziyuan Dong, Xiang Fan, Tengxun Zhong, Daowen Qiu
Loading...
2 min read
0 likes
⚡ Quantum Brief
Researchers Ziyuan Dong, Xiang Fan, Tengxun Zhong, and Daowen Qiu have derived tighter probabilistic bounds for generating finite nilpotent groups, significantly improving upon prior estimates in quantum group theory. The study proves that k random elements generate a nilpotent group G with probability ≥1−ε if k exceeds either the group’s rank plus ⌈log₂(2/ε)⌉ or its chain length plus ⌈log₂(1/ε)⌉, replacing looser logarithmic bounds. These nearly tight bounds reduce computational overhead in quantum algorithms, particularly for the Abelian hidden subgroup problem (AHSP), cutting iteration counts in standard quantum solutions. Applications extend to Regev’s factoring algorithm, where fewer circuit repetitions are now required, potentially accelerating quantum attacks on classical cryptographic systems. Published in November 2025, the work bridges group theory and quantum computing, offering foundational tools for probabilistic algorithm analysis in nilpotent structures.
AI Audio Summary
0:00 / 0:00
Click to play
Quantum computing technology
Unsplash · Validated Fallback

Quantum Physics arXiv:2511.19494 (quant-ph) [Submitted on 23 Nov 2025] Title:Probabilistic Bounds on the Number of Elements to Generate Finite Nilpotent Groups and Their Applications Authors:Ziyuan Dong, Xiang Fan, Tengxun Zhong, Daowen Qiu View a PDF of the paper titled Probabilistic Bounds on the Number of Elements to Generate Finite Nilpotent Groups and Their Applications, by Ziyuan Dong and 3 other authors View PDF HTML (experimental) Abstract:This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 new | recent | 2025-11 Change to browse by: math math.GR References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-algorithms

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.