Cited By
View all- Schlingemann D(2018)Cluster states, algorithms and graphsQuantum Information & Computation10.5555/2011827.20118314:4(287-324)Online publication date: 27-Dec-2018
Logical network implementation for cluster states and graph codes
Pages 431 - 449
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 by only using one type of two-qubit gate, e.g. CNOT or controlled Phase, and one type of one-qubit gate, e.g. the Hadamard transform. Concerning the qubit case each vertex corresponds to an Hadamard gate and each edge corresponds to a controlled not gate.
References
[1]
Schlingemann, D. and Werner R.F.: Quantum error-correcting codes associated with graphs. Phys. Rev. A, 65, 012308, (2001), quant-ph/0012111.
[2]
Cleve R. and Gottesman, D.: Efficient computations of encodings for quantum error correction. Phys. Rev. A, 56, 76-83, (1997), quant-ph/9607030.
[3]
Grassl, M.: Private communications. A table of circuits for cyclic and weakly self-dual codes can be found on the webpage: http://iaks-www.ira.uka.de/home/grassl/QECC/ Grassl, M. and Beth, T.: Cyclic quantum error-correcting codes quant-ph/9910061.
[4]
Briegel, H.J. and Raussendorf, R.: Quantum computing via measurements only, quant-ph/0010033.
[5]
Briegel, H.J. and Raussendorf, R.: A one-way quantum computer. Phys. Rev. Lett. 86, 5188 (2001).
[6]
Briegel, H.J. and Raussendorf, R.: Persistent entanglement in arrays of interacting particles. Phys. Rev. Lett. 86, 910 (2001).
[7]
Schlingemann, D.: Stabilizer codes can be realized as graph codes, Quant. Inf. Comp. 2, No 4, 307-323, (2002).
- Logical network implementation for cluster states and graph codes
Recommendations
Generation of atomic momentum cluster and graph states via cavity QED
We present an experimentally feasible method, based on currently available cavity QED technology, to generate n-partite linear cluster and graph states in external degree of freedom of atoms. The scheme is based on first tagging n two-level atoms with ...
Quantum key agreement with Bell states and Cluster states under collective noise channels
AbstractThe collective noises, which include the collective-dephasing noise and the collective-rotation noise, are the topical noises in quantum key agreement (QKA). How to eliminate the influence of the collective noises on quantum communication is a ...
Cluster states, algorithms and graphs
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 ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Rinton Press, Incorporated
Paramus, NJ
Publication History
Published: 01 September 2003
Revised: 02 June 2003
Received: 15 April 2002
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024
Other Metrics
Citations
Cited By
View all- Schlingemann D(2018)Cluster states, algorithms and graphsQuantum Information & Computation10.5555/2011827.20118314:4(287-324)Online publication date: 27-Dec-2018
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in