Finding flows in the one-way measurement model
| dc.creator | de Beaudrap, Niel | |
| dc.date | 2006-11-29 | |
| dc.date | 2008-02-29 | |
| dc.date.accessioned | 2026-07-07T09:23:50Z | |
| dc.date.available | 2026-07-07T09:23:50Z | |
| dc.description | The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform a unitary embedding between two Hilbert spaces is for the graph G, together with input/output vertices I, O \subset V(G), to have a flow in the sense introduced by Danos and Kashefi [quant-ph/0506062]. For the special case of |I| = |O|, using a graph-theoretic characterization, I show that such flows are unique when they exist. This leads to an efficient algorithm for finding flows, by a reduction to solved problems in graph theory. | |
| dc.description | 8 pages, 3 figures: somewhat condensed and updated version, to appear in PRA | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0611284 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0611284 | |
| dc.identifier | Phys. Rev. A 77, 022328 (2008) | |
| dc.identifier | doi:10.1103/PhysRevA.77.022328 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155882 | |
| dc.subject | Quantum Physics | |
| dc.title | Finding flows in the one-way measurement model | |
| dc.type | text |