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 Processing

Dual-code quantum computation model

Byung-Soo Choi

Published May 22, 2015• 9 citations
Publisher
DOI
10.1007/s11128-015-1022-0

Related papers

On Quantum Bch Codes And Its Duals

Jaskarn Singh Bhullar, Manish K. Gupta

Classical Bose-Chaudhuri-Hocquenghem (BCH) codes C that contain their dual codes can be used to construct quantum stabilizer codes this chapter studies the properties of such codes. It had been shown that a BCH code of length n which contains its dual code satisfies the bound on weight of any non-zero codeword in C and converse is also true. One impressive difficulty in quantum communication and computation is to protect informationcarrying quantum states against undesired interactions with the environment. To address this difficulty, many good quantum errorcorrecting codes have been derived as binary stabilizer codes. We were able to shed more light on the structure of dual containing BCH codes. These results make it possible to determine the parameters of quantum BCH codes in terms of weight of non-zero dual codeword.

•Jun 29, 2013•0 citations

Quantum Codes and Computation

Sankalpa Khadka

•Jan 1, 2012•0 citations

Models for Quantum Computation

Peter P. Rohde

Cambridge University Press eBooks•Sep 9, 2021•0 citations

Application of Constacyclic Codes to Quantum MDS Codes

Bocong Chen, San Ling, Guanghui Zhang

Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes. To get q-ary quantum MDS codes, one of the effective ways is to find linear MDS codes C over Fq2satisfying C⊥H⊆ C, where C⊥Hdenotes the Hermitian dual code of C. For a linear code C of length n over Fq2, we say that C is a dual-containing code if C⊥H⊆ C and C≠ Fq2n. Several classes of new quantum MDS codes with relatively large minimum distance have been produced through dual-containing constacyclic MDS codes. These works motivate us to make a careful study on the existence conditions for dual-containing constacyclic codes. We obtain necessary and sufficient conditions for the existence of dual-containing constacyclic codes. Four classes of dual-containing constacyclic MDS codes are constructed and their parameters are computed. Consequently, the quantum MDS codes are derived from these parameters. The quantum MDS codes exhibited here have minimum distance bigger than the ones available in the literature.

arXiv:1403.2499•IEEE Transactions on Information Theory•Jan 7, 2015•194 citations

Dualities of dihedral and generalised quaternion codes and applications to quantum codes

Miguel Sales-Cabrera, Xaro Soler-Escrivà, Víctor Sotomayor

Let 𝔽 𝑞 be a finite field of q elements, for some prime power q , and let G be a finite group. A (left) group code , or simply a G-code , is a (left) ideal of the group algebra 𝔽 𝑞 ⁡ [ 𝐺 ] . In this paper, we provide a complete group-algebraic description for the Hermitian dual code of any 𝐷 𝑛 -code over 𝔽 𝑞 2 , where 𝐷 𝑛 is a dihedral group of order 2 n with n not divisible by c h a r ⁡ ( 𝔽 𝑞 2 ) , through a suitable Wedderburn-Artin decomposition of the group algebra 𝔽 𝑞 2 ⁡ [ 𝐷 𝑛 ] , and we determine all distinct Hermitian self-orthogonal 𝐷 𝑛 -codes over 𝔽 𝑞 2 . We also present a thorough representation of the Euclidean dual code of any 𝑄 𝑛 -code over 𝔽 𝑞 , where 𝑄 𝑛 is a generalised quaternion group of order 4 n not divisible by c h a r ⁡ ( 𝔽 𝑞 ) , via the Wedderburn-Artin decomposition of the group algebra 𝔽 𝑞 ⁡ [ 𝑄 𝑛 ] . In particular, since the semisimple group algebras 𝔽 𝑞 2 ⁡ [ 𝑄 𝑛 ] and 𝔽 𝑞 2 ⁡ [ 𝐷 2 ⁢ 𝑛 ] are isomorphic, then the Hermitian dual code of any 𝑄 𝑛 -code has also been fully described. As an application of the Hermitian dualities computed, we give a systematic construction, via the structure of the group algebra, to obtain quantum error-correcting codes, and in fact, with this methodical approach, we recover some already known quantum codes that achieve the best known minimum distance for their length and dimension.

arXiv:2512.07354•Finite Fields and Their Applications•Sep 25, 2026•3 citations

Models of quantum computation

Mingsheng Ying

Elsevier eBooks•Jan 1, 2024•0 citations
Classical Bose-Chaudhuri-Hocquenghem (BCH) codes C that contain their dual codes can be used to construct quantum stabilizer codes this chapter studies the properties of such codes. It had been shown that a BCH code of length n which contains its dual code satisfies the bound on weight of any non-zero codeword in C and converse is also true. One impressive difficulty in quantum communication and computation is to protect informationcarrying quantum states against undesired interactions with the environment. To address this difficulty, many good quantum errorcorrecting codes have been derived as binary stabilizer codes. We were able to shed more light on the structure of dual containing BCH codes. These results make it possible to determine the parameters of quantum BCH codes in terms of weight of non-zero dual codeword.
Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes. To get q-ary quantum MDS codes, one of the effective ways is to find linear MDS codes C over Fq2satisfying C⊥H⊆ C, where C⊥Hdenotes the Hermitian dual code of C. For a linear code C of length n over Fq2, we say that C is a dual-containing code if C⊥H⊆ C and C≠ Fq2n. Several classes of new quantum MDS codes with relatively large minimum distance have been produced through dual-containing constacyclic MDS codes. These works motivate us to make a careful study on the existence conditions for dual-containing constacyclic codes. We obtain necessary and sufficient conditions for the existence of dual-containing constacyclic codes. Four classes of dual-containing constacyclic MDS codes are constructed and their parameters are computed. Consequently, the quantum MDS codes are derived from these parameters. The quantum MDS codes exhibited here have minimum distance bigger than the ones available in the literature.
Let 𝔽 𝑞 be a finite field of q elements, for some prime power q , and let G be a finite group. A (left) group code , or simply a G-code , is a (left) ideal of the group algebra 𝔽 𝑞 ⁡ [ 𝐺 ] . In this paper, we provide a complete group-algebraic description for the Hermitian dual code of any 𝐷 𝑛 -code over 𝔽 𝑞 2 , where 𝐷 𝑛 is a dihedral group of order 2 n with n not divisible by c h a r ⁡ ( 𝔽 𝑞 2 ) , through a suitable Wedderburn-Artin decomposition of the group algebra 𝔽 𝑞 2 ⁡ [ 𝐷 𝑛 ] , and we determine all distinct Hermitian self-orthogonal 𝐷 𝑛 -codes over 𝔽 𝑞 2 . We also present a thorough representation of the Euclidean dual code of any 𝑄 𝑛 -code over 𝔽 𝑞 , where 𝑄 𝑛 is a generalised quaternion group of order 4 n not divisible by c h a r ⁡ ( 𝔽 𝑞 ) , via the Wedderburn-Artin decomposition of the group algebra 𝔽 𝑞 ⁡ [ 𝑄 𝑛 ] . In particular, since the semisimple group algebras 𝔽 𝑞 2 ⁡ [ 𝑄 𝑛 ] and 𝔽 𝑞 2 ⁡ [ 𝐷 2 ⁢ 𝑛 ] are isomorphic, then the Hermitian dual code of any 𝑄 𝑛 -code has also been fully described. As an application of the Hermitian dualities computed, we give a systematic construction, via the structure of the group algebra, to obtain quantum error-correcting codes, and in fact, with this methodical approach, we recover some already known quantum codes that achieve the best known minimum distance for their length and dimension.