On solving systems of random linear disequations

Details On solving systems of random linear disequations On solving systems of random linear disequations

2007-04-23

arxiv.org/abs/0704.2988v1

Physics

Quantum Physics

13 pages

Scientific paper

An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable groups. The main idea of a promising approach to the shift problem is reduction to solving systems of certain random disequations in finite abelian groups. The random disequations are actually generalizations of linear functions distributed nearly uniformly over those not containing a specific group element in the kernel. In this paper we give an algorithm which finds the solutions of a system of N random linear disequations in an abelian p-group A in time polynomial in N, where N=(log|A|)^{O(q)}, and q is the exponent of A.

Affiliated with

Also associated with

No associations

Rating

On solving systems of random linear disequations 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 On solving systems of random linear disequations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On solving systems of random linear disequations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-195176