The Complexity of Black-Box Ring Problems

We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a black-box oracle. We give a polynomial-time quantum algorithm to compute a basis representation for a given black-box ring. Using this result we obtain polynomial-time quantum algorithms for several natural computational problems over black-box rings.

• Type: Conference
• Year: 2006
• Where: COCOON
• Authors: Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
• Keywords: Black-box Rings, COCOON 2006, Combinatorics, Finite Black-box Rings, Polynomial-time Quantum Algorithms