Stabilizer codes can be realized as graph codes
Quantum Information & Computation
Computational model underlying the one-way quantum computer
Quantum Information & Computation
Logical network implementation for cluster states and graph codes
Quantum Information & Computation
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory
Journal of the ACM (JACM)
Quadratic Form Expansions for Unitaries
Theory of Quantum Computation, Communication, and Cryptography
Teleportation via multi-qubit channels
Quantum Information & Computation
Explicit error syndrome calculation for quantum graph codes
Quantum Information Processing
Classical simulations of Abelian-group normalizer circuits with intermediate measurements
Quantum Information & Computation
| Hi-index | 0.00 |
The present paper is concerned with the concept of the one-way quantum computer,beyond binary-systems, and its relation to the concept of stabilizer quantum codes.This relation is exploited to analyze a particular class of quantum algorithms calledgraph algorithms, which correspond in the binary case to the Clifford group part of anetwork and which can efficiently be implemented on a one-way quantum computer.These algorithms can "completely be solved" in the sense that the manipulation ofquantum states in each step can be computed explicitly. Graph algorithms ace preciselythose which implement encoding schemes for graph codes. Starting from a given initialgraph, which represents the underlying resource of multipartite entanglement, each stepof the algorithm is related to a explicit transformation on the graph.