  We examine the effect of previous history on starting a computation on a
quantum computer. Specifically, we assume that the quantum register has some
unknown state on it, and it is required that this state be cleared and replaced
by a specific superposition state without any phase uncertainty, as needed by
quantum algorithms. We show that, in general, this task is computationally
impossible.
