Classical and Quantum Algorithms for Exponential Congruences

@inproceedings{Dam2008ClassicalAQ,
  title={Classical and Quantum Algorithms for Exponential Congruences},
  author={W. Dam and I. Shparlinski},
  booktitle={TQC},
  year={2008}
}
  • W. Dam, I. Shparlinski
  • Published in TQC 2008
  • Computer Science, Physics, Mathematics
  • We discuss classical and quantum algorithms for solvability testing and finding integer solutions x ,y of equations of the form af x + bg y = c over finite fields . A quantum algorithm with time complexity q 3/8 (logq ) O (1) is presented. While still superpolynomial in logq , this quantum algorithm is significantly faster than the best known classical algorithm, which has time complexity q 9/8 (logq ) O (1). Thus it gives an example of a natural problem where quantum algorithms provide about a… CONTINUE READING

    Topics from this paper.

    Quantum speedup to some types of polynomial equations
    On exponential polynomials and quantum computing
    1
    Quantum Algorithm for Monotonicity Testing on the Hypercube
    10
    Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
    15
    Quantum Algorithms
    33
    T-count and Qubit Optimized Quantum Circuit Design of the Non-Restoring Square Root Algorithm
    5

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES
    Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
    • P. Shor
    • Mathematics, Computer Science
    • 1999
    6246
    On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields
    71
    From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
    117
    Tight bounds on quantum searching
    907
    A fast quantum mechanical algorithm for database search
    4431
    Estimates of character sums with exponential function
    10
    Prime Numbers: A Computational Perspective
    715
    Gauss and Jacobi sums
    666
    On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
    60