The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
Yoshinori Aono, Sitong Liu, Tomoki Tanaka, Shumpei Uno, Rodney Van, Meter, Naoyuki Shinohara, Ryo Nojima

TL;DR
This paper investigates the impact of noise on quantum algorithms solving discrete logarithm problems, proposing measures to evaluate success probabilities and modifications to improve outcomes on current noisy quantum devices.
Contribution
It introduces a quantitative success measure for quantum DLP experiments and a method to enhance post-processing success probabilities under noise.
Findings
Successful experiments on IBM quantum hardware with small circuits.
Noise reduction is critical for solving larger DLP instances.
Predictions for future quantum device capabilities based on noise levels.
Abstract
The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor's work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical post-processing algorithm. Evaluating and predicting the instance size that quantum devices can solve is an emerging research topic. In this paper, we propose a quantitative measure based on the success probability of the post-processing algorithm to determine whether an experiment on a quantum device (or a classical simulator) succeeded. We also propose a procedure to modify bit strings observed from a Shor circuit to increase the success probability of a lattice-based post-processing algorithm. We report preliminary experiments conducted on IBM-Quantum quantum computers and near-future predictions based on noisy-device simulations. We conducted our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
