Green, Frederic; Homer, Steven; Pollett, Christopher
(Boston University Computer Science Department, 2000-01-20)
For any q > 1, let MOD_q be a quantum gate that determines if the number of 1's in the input is divisible by q. We show that for any q,t > 1, MOD_q is equivalent to MOD_t (up to constant depth). Based on the case q=2, ...
