Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true…

A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factor: It is not clear whether this is still…

A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality…

We reply to Dukelsky, et al. regarding the article: L. A. Wu, M. S. Byrd and D. A. Lidar, Phys. Rev. Lett. 89, 057904 (2002).

The famous max-flow min-cut theorem states that a source node s can send information through a network (V,E) to a sink node t at a data rate determined by the min-cut separating s and t. Recently it has been shown that this rate can also be achieved…

The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No…

This paper considers the computational complexity of the discrete logarithm and related problems in the context of "generic algorithms" that is, algorithms which do not exploit any special properties of the encodings of group elements, other than…

We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for H without…

For a number of computational search, problems, the existence of a polynomial-time algorithm for the problem implies that such an algorithm for the problem is constructively known. Some instances of such self-witnessing polynomial-time complexity…

Dry-weight changes in the midgut, abdominal fat body, flight muscles, pterothoracic cuticle, and reproductive tract were measured in unfed male Rhodnius prolixus Stål following eclosion and in males fed a single blood meal on day 5 post-ecdysis.…