← Back to papers
Distributed quantum algorithm for discrete logarithm problem
Hao Li, Daowen Qiu·April 13, 2025
Physics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
The quantum algorithm with polynomial time for discrete logarithm problem proposed by Shor is one of the most significant quantum algorithms, but a large number of qubits may be required in the Noisy Intermediate-scale Quantum (NISQ) era. The main contributions of this paper are as follows: (1) A distributed quantum algorithm for discrete logarithm problem is designed, and its space complexity and success probability exhibit certain advantages to some extent; (2) The classical error correction technique proposed by Xiao and Qiu et al. is generalized by extending three bits to more than three bits.