<F4.08e+05> D.<F4.039e+05> Deutsch,<F4.112e+05> Quantum computational<F4.039e+05> networks, in Proc. Roy. Soc. London Ser. A, 425 (1989), pp. 73--90.  Home/Search   Document Not in Database   Summary   Related Articles

....open the question of whether standard variants of a QTM, such as machines with multiple tapes or with modified tape access, are more powerful than the basic model. Yao [46] showed that these models are polynomially equivalent to the basic model, as are quantum circuits (which were introduced in [21]) The e#ciency of Yao s simulation has been improved in [10] to show that the simulation overhead is a polynomial with degree independent of the number of tapes. Arguably, the full computational power of quantum physics for discrete systems is captured by the quantum analogue of a cellular ....

....to design a single QTM that carries out an arbitrary unitary transformation this QTM is deterministic except for a single kind of quantum coin flip. The decomposition of an arbitrary unitary transformation into a product of simple unitary transformations is similar to work carried out by Deutsch [21]. Deutsch s work, although phrased in terms of quantum computation networks, can be viewed as showing that a d dimensional unitary transformation can be decomposed into a product of transformations where each applies a particular unitary transformation to three dimensions and acts as the identity ....

<F4.08e+05> D.<F4.039e+05> Deutsch,<F4.112e+05> Quantum computational<F4.039e+05> networks, in Proc. Roy. Soc. London Ser. A, 425 (1989), pp. 73--90.

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