A folklore result in integer programming is that bounded integer variables can be replaced with binary variables, using bit representation. Under certain conditions, this can be used to reformulate mixed-integer quadratic programs as mixed-integer linear programs, and thereby render them easier to solve. In fact, several reformulation strategies can be found in the literature. We conduct a systematic comparison of these strategies by focusing on integer quadratic programs with box constraints, and present a hierarchy for the associated polytopes.