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 ...

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 ...

Abstract: A compact construction for nonbinary low-density parity-check (LDPC) codes over GF(q) (q>2) using permutation polynomials (PPs) is proposed in this paper. Following the previous compact ...