Edge local complementation for logical cluster states
From MaRDI portal
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.
Recommendations
- Logical network implementation for graph codes and cluster states
- scientific article; zbMATH DE number 5320278
- Transforming graph states using single-qubit operations
- MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
- Graph states and local unitary transformations beyond local Clifford operations
Cites work
- Edge local complementation and equivalence of binary linear codes
- Graph concatenation for quantum codes
- Graphic presentations of isotropic systems
- scientific article; zbMATH DE number 5666686 (Why is no real title available?)
- scientific article; zbMATH DE number 3906496 (Why is no real title available?)
- Local complementation and interlacement graphs
- Mixed-state entanglement and quantum error correction
- Multiparty entanglement in graph states
- Quantum entanglement
Cited in
(2)
This page was built for publication: Edge local complementation for logical cluster states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5135863)
