Aliferis, Panos and Leung, Debbie W. (2004) Computation by measurements: A unifying picture. Physical Review A, 70 (6). Art. No. 062314. ISSN 1050-2947. http://resolver.caltech.edu/CaltechAUTHORS:ALIpra04
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:ALIpra04
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a striking viewpoint for thinking about quantum computation and its powers. We consider the two major models for doing quantum computation by measurements that have hitherto appeared in the literature and show that they are conceptually closely related by demonstrating a systematic local mapping between them. This way we effectively unify the two models, showing that they make use of interchangeable primitives. With the tools developed for this mapping, we then construct more resource-effective methods for performing computation within both models and propose schemes for the construction of arbitrary graph states employing two-qubit measurements alone.
|Additional Information:||©2004 The American Physical Society (Received 1 May 2004; published 14 December 2004) We note that alternative but similar explanations of the workings of the 1WQC have been given by Michael Nielsen in unpublished notes . Peter Shor has also independently developed explanations for the 1WQC operation along similar lines. A systematic construction of one-way quantum computer models starting with the one-bit teleportation scheme , that complements the current work, is investigated by Andrew Childs, Michael Nielsen, and one of us . During the final preparation of this work, a paper by Simon Perdrix that uses the one-bit teleportation scheme to further simplify the requirements of the TQC model has also come to our attention . We are grateful to Robert Raussendorf for numerous insightful discussions on the workings of the 1WQC and to Ben Toner for many helpful comments and corrections. P.A. and D.L are supported by the U.S. NSF under Grant No. EIA-0086038, and D.L. is also supported by the Richard Tolman Foundation.|
|Subject Keywords:||quantum computing; graph theory|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||25 Aug 2006|
|Last Modified:||26 Dec 2012 08:59|
Repository Staff Only: item control page