A noisy version of Problem REF  was also introduced in [1]}, but was later shown to be quantum polynomial time equivalent to the noiseless version [2]}. In this paper, we give a quantum polynomial time algorithm for Problem REF . Our idea is based on computing the Zariski tangent space of the variety described by the set of polynomials \(s\) .
