ArticlePreamble.sty Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits \cite{VDNest_12_QFTs}: a normalizer circuit over a finite Abelian group \(G\) is composed of the quantum Fourier transform (QFT) over \(G\), together with gates which compute quadratic functions and automorphisms. In \cite{VDNest_12_QFTs} it was shown that every normalizer circuit can be simulated efficiently classically. This result provides a nontrivial example of a family of quantum circuits that cannot yield exponential speed-ups in spite of usage of the QFT, the latter being a central quantum algorithmic primitive. Here we extend the aforementioned result in several ways. Most importantly, we show that normalizer circuits supplemented with intermediate measurements can also be simulated efficiently classically, even when the computation proceeds adaptively. This yields a generalization of the Gottesman-Knill theorem (valid for \(n\)-qubit Clifford operations \cite{Gottesman_PhD_Thesis, gottesman_knill}) to quantum circuits described by arbitrary finite Abelian groups. Moreover, our simulations are twofold: we present efficient classical algorithms to sample the measurement probability distribution of any adaptive-normalizer computation, as well as to compute the amplitudes of the state vector in every step of it. Finally we develop a generalization of the stabilizer formalism \cite{Gottesman_PhD_Thesis, gottesman_knill} relative to arbitrary finite Abelian groups: for example we characterize how to update stabilizers under generalized Pauli measurements and provide a normal form of the amplitudes of generalized stabilizer states using quadratic functions and subgroup cosets.