The deterministic factorization algorithm for polynomials over finite fields that was recently introduced by the author is based on a new type of linearization of the factorization problem. The main ...

The basic facts about separable extensions of discrete fields and factoring polynomials are developed in the constructive spirit of Errett Bishop. The ability to factor polynomials is shown to be ...

Here, we implement an iterative version of the order-finding algorithm 10,11 in which the control register contains only a single qubit, which is recycled n times using a sequence of measurement and ...