Computation by measurements: a unifying picture

Abstract

The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a strikingly novel 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.

13 pages, 18 figures, REVTeX4

Cited by in corpus (5)

• Multiparty quantum state sharing of an arbitrary two-particle state with Einstein-Podolsky-Rosen pairs
• An introduction to measurement based quantum computation
• Simple proof of fault tolerance in the graph-state model
• Measurement-Based Quantum Turing Machines and their Universality
• Complexity of Graph State Preparation