  On the topic of probabilistic rewriting, there are several works studying
both termination and confluence of different systems. While working with a
lambda calculus modelling quantum computation, we found a system with
probabilistic rewriting rules and strongly normalizing terms. We examine the
effect of small modifications in probabilistic rewriting, affine variables, and
strategies on the overall confluence in this strongly normalizing probabilistic
calculus.
