On solving systems of diagonal polynomial equations over finite fields
arXiv:1503.09016 · doi:10.1016/j.tcs.2016.04.045
Abstract
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the polynomial equations. Our algorithm works in time polynomial in the number of equations and the logarithm of the size of the field, whenever the degree of the polynomial equations is constant. As a consequence we design polynomial time quantum algorithms for two algebraic hidden structure problems: for the hidden subgroup problem in certain semidirect product p-groups of constant nilpotency class, and for the multi-dimensional univariate hidden polynomial graph problem when the degree of the polynomials is constant.
A preliminary extended abstract of this paper has appeared in Proceedings of FAW 2015, Springer LNCS vol. 9130, pp. 125-137 (2015)
References in corpus (5)
- From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
- Quantum algorithms for hidden nonlinear structures
- Discrete mathematics: methods and challenges
- Hidden Symmetry Subgroup Problems
- Polynomial time quantum algorithms for certain bivariate hidden polynomial problems