Edge local complementation for logical cluster states
arXiv:1105.3921 · doi:10.1088/1367-2630/13/6/063025
Abstract
A method is presented for the implementation of edge local complementation in graph states, based on the application of two Hadamard operations and a single controlled-phase (CZ) gate. As an application, we demonstrate an efficient scheme to construct a one-dimensional logical cluster state based on the five-qubit quantum error-correcting code, using a sequence of edge local complementations. A single physical CZ operation, together with local operations, is sufficient to create a logical CZ operation between two logical qubits. The same construction can be used to generate any encoded graph state. This approach in concatenation may allow one to create a hierarchical quantum network for quantum information tasks.
15 pages, two figures, IOP style
References in corpus (11)
- Multi-party entanglement in graph states
- Fault-tolerant quantum computation with high threshold in two dimensions
- Experimental entanglement of six photons in graph states
- Topological fault-tolerance in cluster state quantum computation
- Graph Concatenation for Quantum Codes
- Edge Local Complementation and Equivalence of Binary Linear Codes
- Cluster-based architecture for fault-tolerant quantum computation
- A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
- Error-correcting one-way quantum computation with global entangling gates
- Weight of quadratic forms and graph states
- On Graphs and Codes Preserved by Edge Local Complementation