Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Communications and Networking in China (ChinaCom)

Construction of quantum low density parity check code based on quasi-cyclic sparse sequence

Shengmei Zhao, Bao-yui Zheng, W. F. Wang

Published Jan 1, 2008• 1 citation
Publisher

Abstract

In this paper, a construction method of quantum low density parity check codes (quantum LDPC) which based on classical quasi-cyclic sparse sequence is proposed, and the quantum code QLDPC(3,8)(16,6) and QLDPC(3,8)(64,24) are selected as examples to illustrate this construction method. The performances of this kind quantum LDPC codes are discussed over the bit-flipping channel by numerical simulations. The results show that these quantum codes have good ability to correct error in quantum channel.

DOI
10.1109/chinacom.2008.4685067

Related papers

A construction method of quantum low density parity check code based on projective geometry

Shengmei Zhao, Xiu-Li Zhu, Guo-Jun Sun

With the development of quantum error correction techniques, many counterparts of classical error correction coding techniques have been found in quantum area. As the quantum counterpart of a good error correction code in classical communications, quantum low density parity check code becomes a promising coding technique in quantum error correction area. In this paper, a construction method of quantum low density parity check code (quantum LDPC) based on Projective Geometry is proposed, and the quantum code QLDPC [21,6] is selected as an example to illustrate the whole construction procedures. By numerical simulation, the error correction performance of QLDPC [21,6] is discussed over the bit-flipping channel. It is shown that this method is available and has some advantages.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2009•1 citation

A Construction of Quantum Low-Density-Parity Code Based on Sparse Sequences

Baoyu Zheng

CSS code is a simple,efficient quantum error correction code construction,and has been found applications in construction of varieties of quantum codes,so far.In this paper,we propose a new construction method of quantum parity check matrix codes based on CSS by taking advantage of the method used in classical quasi-cyclic LDPC codes.Using quick encoding algorithm,we can obtain the quantum code based on this proposed method.At last,a quantum code(3,8)(16,6) is selected as the example to illustrate the process of construction,and its encoding circuit by Controlled-not gate and Hadard gate is also presented.

Journal of Nanjing University of Posts and Telecommunications•Jan 1, 2011•0 citations

Construction and Complete Circuit for Quantum Low Density Parity Check Code

Shengmei Zhao, Baoyu Zheng

Quantum error correction is the basic technique for realization of quantum communication and quantum computation. So far, the theories of quantum error correction have become more and more perfect, and many counterpart of classical error correction coding technique have been found in quantum area. In this article, we proposed a new method of construction of parity check matrix of quantum low density parity check (LDPC) codes which based on classical quasi-cyclic LDPC codes, and selected the quantum code (3,8)(16,6) as the example to illustrate the construction of quantum code. We also gave its completing circuit by controlled-not gate and Hadamard gate.

International Conference on Genetic and Evolutionary Computing•Sep 1, 2008•0 citations

A Method of Construction of Quantum Low-Density Parity-Check Codes Based on Sparse Circle Sequence

Shengmei Zhao

Quantum error correction is the basic technique for realization of quantum communication and quantum computation.So far,the theories of quantum error correction has become more and more perfect,many counterpart of classical error correction coding technique have been found in quantum area.In this paper,we improve a method of construction of parity check matrix in quantum low density parity check(LDPC) codes based on sparse circle sequence,and compare the performance of our construction method with that of MacKay's.The result shows that our method is not only able to remove some disadvantages of B and U construction,but also to reserve their advantages and improve the efficiency of coding and decoding.

Journal of Nanjing University of Posts and Telecommunications•Jan 1, 2007•0 citations

A Construction Method of Quantum Low-density-parity-check Codes Based on Stabilizer Codes

Jing Liu

Based on the classical LDPC construction method and quantum error correction techniques,a construction method of quantum low-density-parity-check codes based on stabilizer codes is discussed method in this paper.We provide quantum code (12,3) obtained by our methed as example to verify this construction, together with a numerical simulation of the performance of quantum code (32,12) and quantum code (64,24)over the depolarizing channel.

Computer Knowledge and Technology•Jan 1, 2008•0 citations

Novel construction and cycle analysis of Quasi-Cyclic Low-Density Parity-Check codes

Wenwen Li, Mao Ai, Jie Qiu +1 more

Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes have practical significance in the field of engineering, thus their construction algorithm is a hot issue in the field of LDPC codes. Based on existing construction methods, particularly the method based on Progressive Edge-Growth (PEG) algorithm, a new construction method of shift matrix is proposed. It can effectively avoid the copy of cycle structures, especially short cycles in base matrix after extension. Besides, it also relieves the time cost caused by random search, and greatly improves the length of cycles when compared with algorithms based on methods such as quadratic congruence and arithmetic sequence. Those algorithms can only eliminate short cycles with length 4, while our method can provide QC-LDPC codes without length 6 at least. Cycle analysis and simulation results show that the newly constructed QC-LDPC codes have good cycle structure and error correction performance.

IEEE International Conference on Progress in Informatics and Computing•Dec 1, 2015•2 citations
In this paper, a construction method of quantum low density parity check codes (quantum LDPC) which based on classical quasi-cyclic sparse sequence is proposed, and the quantum code QLDPC(3,8)(16,6) and QLDPC(3,8)(64,24) are selected as examples to illustrate this construction method. The performances of this kind quantum LDPC codes are discussed over the bit-flipping channel by numerical simulations. The results show that these quantum codes have good ability to correct error in quantum channel.
With the development of quantum error correction techniques, many counterparts of classical error correction coding techniques have been found in quantum area. As the quantum counterpart of a good error correction code in classical communications, quantum low density parity check code becomes a promising coding technique in quantum error correction area. In this paper, a construction method of quantum low density parity check code (quantum LDPC) based on Projective Geometry is proposed, and the quantum code QLDPC [21,6] is selected as an example to illustrate the whole construction procedures. By numerical simulation, the error correction performance of QLDPC [21,6] is discussed over the bit-flipping channel. It is shown that this method is available and has some advantages.
CSS code is a simple,efficient quantum error correction code construction,and has been found applications in construction of varieties of quantum codes,so far.In this paper,we propose a new construction method of quantum parity check matrix codes based on CSS by taking advantage of the method used in classical quasi-cyclic LDPC codes.Using quick encoding algorithm,we can obtain the quantum code based on this proposed method.At last,a quantum code(3,8)(16,6) is selected as the example to illustrate the process of construction,and its encoding circuit by Controlled-not gate and Hadard gate is also presented.
Quantum error correction is the basic technique for realization of quantum communication and quantum computation. So far, the theories of quantum error correction have become more and more perfect, and many counterpart of classical error correction coding technique have been found in quantum area. In this article, we proposed a new method of construction of parity check matrix of quantum low density parity check (LDPC) codes which based on classical quasi-cyclic LDPC codes, and selected the quantum code (3,8)(16,6) as the example to illustrate the construction of quantum code. We also gave its completing circuit by controlled-not gate and Hadamard gate.
Quantum error correction is the basic technique for realization of quantum communication and quantum computation.So far,the theories of quantum error correction has become more and more perfect,many counterpart of classical error correction coding technique have been found in quantum area.In this paper,we improve a method of construction of parity check matrix in quantum low density parity check(LDPC) codes based on sparse circle sequence,and compare the performance of our construction method with that of MacKay's.The result shows that our method is not only able to remove some disadvantages of B and U construction,but also to reserve their advantages and improve the efficiency of coding and decoding.
Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes have practical significance in the field of engineering, thus their construction algorithm is a hot issue in the field of LDPC codes. Based on existing construction methods, particularly the method based on Progressive Edge-Growth (PEG) algorithm, a new construction method of shift matrix is proposed. It can effectively avoid the copy of cycle structures, especially short cycles in base matrix after extension. Besides, it also relieves the time cost caused by random search, and greatly improves the length of cycles when compared with algorithms based on methods such as quadratic congruence and arithmetic sequence. Those algorithms can only eliminate short cycles with length 4, while our method can provide QC-LDPC codes without length 6 at least. Cycle analysis and simulation results show that the newly constructed QC-LDPC codes have good cycle structure and error correction performance.