{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T09:13:39Z","timestamp":1771492419978,"version":"3.50.1"},"reference-count":49,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971004"],"award-info":[{"award-number":["11971004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N,K,d+1))s and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes ((N,1,d+1))s and irredundant orthogonal arrays. This relation is used for the construction of pure quantum error-correcting codes. As applications of this method, numerous infinite families of optimal quantum codes can be constructed explicitly such as ((3,s,2))s for all si\u22653, ((4,s2,2))s for all si\u22655, ((5,s,3))s for all si\u22654, ((6,s2,3))s for all si\u22655, ((7,s3,3))s for all si\u22657, ((8,s2,4))s for all si\u22659, ((9,s3,4))s for all si\u226511, ((9,s,5))s for all si\u22659, ((10,s2,5))s for all si\u226511, ((11,s,6))s for all si\u226511, and ((12,s2,6))s for all si\u226513, where s=s1\u22efsn and s1,\u2026,sn are all prime powers. The advantages of our approach over existing methods lie in the facts that these results are not just existence results, but constructive results, the codes constructed are pure, and each basis state of these codes has far less terms. Moreover, the above method developed can be extended to construction of quantum error-correcting codes over mixed alphabets.<\/jats:p>","DOI":"10.3390\/e25040680","type":"journal-article","created":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T01:39:05Z","timestamp":1681868345000},"page":"680","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum Error-Correcting Codes Based on Orthogonal Arrays"],"prefix":"10.3390","volume":"25","author":[{"given":"Rong","family":"Yan","sequence":"first","affiliation":[{"name":"College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9000-802X","authenticated-orcid":false,"given":"Shanqi","family":"Pang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China"}]},{"given":"Mengqian","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China"}]},{"given":"Fuyuan","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1103\/PhysRevA.52.R2493","article-title":"Scheme for reducing decoherence in quantum memory","volume":"52","author":"Shor","year":"1995","journal-title":"Phys. Rev. A"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1103\/PhysRevLett.77.198","article-title":"Perfect quantum error correcting code","volume":"77","author":"Laflamme","year":"1996","journal-title":"Phys. Rev. Lett."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1098\/rspa.1996.0136","article-title":"Multiple particle interference and quantum error correction","volume":"452","author":"Steane","year":"1996","journal-title":"Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1126\/science.279.5349.342","article-title":"Resilient quantum computation","volume":"279","author":"Knill","year":"1998","journal-title":"Science"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1103\/PhysRevA.57.127","article-title":"Theory of fault-tolerant quantum computation","volume":"57","author":"Gottesman","year":"1997","journal-title":"Phys. Rev. A"},{"key":"ref_6","unstructured":"Bennett, C.H., and Brassard, G. (1984, January 9\u201312). Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","article-title":"Quantum cryptography based on Bell theorem","volume":"67","author":"Ekert","year":"1991","journal-title":"Phys. Rev. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"032319","DOI":"10.1103\/PhysRevA.74.032319","article-title":"Entanglement purification of any stabilizer state","volume":"74","author":"Glancy","year":"2006","journal-title":"Phys. Rev. A"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/TIT.2005.862089","article-title":"The minimum distance problem for two way entangelement purification","volume":"52","author":"Ambainis","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"062418","DOI":"10.1103\/PhysRevA.105.062418","article-title":"Measurement-based logical qubit entanglement purification","volume":"105","author":"Yan","year":"2022","journal-title":"Phys. Rev. A"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"28813","DOI":"10.1038\/srep28813","article-title":"Purification of logic-qubit entanglement","volume":"6","author":"Zhou","year":"2016","journal-title":"Sci. Rep."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1142\/S0219749904000079","article-title":"On optimal quantum codes","volume":"2","author":"Grassl","year":"2004","journal-title":"Int. J. Quantum Inf."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s11128-020-02949-2","article-title":"Constructions of quantum MDS codes","volume":"20","author":"Liu","year":"2021","journal-title":"Quantum Inf. Process."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"101901","DOI":"10.1016\/j.ffa.2021.101901","article-title":"Application of Hermitian self-orthogonal GRS codes to some quantum MDS codes","volume":"76","author":"Guo","year":"2021","journal-title":"Finite Fields Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/18.681315","article-title":"Quantum error correction via codes over GF(4)","volume":"44","author":"Calderbank","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1109\/18.782103","article-title":"Non-binary quantum codes","volume":"45","author":"Rains","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","first-page":"1878","article-title":"Constructing quantum error-correcting codes for pm-state systems from classical error-correcting codes","volume":"E83-A","author":"Matsumoto","year":"2000","journal-title":"IEICE Trans. Fundam."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3065","DOI":"10.1109\/18.959288","article-title":"Non-binary quantum stabilizer codes","volume":"47","author":"Ashikhim","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5224","DOI":"10.1109\/TIT.2015.2450235","article-title":"Some new classes of quantum MDS codes from constacyclic codes","volume":"61","author":"Zhang","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/s11128-020-02708-3","article-title":"The images of constacyclic codes and new quantum codes","volume":"19","author":"Kai","year":"2020","journal-title":"Quantum Inf. Process."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Yu, S., Chen, Q., and Oh, C.H. (2007). Graphical quantum error-correcting codes. arXiv.","DOI":"10.1103\/PhysRevLett.101.090501"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"090501","DOI":"10.1103\/PhysRevLett.101.090501","article-title":"Nonadditive quantum error-correcting code","volume":"101","author":"Yu","year":"2008","journal-title":"Phys. Rev. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"012306","DOI":"10.1103\/PhysRevA.78.012306","article-title":"Graphical nonbinary quantum error-correcting codes","volume":"78","author":"Hu","year":"2008","journal-title":"Phys. Rev. A"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"022328","DOI":"10.1103\/PhysRevA.88.022328","article-title":"Quantum error-correcting codes over mixed alphabets","volume":"88","author":"Wang","year":"2013","journal-title":"Phys. Rev. A"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2384","DOI":"10.1109\/TIT.2002.800469","article-title":"Quantum Codes [[6,2,3]] and [[7,3,3]] (p \u2265 3) exist","volume":"48","author":"Feng","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"4735","DOI":"10.1109\/TIT.2010.2054174","article-title":"Application of classical Hermitian self-orthogonal MDS codes to quantum MDS codes","volume":"56","author":"Jin","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"042303","DOI":"10.1103\/PhysRevA.78.042303","article-title":"Quantum-error-correcting codes using qudit graph states","volume":"78","author":"Looi","year":"2008","journal-title":"Phys. Rev. A"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Pang, S., Xu, H., and Chen, M. (2022). Construction of binary quantum error-correcting codes from orthogonal array. Entropy, 24.","DOI":"10.3390\/e24071000"},{"key":"ref_29","unstructured":"Grassl, M. (2022, June 01). Bounds on the Minimum Distance of Additive Quantum Codes. Available online: http:\/\/www.codetables.de."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/2983576","article-title":"Factorial experiments derivable from combinatorial arrangements of arrays","volume":"9","author":"Rao","year":"1947","journal-title":"Suppl. J. R. Statist. Soc."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1093\/biomet\/34.3-4.255","article-title":"A simple approach to confounding and fractional replication in factorial experiments","volume":"34","author":"Kempthorne","year":"1947","journal-title":"Biometrika"},{"key":"ref_32","first-page":"257","article-title":"On some connections between the design of experiments and information theory","volume":"38","author":"Bose","year":"1961","journal-title":"Bull. Internat. Statist. Inst."},{"key":"ref_33","unstructured":"Delsarte, P. (2023, January 15). An Algebraic Approach to the Association Schemes of Coding Theory. Philips Research Reports Supplements. Available online: https:\/\/users.wpi.edu\/~martin\/RESEARCH\/philips.pdf."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"022316","DOI":"10.1103\/PhysRevA.90.022316","article-title":"Multipartite entangled states and orthogonal arrays","volume":"90","author":"Goyeneche","year":"2014","journal-title":"Phys. Rev. A"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"012346","DOI":"10.1103\/PhysRevA.94.012346","article-title":"Multipartite entanglement in heterogeneous systems","volume":"94","author":"Goyeneche","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s11128-021-03040-0","article-title":"Quantum k-uniform states for heterogeneous systems from irredundant mixed orthogonal arrays","volume":"20","author":"Pang","year":"2021","journal-title":"Quantum Inf. Process."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1038\/s41534-019-0165-8","article-title":"Two and three-uniform states from irredundant orthogonal arrays","volume":"5","author":"Pang","year":"2019","journal-title":"NPJ Quantum Inf."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"042332","DOI":"10.1103\/PhysRevA.99.042332","article-title":"k-uniform quantum states arising from orthogonal arrays","volume":"99","author":"Li","year":"2019","journal-title":"Phys. Rev. A"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"032601","DOI":"10.1103\/PhysRevA.104.032601","article-title":"k-uniform quantum information masking","volume":"104","author":"Shi","year":"2021","journal-title":"Phys. Rev. A"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/jcd.21350","article-title":"The existence of mixed orthogonal arrays with four and five factors of strength two","volume":"22","author":"Chen","year":"2014","journal-title":"J. Combin. Des."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1360\/012016-23","article-title":"Constructions of mixed orthogonal arrays of strength three","volume":"47","author":"Chen","year":"2017","journal-title":"Sci. Sin. Math."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Pang, S., Zhu, Y., and Wang, Y. (2015). A class of mixed orthogonal arrays obtained from projection matrix inequalities. J. Inequal. Appl., 241.","DOI":"10.1186\/s13660-015-0765-6"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"2870","DOI":"10.1214\/21-AOS2063","article-title":"Construction of mixed orthogonal arrays with high strength","volume":"49","author":"Pang","year":"2021","journal-title":"Ann. Statist."},{"key":"ref_44","first-page":"595","article-title":"Orthogonal arrays obtained by orthogonal decomposition of projection matrices","volume":"9","author":"Zhang","year":"1999","journal-title":"Statist. Sin."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"8913","DOI":"10.1080\/03610926.2016.1197253","article-title":"Schematic saturated orthogonal arrays obtained by using the contractive replacement method","volume":"46","author":"Pang","year":"2017","journal-title":"Commun. Statist. Theory Methods"},{"key":"ref_46","unstructured":"Nebe, G., Rains, E.M., and Sloane, N.J.A. (2006). Self-Dual Codes and Invariant Theory, Springer."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Hedayat, A.S., Sloane, N.J.A., and Stufken, J. (1999). Orthogonal Arrays: Theory and Applications, Springer.","DOI":"10.1007\/978-1-4612-1478-6"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1214\/aoms\/1177729387","article-title":"Orthogonal arrays of index unity","volume":"23","author":"Bush","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.1090\/S0002-9947-07-04242-0","article-title":"A new construction of quantum error-correcting codes","volume":"360","author":"Feng","year":"2007","journal-title":"IEEE Trans. Am. Math. Soc."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/4\/680\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:18:35Z","timestamp":1760123915000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/4\/680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,19]]},"references-count":49,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["e25040680"],"URL":"https:\/\/doi.org\/10.3390\/e25040680","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,19]]}}}