A complete algorithm to find flows in the one-way measurement model
量子物理
2007-05-23 v4 组合数学
摘要
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.
引用
@article{arxiv.quant-ph/0603072,
title = {A complete algorithm to find flows in the one-way measurement model},
author = {Niel de Beaudrap},
journal= {arXiv preprint arXiv:quant-ph/0603072},
year = {2007}
}
备注
25 pages, 6 figures. Corrected erratum in discussion of the conjectured extremal result