A complete algorithm to find flows in the one-way measurement model
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Working with measurement-based computations on qudits
Simpler qudit flow definition yields O(n^3) flow-finding algorithm and flow-preserving operations for measurement-based quantum computing on prime-dimensional qudits.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.