A complete algorithm to find flows in the one-way measurement model

Abstract

This article is the complement to [quant-ph/0611284], which proves that flows (as introduced by [quant-ph/0506062]) can be found efficiently for patterns in the one-way measurement model which have non-empty input and output subsystems of the same size. This article presents a complete algorithm for finding flows, and a proof of its' correctness, without assuming any knowledge of graph-theoretic algorithms on the part of the reader. This article is a revised version of [quant-ph/0603072v2], where the results of [quant-ph/0611284] also first appeared.

25 pages, 6 figures. Corrected erratum in discussion of the conjectured extremal result

References in corpus (6)

• Measurement-based quantum computation with cluster states
• Experimental One-Way Quantum Computing
• Determinism in the one-way model
• Finding flows in the one-way measurement model
• Phase map decompositions for unitaries
• The Measurement Calculus

Cited by in corpus (5)

• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Finding Optimal Flows Efficiently
• Finding flows in the one-way measurement model
• An extremal result for geometries in the one-way measurement model
• Simple procedure for classical signal-procession in cluster-state quantum computation