The thesis builds a 'normalizer circuit' model of quantum computation — quantum Fourier transforms, automorphism gates, and quadratic phase gates over abelian groups and hypergroups — extending the qubit Clifford gates (classically simulable, non-universal) with the genuinely powerful gates like the QFTs at the heart of Shor's factoring algorithm; it then maps exactly where these circuits deliver a quantum speed-up and where they fail, deriving no-go results for finding new quantum algorithms.

— In our words · Source: Normalizer Circuits and Quantum Computation (Juan Bermejo-Vega)