Logical network implementation for cluster states and graph codes
| dc.creator | Schlingemann, Dirk | |
| dc.date | 2002-02-01 | |
| dc.date.accessioned | 2026-07-07T06:03:37Z | |
| dc.date.available | 2026-07-07T06:03:37Z | |
| dc.description | In a previous paper a straight forward construction method for quantum error correcting codes, based on graphs, has been presented. These graph codes are directly related to cluster states which have been introduced by Briegel and Raussendorf. We show that the preparation of a cluster state as well as the coding operation for a graph code, can be implemented by a logical network. Concerning the qubit case each vertex corresponds to an Hadamard gate and each edge corresponds to a controlled not gate. | |
| dc.description | 8 pages,10 figures, RevTeX | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0202007 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0202007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90008 | |
| dc.subject | Quantum Physics | |
| dc.title | Logical network implementation for cluster states and graph codes | |
| dc.type | text |