The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers

11/11/2021
by   Yoshinori Aono, et al.
0

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 experiments with the ibm_kawasaki device and discovered that the simplest circuit (7 qubits) from a 2-bit DLP instance achieves a sufficiently high success probability to proclaim the experiment successful. Experiments on another circuit from a slightly harder 2-bit DLP instance, on the other hand, did not succeed, and we determined that reducing the noise level by half is required to achieve a successful experiment. Finally, we give a near-term prediction based on required noise levels to solve some selected small DLP and integer factoring instances.

READ FULL TEXT

page 7

page 10

page 11

page 15

page 16

page 17

page 18

page 19

research
08/12/2023

An Efficient Quantum Factoring Algorithm

We show that n-bit integers can be factorized by independently running a...
research
05/22/2019

Revisiting Shor's quantum algorithm for computing general discrete logarithms

We heuristically demonstrate that Shor's algorithm for computing general...
research
11/17/2022

Synthesizing Quantum-Circuit Optimizers

Near-term quantum computers are expected to work in an environment where...
research
05/10/2022

Classical verification of quantum depth

We present two protocols for classical verification of quantum depth. Ou...
research
06/28/2023

Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation

Quantum Volume is a full-stack benchmark for near-term quantum computers...
research
09/04/2023

On the success probability of the quantum algorithm for the short DLP

Ekerå and Håstad have introduced a variation of Shor's algorithm for the...
research
07/20/2020

On completely factoring any integer efficiently in a single run of an order finding algorithm

We show that given the order of a single element selected uniformly at r...

Please sign up or login with your details

Forgot password? Click here to reset