Quantum Bogosort

I need help implementing quantum bogosort. So far I got the following:

shuffle(list);
if(isntSorted(list))DestroyUniverse();

Particularly I need help implementing the DestroyUniverse() function.

>>1,2
just keep flipping bits. eventually the universe will reach maximum entropy