Phase map decompositions for unitaries
| dc.creator | de Beaudrap, Niel | |
| dc.creator | Danos, Vincent | |
| dc.creator | Kashefi, Elham | |
| dc.date | 2006-03-29 | |
| dc.date.accessioned | 2026-07-07T07:08:10Z | |
| dc.date.available | 2026-07-07T07:08:10Z | |
| dc.description | We propose a universal decomposition of unitary maps over a tensorial power of C^2, introducing the key concept of "phase maps", and investigate how this decomposition can be used to implement unitary maps directly in the measurement-based model for quantum computing. Specifically, we show how to extract from such a decomposition a matching entangled graph state (with inputs), and a set of measurements angles, when there is one. Next, we check whether the obtained graph state verifies a "flow" condition, which guarantees an execution order such that the dependent measurements and corrections of the pattern yield deterministic results. Using a graph theoretic characterization of flows, we can determine whether a flow can be constructed for a graph state in polynomial time. This approach yields an algorithmic procedure which, when it succeeds, may produce an efficient pattern for a given unitary. | |
| dc.description | 17 pages: earlier version submitted to ICALP 2006 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0603266 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0603266 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/110652 | |
| dc.subject | Quantum Physics | |
| dc.title | Phase map decompositions for unitaries | |
| dc.type | text |