Clifford groups are used in at least 3 places I've encountered so far in QIP:
- A circuit that contains only Clifford operations, which are generated from CNOT, H and P, is sufficient for a wide variety of quantum circuits, as shown here.
- Clifford circuits are used in randomized benchmarking since we can get averages over the the entire unitary space by averaging only over Cliffords.
- They are sufficient, together with a single non-Clifford gate, to perform universal quantum computation.
However, in the literature, there are at least 2 (useful) definitions of the Clifford group I've seen:
Here, as the group that preserves the set $\pm P_n^{*}=\pm P_n\backslash\{I_n\}$, where $P_n$ is the Pauli group modulo phase, $P_n/U(1)$. In this case, $C_1$ has 24 elements, $C_2$ has 11520 and so on. Also, this definition gives us the same group that is generated by P, H, CNOT modulo $U(1)$, and I've seen it used for RB as well, for example here.
As the normalizer of the Pauli group, where (presumably) we're talking about the Pauli group whose elements are $P_n$ along with the phase $i^k$, and thus has a size of $4^{n+1}$. I've also see this definition used in the context of RB, here.
Clearly, these definitons do not coincide since the order of the Pauli group as defined in (2) does not divide the order of the Clifford group as defined in (1).
My question is: What is the relation between the two definitions? And, is there any practical scenario (e.g when running and analyzing an actual quantum circuit) where we have to use one of the definitions and the other would be wrong?