| Ekert, A., Mosca, M.: (note in preparation, 1998). |
....in this paper, we could efficiently find such an isomorphism, thereby increasing the number of finitely generated Abelian groups which can be efficiently expressed in a manner which allows us to employ these algorithms. We will however leave further discussion of these details to another note [EM]. When we talk about computing f , we assume that we have some unitary operation U f which takes us from state j xi j 0i to j xi j f(x)i. It could, for example, take j xi j yi to j xi j y f(x)i, where denotes an appropriate group operation, such as addition modulo N when the second register is ....
Ekert, A., Mosca, M.: (note in preparation, 1998).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC