Explore chapters and articles related to this topic
Reflections on probabilistic compared to quantum computational devices
Published in International Journal of Parallel, Emergent and Distributed Systems, 2021
Giuseppe Corrente
A quantum Turing machine (QTM) [9], on a finite set Q of states and the finite alphabet Γ, is given by a transition function
assigning a so-called amplitude (or probability amplitude), a complex number, the absolute value of which is in the interval [0, 1], to each transition. Furthermore, for each configuration c0 and all its successor configurations c1, … , ck the following sentence must be true: