Directed geometrical worm algorithm applied to the quantum rotor model

A directed worm algorithm for the quantum rotor model is proposed. It is shown that by adjusting the degrees of freedom left in the detailed balance condition, it is possible to construct a more efficient algorithm by minimizing the backtracking (bounce) probability for the worm to erase itself. A proof of detailed balance for the directed case is also presented.