Efficient quantum processing of ideals in finite rings

Details Efficient quantum processing of ideals in finite rings Efficient quantum processing of ideals in finite rings

2009-07-31

arxiv.org/abs/0908.0022v1

Physics

Quantum Physics

5 pages

Scientific paper

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 ideals are identical, find their intersection, find their quotient, prove whether a given ring element belongs to a given ideal, prove whether a given element is a unit, and if so find its inverse, find the additive and multiplicative identities, compute the order of an ideal, solve linear equations over rings, decide whether an ideal is maximal, find annihilators, and test the injectivity and surjectivity of ring homomorphisms. These problems appear to be hard classically.

Affiliated with

Also associated with

No associations

Rating

Efficient quantum processing of ideals in finite rings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient quantum processing of ideals in finite rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient quantum processing of ideals in finite rings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154601