Logical network implementation for cluster states and graph codes
Dirk Schlingemann
Abstract
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.
Create a lesson
Related papers
Gaussian entanglement and quantum communication: geodesic optimization and multimode bounds
Hemant K. Mishra, Mark M. Wilde
On the coincidence of discrete and continuous definitions of Entanglement of Formation
Haobo Ma, Maksim E. Shirokov, Wenlin Zhang
EFI1PRS
Rishabh Batra
Relative-Entropy Geometry and Convergence in Nonconvex Wiretap Optimization
Farzin Salek, Masahito Hayashi
Deterministic and programmable generation of mechanical multipartite entangled states
Isabelle Franzen, Max-Emanuel Kern, Q. Rumman Rahman et al.
Quantum-enhanced mechanical sensing with machine-learning estimation
Finn Müßigbrodt, Andraž Omahen, Q. Rumman Rahman et al.