Haven't tried the MIQP extension against the QPLIB yet. It is just a prototype and it is written in Python. We first need to implement it in C to compare the timings.
You could compare number of nodes explored rather than absolute timings to see how inaccuracy solving the relaxations affects branch-and-bound.