The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a recent quantum algorithm of Arvind et al. which finds a basis representation for R itself. We then show that our algorithm is a useful primitive allowing quantum computers to rapidly solve a wide variety of problems regarding finite rings. In particular we show how to test whether two idealsarXiv:0908.0022v1 fatcat:paabwibbvjb5dko5hkoondyr5u