Figure 5
Comparison of (a) \(N_{phy}\) and required time and (b) quantum volume for algorithms performing prime factorization and algorithms performing discrete logarithm when \(p_{fail}=0.01\) and \(\epsilon _p=10^{-3}\). The Beauregard algorithm for prime factorization is expressed as “Beauregard”, Pavlidis algorithm for factorization as “Pavlidis”. RA is expressed in blue, parallel in purple, adder in orange, Beauregard in red, and Pavlidis in green. The circle mark represents the algorithm for the discrete logarithm, and the X-mark represents the algorithm for prime factorization.
