Anyone know how this might impact constraint satisfaction algorithms? Is it possible we'd see something like Prolog being orders of magnitude faster? (Assuming

Anyone know how this might impact constraint satisfaction algorithms? Is it possible we'd see something like Prolog being orders of magnitude faster? (Assuming it were re-written for a quantum computer, maybe using something like Q#.)