A complete algorithm to find flows in the one-way measurement model
| dc.creator | de Beaudrap, Niel | |
| dc.date | 2006-03-08 | |
| dc.date | 2007-02-16 | |
| dc.date.accessioned | 2026-07-07T07:47:08Z | |
| dc.date.available | 2026-07-07T07:47:08Z | |
| dc.description | 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. | |
| dc.description | 25 pages, 6 figures. Corrected erratum in discussion of the conjectured extremal result | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0603072 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0603072 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/124063 | |
| dc.subject | Quantum Physics | |
| dc.subject | Combinatorics | |
| dc.title | A complete algorithm to find flows in the one-way measurement model | |
| dc.type | text |