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

Quantum Information and Computation

On quantum tensor product codes

FanJihao, LiYonghui, HsiehMin-Hsiu, ChenHanwu

Published Nov 1, 2017• 0 citations
Publisher

Abstract

We present a general framework for the construction of quantum tensor product codes (QTPC). In a classical tensor product code (TPC), its parity check matrix is constructed via the tensor product o...
DOI
10.5555/3179575.3179578

Related papers

On quantum tensor product codes

Jihao Fan, Yonghui Li, Min-Hsiu Hsieh +1 more

We present a general framework for the construction of quantum tensor product codes (QTPC). In a classical tensor product code (TPC), its parity check matrix is constructed via the tensor product of parity check matrices of the two component codes. We show that by adding some constraints on the component codes, several classes of dual-containing TPCs can be obtained. By selecting different types of component codes, the proposed method enables the construction of a large family of QTPCs and they can provide a wide variety of quantum error control abilities. In particular, if one of the component codes is selected as a burst-error-correction code, then QTPCs have quantum multiple-burst-error-correction abilities, provided these bursts fall in distinct subblocks. Compared with concatenated quantum codes (CQC), the component code selections of QTPCs are much more flexible than those of CQCs since only one of the component codes of QTPCs needs to satisfy the dual-containing restriction. We show that it is possible to construct QTPCs with parameters better than other classes of quantum error-correction codes (QECC), e.g., CQCs and quantum BCH codes. Many QTPCs are obtained with parameters better than previously known quantum codes available in the literature. Several classes of QTPCs that can correct multiple quantum bursts of errors are constructed based on reversible cyclic codes and maximum-distance-separable (MDS) codes.

arXiv:1605.09598•Quantum Information and Computation•Nov 1, 2017•16 citations

A construction of quantum turbo product codes based on CSS-type quantum convolutional codes

Hailin Xiao, Ju Ni, Wu Xie +1 more

As in classical coding theory, turbo product codes (TPCs) through serially concatenated block codes can achieve approximatively Shannon capacity limit and have low decoding complexity. However, special requirements in the quantum setting severely limit the structures of turbo product codes (QTPCs). To design a good structure for QTPCs, we present a new construction of QTPCs with the interleaved serial concatenation of [Formula: see text]-type quantum convolutional codes (QCCs). First, [Formula: see text]-type QCCs are proposed by exploiting the theory of CSS-type quantum stabilizer codes and QCCs, and the description and the analysis of encoder circuit are greatly simplified in the form of Hadamard gates and C-NOT gates. Second, the interleaved coded matrix of QTPCs is derived by quantum permutation SWAP gate definition. Finally, we prove the corresponding relation on the minimum Hamming distance of QTPCs associated with classical TPCs, and describe the state diagram of encoder and decoder of QTPCs that have a highly regular structure and simple design idea.

International Journal of Quantum Information•Dec 16, 2016•2 citations

Quantum codes construction from cyclic codes over matrix rings

Soham Ravikant Joshi, Shikha Patel, Om Prakash

Quantum Information Processing•Jun 9, 2026•0 citations

On new quantum codes from matrix product codes

Xiusheng Liu, Hai Quang Dinh, Hualu Liu +1 more

arXiv:1604.05823•Cryptography and Communications•Jul 14, 2017•31 citations

Quantum turbo product codes

Hailin Xiao, Ouyang Shan, Wu Xie

Quantum communication is a growing interdisciplinary field which combines classical communications and quantum mechanics. Quantum error correction coding is one of the key techniques in quantum communication. Nearly all of the classical error correction coding schemes have been transplanted to the domain of quantum communication, and the quantum counterparts of classical error correction coding techniques have been found. Based on the classical turbo product codes (TPCs) which is one of the most outstanding schemes in classical coding region, a new structure of the CSS-type quantum convolutional codes (QCC) as stabilizer sub-code of the quantum turbo product codes (QTPC) is presented. Firstly, CSS-type QCC stabilizer generator is constructed with the help of group theory and the basic principle of stabilizer coders, and the corresponding networks are described. Secondly, the interleaved coded matrix of the QTPC is obtained by quantum permutation SWAP gate definition. Finally, the corresponding relation between the quantum trace distance of QTPC decoding and the distance of classical TPCs decoding is obtained, and the scheme of QTPCs coding and decoding is completed. The coding and decoding of QTPCs have a highly regular structure and a simple design idea, and the networks are easy to realize.

Acta Physica Sinica•Jan 1, 2011•0 citations

Coupled-Layer Construction of Quantum Product Codes

Shuyu Zhang, Tzu-Chieh Wei, Nathanan Tantivasadakarn

Product codes are a class of quantum error correcting codes built from two or more constituent codes. They have recently gained prominence for a breakthrough yielding quantum low-density parity-check (qLDPC) codes with favorable scaling of both code distance and encoding rate. However, despite its powerful algebraic formulation, the physical mechanism for assembling a general product code from its constituents remains unclear. In this letter, we show that the tensor and balanced product codes admit an intuitive coupled-layer construction by taking a stack of one code and condensing a set of excitations in the pattern given by the checks of the other code. We also make a connection to concatenated codes by showing that the tensor product code can be obtained by gauging large-weight logicals in concatenated codes, making them qLDPC. Our framework accommodates both classical or quantum CSS input codes, unifies known physical mechanisms for constructing higher dimensional topological phases via anyon condensation, and naturally extends to non-topological codes.

quant-pharXiv:2603.08711•Mar 10, 2026•0 citations
We present a general framework for the construction of quantum tensor product codes (QTPC). In a classical tensor product code (TPC), its parity check matrix is constructed via the tensor product of parity check matrices of the two component codes. We show that by adding some constraints on the component codes, several classes of dual-containing TPCs can be obtained. By selecting different types of component codes, the proposed method enables the construction of a large family of QTPCs and they can provide a wide variety of quantum error control abilities. In particular, if one of the component codes is selected as a burst-error-correction code, then QTPCs have quantum multiple-burst-error-correction abilities, provided these bursts fall in distinct subblocks. Compared with concatenated quantum codes (CQC), the component code selections of QTPCs are much more flexible than those of CQCs since only one of the component codes of QTPCs needs to satisfy the dual-containing restriction. We show that it is possible to construct QTPCs with parameters better than other classes of quantum error-correction codes (QECC), e.g., CQCs and quantum BCH codes. Many QTPCs are obtained with parameters better than previously known quantum codes available in the literature. Several classes of QTPCs that can correct multiple quantum bursts of errors are constructed based on reversible cyclic codes and maximum-distance-separable (MDS) codes.
As in classical coding theory, turbo product codes (TPCs) through serially concatenated block codes can achieve approximatively Shannon capacity limit and have low decoding complexity. However, special requirements in the quantum setting severely limit the structures of turbo product codes (QTPCs). To design a good structure for QTPCs, we present a new construction of QTPCs with the interleaved serial concatenation of [Formula: see text]-type quantum convolutional codes (QCCs). First, [Formula: see text]-type QCCs are proposed by exploiting the theory of CSS-type quantum stabilizer codes and QCCs, and the description and the analysis of encoder circuit are greatly simplified in the form of Hadamard gates and C-NOT gates. Second, the interleaved coded matrix of QTPCs is derived by quantum permutation SWAP gate definition. Finally, we prove the corresponding relation on the minimum Hamming distance of QTPCs associated with classical TPCs, and describe the state diagram of encoder and decoder of QTPCs that have a highly regular structure and simple design idea.
Quantum communication is a growing interdisciplinary field which combines classical communications and quantum mechanics. Quantum error correction coding is one of the key techniques in quantum communication. Nearly all of the classical error correction coding schemes have been transplanted to the domain of quantum communication, and the quantum counterparts of classical error correction coding techniques have been found. Based on the classical turbo product codes (TPCs) which is one of the most outstanding schemes in classical coding region, a new structure of the CSS-type quantum convolutional codes (QCC) as stabilizer sub-code of the quantum turbo product codes (QTPC) is presented. Firstly, CSS-type QCC stabilizer generator is constructed with the help of group theory and the basic principle of stabilizer coders, and the corresponding networks are described. Secondly, the interleaved coded matrix of the QTPC is obtained by quantum permutation SWAP gate definition. Finally, the corresponding relation between the quantum trace distance of QTPC decoding and the distance of classical TPCs decoding is obtained, and the scheme of QTPCs coding and decoding is completed. The coding and decoding of QTPCs have a highly regular structure and a simple design idea, and the networks are easy to realize.
Product codes are a class of quantum error correcting codes built from two or more constituent codes. They have recently gained prominence for a breakthrough yielding quantum low-density parity-check (qLDPC) codes with favorable scaling of both code distance and encoding rate. However, despite its powerful algebraic formulation, the physical mechanism for assembling a general product code from its constituents remains unclear. In this letter, we show that the tensor and balanced product codes admit an intuitive coupled-layer construction by taking a stack of one code and condensing a set of excitations in the pattern given by the checks of the other code. We also make a connection to concatenated codes by showing that the tensor product code can be obtained by gauging large-weight logicals in concatenated codes, making them qLDPC. Our framework accommodates both classical or quantum CSS input codes, unifies known physical mechanisms for constructing higher dimensional topological phases via anyon condensation, and naturally extends to non-topological codes.