Back to News
quantum-computing

Distributed Quantum Discrete Logarithm Algorithm

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers from China proposed a distributed quantum algorithm to solve the discrete logarithm problem (DLP), addressing current hardware limitations that restrict scalable quantum solutions. The new method reduces quantum register size by using a set-intersection approach, determining whether a solution exists within predefined sets without requiring quantum communication between nodes. Unlike Shor’s algorithm, this technique improves success probability while maintaining computational efficiency, offering a practical alternative for near-term quantum devices. The algorithm eliminates quantum communication overhead, making it compatible with existing distributed computing frameworks and easier to implement on modular quantum systems. Published in March 2026, the work bridges quantum physics and distributed computing, potentially accelerating real-world cryptanalysis and post-quantum security research.
Distributed Quantum Discrete Logarithm Algorithm

Summarize this article with:

Quantum Physics arXiv:2603.26160 (quant-ph) [Submitted on 27 Mar 2026] Title:Distributed Quantum Discrete Logarithm Algorithm Authors:Renjie Xu, Daowen Qiu, Ligang Xiao, Le Luo, Xu Zhou View a PDF of the paper titled Distributed Quantum Discrete Logarithm Algorithm, by Renjie Xu and 4 other authors View PDF HTML (experimental) Abstract:Solving the discrete logarithm problem (DLP) with quantum computers is a fundamental task with important implications. Beyond Shor's algorithm, many researchers have proposed alternative solutions in recent years. However, due to current hardware limitations, the scale of DLP instances that can be addressed by quantum computers remains insufficient. To overcome this limitation, we propose a distributed quantum discrete logarithm algorithm that reduces the required quantum register size for solving DLPs. Specifically, we design a distributed quantum algorithm to determine whether the solution is contained in a given set. Based on this procedure, our method solves DLPs by identifying the intersection of sets containing the solution. Compared with Shor's original algorithm, our approach reduces the register size and can improve the success probability, while requiring no quantum communication. Subjects: Quantum Physics (quant-ph); Distributed, Parallel, and Cluster Computing (cs.DC) Cite as: arXiv:2603.26160 [quant-ph] (or arXiv:2603.26160v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.26160 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Renjie Xu [view email] [v1] Fri, 27 Mar 2026 08:23:46 UTC (425 KB) Full-text links: Access Paper: View a PDF of the paper titled Distributed Quantum Discrete Logarithm Algorithm, by Renjie Xu and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 Change to browse by: cs cs.DC 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-computing
quantum-algorithms
quantum-communication

Source Information

Source: arXiv Quantum Physics