{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:02:03Z","timestamp":1768528923731,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-096446-B-C22"],"award-info":[{"award-number":["PGC2018-096446-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002987","name":"Departament de Matem\u00e0tiques, Universitat Jaume I","doi-asserted-by":"publisher","award":["UJI-2018-10"],"award-info":[{"award-number":["UJI-2018-10"]}],"id":[{"id":"10.13039\/501100002987","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many <jats:italic>q<\/jats:italic>-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal <jats:inline-formula><jats:alternatives><jats:tex-math>$$q^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>q<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-ary linear codes. This result can be generalized to <jats:inline-formula><jats:alternatives><jats:tex-math>$$q^{2 m}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>q<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mi>m<\/mml:mi>\n                    <\/mml:mrow>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-ary linear codes, <jats:inline-formula><jats:alternatives><jats:tex-math>$$m &gt; 1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>&gt;<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We give a result for easily obtaining quantum codes from that generalization. As a consequence we provide several new binary stabilizer quantum codes which are records according to Grassl (Bounds on the minimum distance of linear codes, <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"http:\/\/www.codetables.de\">http:\/\/www.codetables.de<\/jats:ext-link>, 2020) and new <jats:italic>q<\/jats:italic>-ary ones, with <jats:inline-formula><jats:alternatives><jats:tex-math>$$q \\ne 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>q<\/mml:mi>\n                    <mml:mo>\u2260<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, improving others in the literature.<\/jats:p>","DOI":"10.1007\/s10623-022-01018-2","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T09:02:45Z","timestamp":1647853365000},"page":"1103-1112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3908-4462","authenticated-orcid":false,"given":"Carlos","family":"Galindo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9758-2152","authenticated-orcid":false,"given":"Fernando","family":"Hernando","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"key":"1018_CR1","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1109\/TIT.2006.890730","volume":"53","author":"SA Aly","year":"2007","unstructured":"Aly S.A., Klappenecker S., Sarvepalli P.K.: On quantum and classical BCH codes. IEEE Trans. Inf. Theory 53, 1183\u20131188 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"219","key":"1018_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"AF Arute","year":"2019","unstructured":"Arute A.F., Babbush K.R., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(219), 505\u2013510 (2019).","journal-title":"Nature"},{"key":"1018_CR3","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1109\/18.959288","volume":"47","author":"A Ashikhmin","year":"2001","unstructured":"Ashikhmin A., Knill E.: Non-binary quantum stabilizer codes. IEEE Trans. Inf. Theory 47, 3065\u20133072 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR4","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/18.841162","volume":"46","author":"A Ashikhmin","year":"2000","unstructured":"Ashikhmin A., Barg A., Knill E., Litsyn S.: Quantum error-detection I: statement of the problem. IEEE Trans. Inf. Theory 46, 778\u2013788 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR5","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/18.841163","volume":"46","author":"A Ashikhmin","year":"2000","unstructured":"Ashikhmin A., Barg A., Knill E., Litsyn S.: Quantum error-detection II: bounds. IEEE Trans. Inf. Theory 46, 789\u2013800 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1002\/(SICI)1520-6610(2000)8:3<174::AID-JCD3>3.0.CO;2-T","volume":"8","author":"J Bierbrauer","year":"2000","unstructured":"Bierbrauer J., Edel Y.: Quantum twisted codes. J. Comb. Des. 8, 174\u2013188 (2000).","journal-title":"J. Comb. Des."},{"key":"1018_CR7","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"AR Calderbank","year":"1996","unstructured":"Calderbank A.R., Shor P.: Good quantum error-correcting codes exist. Phys. Rev. A 54, 1098\u20131105 (1996).","journal-title":"Phys. Rev. A"},{"key":"1018_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1103\/PhysRevLett.78.405","volume":"76","author":"AR Calderbank","year":"1997","unstructured":"Calderbank A.R., Rains E.M., Shor P.W., Sloane N.J.A.: Quantum error correction and orthogonal geometry. Phys. Rev. Lett. 76, 405\u2013409 (1997).","journal-title":"Phys. Rev. Lett."},{"key":"1018_CR9","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"AR Calderbank","year":"1998","unstructured":"Calderbank A.R., Rains E.M., Shor P.W., Sloane N.J.A.: Quantum error correction via codes over GF(4). IEEE Trans. Inf. Theory 44, 1369\u20131387 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1038\/nature23460","volume":"549","author":"ET Campbell","year":"2017","unstructured":"Campbell E.T., Terhal B.M., Vuillot C.: Roads towards fault-tolerant universal quantum computation. Nature 549, 172\u2013179 (2017).","journal-title":"Nature"},{"key":"1018_CR11","doi-asserted-by":"publisher","first-page":"101643","DOI":"10.1016\/j.ffa.2020.101643","volume":"63","author":"M Cao","year":"2020","unstructured":"Cao M., Cui J.: New stabilizer codes from the construction of dual-containing matrix-product codes. Finite Fields Appl. 63, 101643 (2020).","journal-title":"Finite Fields Appl."},{"key":"1018_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11128-020-02921-0","volume":"19","author":"M Cao","year":"2020","unstructured":"Cao M., Cui J.: Construction of new quantum codes via Hermitian dual-containing matrix-product codes. Quant. Inf. Process. 19, 427 (2020).","journal-title":"Quant. Inf. Process."},{"key":"1018_CR13","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1109\/TIT.2015.2388576","volume":"61","author":"B Chen","year":"2015","unstructured":"Chen B., Ling S., Zhang G.: Application of constancyclic codes to quantum MDS codes. IEEE Trans. Inf. Theory 61, 1474\u20131484 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR14","first-page":"271","volume":"92","author":"D Dieks","year":"1982","unstructured":"Dieks D.: Communication by EPR devices. Phys. Rev. A 92, 271 (1982).","journal-title":"Phys. Rev. A"},{"key":"1018_CR15","unstructured":"Edel Y.: Some good quantum twisted codes. http:\/\/www.mathi.uni-heidelberg.de\/yves\/Matritzen\/QTBCH\/QTBCHIndex.html."},{"key":"1018_CR16","series-title":"In Coding Theory and Cryptology","first-page":"91","volume-title":"Quantum Error Correcting Codes","author":"K Feng","year":"2002","unstructured":"Feng K.: Quantum Error Correcting Codes, pp. 91\u2013142. In Coding Theory and Cryptology. Word Scientific, Singapore (2002)."},{"key":"1018_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10623-014-0016-8","volume":"76","author":"C Galindo","year":"2015","unstructured":"Galindo C., Hernando F.: Quantum codes from affine variety codes and their subfield subcodes. Des. Codes Crytogr. 76, 89\u2013100 (2015).","journal-title":"Des. Codes Crytogr."},{"key":"1018_CR18","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ffa.2015.07.003","volume":"36","author":"C Galindo","year":"2015","unstructured":"Galindo C., Hernando F., Ruano D.: New quantum codes from evaluation and matrix-product codes. Finite Fields Appl. 36, 98\u2013120 (2015).","journal-title":"Finite Fields Appl."},{"key":"1018_CR19","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1007\/s11128-015-1057-2","volume":"14","author":"C Galindo","year":"2015","unstructured":"Galindo C., Geil O., Hernando F., Ruano D.: On the distance of stabilizer quantum codes from $$J$$-affine variety codes and a new Steane-like enlargement. Quant. Inf. Process. 14, 3211\u20133231 (2015).","journal-title":"Quant. Inf. Process."},{"key":"1018_CR20","doi-asserted-by":"publisher","first-page":"2593","DOI":"10.1109\/TIT.2018.2868442","volume":"65","author":"C Galindo","year":"2019","unstructured":"Galindo C., Hernando F., Ruano D.: Classical and quantum evaluation codes at the trace roots. IEEE Trans. Inf. Theory 65, 2593\u20132602 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR21","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1103\/PhysRevA.54.1862","volume":"54","author":"D Gottesman","year":"1996","unstructured":"Gottesman D.: A class of quantum error-correcting codes saturating the quantum Hamming bound. Phys. Rev. A 54, 1862\u20131868 (1996).","journal-title":"Phys. Rev. A"},{"key":"1018_CR22","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1016\/S0960-0779(98)00218-5","volume":"10","author":"D Gottesman","year":"1999","unstructured":"Gottesman D.: Fault-tolerant computation with higher-dimensional systems. Chaos Solitons Fractals 10, 1749\u20131758 (1999).","journal-title":"Chaos Solitons Fractals"},{"key":"1018_CR23","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes. http:\/\/www.codetables.de. Accessed 15 Nov (2020)."},{"key":"1018_CR24","first-page":"207","volume":"1","author":"M Grassl","year":"1999","unstructured":"Grassl M., R\u00f6tteler M.: Quantum BCH codes. Proc. X Int. Symp. Theor. Elec. Eng. 1, 207\u2013212 (1999).","journal-title":"Proc. X Int. Symp. Theor. Elec. Eng."},{"key":"1018_CR25","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1142\/S0219749904000079","volume":"2","author":"M Grassl","year":"2004","unstructured":"Grassl M., Beth T., R\u00f6tteler M.: On optimal quantum codes. Int. J. Quant. Inf. 2, 757\u2013775 (2004).","journal-title":"Int. J. Quant. Inf."},{"key":"1018_CR26","doi-asserted-by":"publisher","first-page":"2745","DOI":"10.1007\/s11128-016-1311-2","volume":"15","author":"X He","year":"2016","unstructured":"He X., Xu L., Chen H.: New $$q$$-ary quantum MDS codes with distances bigger than $$q\/2$$. Quant. Inf. Process. 15, 2745\u20132758 (2016).","journal-title":"Quant. Inf. Process."},{"key":"1018_CR27","doi-asserted-by":"publisher","first-page":"4735","DOI":"10.1109\/TIT.2010.2054174","volume":"56","author":"L Jin","year":"2010","unstructured":"Jin L., Ling S., Luo J., Xing C.: Application of classical Hermitian self-orthogonal MDS codes to quantum MDS codes. IEEE Trans. Inf. Theory 56, 4735\u20134740 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR28","doi-asserted-by":"publisher","first-page":"4892","DOI":"10.1109\/TIT.2006.883612","volume":"52","author":"A Ketkar","year":"2006","unstructured":"Ketkar A., Klappenecker A., Kumar S., Sarvepalli P.K.: Nonbinary stabilizer codes over finite fields. IEEE Trans. Inf. Theory 52, 4892\u20134914 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR29","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1098\/rspa.1998.0166","volume":"454","author":"E Knill","year":"1998","unstructured":"Knill E., Laflamme R., Zurek W.H.: Resilient quantum computation: error models and thresholds. Proc. R. Soc. Lond. A 454, 365\u2013384 (1998).","journal-title":"Proc. R. Soc. Lond. A"},{"key":"1018_CR30","doi-asserted-by":"publisher","first-page":"042331","DOI":"10.1103\/PhysRevA.80.042331","volume":"80","author":"GG La Guardia","year":"2009","unstructured":"La Guardia G.G.: Construction of new families of nonbinary quantum BCH codes. Phys. Rev. A 80, 042331 (2009).","journal-title":"Phys. Rev. A"},{"key":"1018_CR31","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/TIT.2014.2298137","volume":"60","author":"GG La Guardia","year":"2014","unstructured":"La Guardia G.G.: On the construction of nonbinary quantum BCH codes. IEEE Trans. Inf. Theory 60, 1528\u20131535 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1018_CR32","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1016\/j.disc.2010.06.043","volume":"310","author":"GG La Guardia","year":"2010","unstructured":"La Guardia G.G., Palazzo R.: Constructions of new families of nonbinary CSS codes. Discret. Math. 310, 2935\u20132945 (2010).","journal-title":"Discret. Math."},{"key":"1018_CR33","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s11128-019-2307-5","volume":"18","author":"L Luo","year":"2019","unstructured":"Luo L., Ma Z.: Fault-tolerant quantum computation with non-binary systems. Quant. Inf. Process. 18, 188 (2019).","journal-title":"Quant. Inf. Process."},{"key":"1018_CR34","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/s10773-019-04324-z","volume":"59","author":"J Lv","year":"2020","unstructured":"Lv J., Li R., Wang J.: Quantum codes derived from one-generator quasi-cyclic codes with Hermitean inner product. Int. J. Theor. Phys. 59, 300\u2013312 (2020).","journal-title":"Int. J. Theor. Phys."},{"key":"1018_CR35","first-page":"1878","volume":"E83","author":"R Matsumoto","year":"2000","unstructured":"Matsumoto R., Uyematsu T.: Constructing quantum error correcting codes for $$p^m$$ state systems from classical error correcting codes. IEICE Trans. Fund. E83, 1878\u20131883 (2000).","journal-title":"IEICE Trans. Fund."},{"key":"1018_CR36","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1098\/rspa.1998.0167","volume":"454","author":"J Preskill","year":"1998","unstructured":"Preskill J.: Reliable quantum computers. Proc. R. Soc. Lond. A 454, 385\u2013410 (1998).","journal-title":"Proc. R. Soc. Lond. A"},{"key":"1018_CR37","unstructured":"Shor P.W.: Fault-tolerant quantum computation. In Proc. 37th Ann. Symp. Found. Comp. Sci., IEEE Comp. Soc. Press, pp. 56\u201365 (1996)."},{"key":"1018_CR38","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"PW Shor","year":"1995","unstructured":"Shor P.W.: Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 52, 2493\u20132496 (1995).","journal-title":"Phys. Rev. A"},{"key":"1018_CR39","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s11128-020-02722-5","volume":"19","author":"H Song","year":"2020","unstructured":"Song H., Li R., Liu Y., Guo G.: New quantum codes from matrix product codes over small fields. Quant. Inf. Process. 19, 226 (2020).","journal-title":"Quant. Inf. Process."},{"key":"1018_CR40","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1103\/PhysRevLett.77.793","volume":"77","author":"AM Steane","year":"1996","unstructured":"Steane A.M.: Simple quantum error correcting codes. Phys. Rev. Lett. 77, 793\u2013797 (1996).","journal-title":"Phys. Rev. Lett."},{"key":"1018_CR41","doi-asserted-by":"publisher","first-page":"052335","DOI":"10.1103\/PhysRevA.72.052335","volume":"72","author":"AM Steane","year":"2005","unstructured":"Steane A.M., Ibinson B.: Fault-tolerant logical gate networks for Calderbank-Shor-Steane codes. Phys. Rev. A 72, 052335 (2005).","journal-title":"Phys. Rev. A"},{"key":"1018_CR42","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters W.K., Zurek W.H.: A single quantum cannot be cloned. Nature 299, 802\u2013803 (1982).","journal-title":"Nature"},{"key":"1018_CR43","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10623-016-0245-0","volume":"83","author":"T Zhang","year":"2017","unstructured":"Zhang T., Ge G.: Quantum MDS codes with large minimum distance. Des. Codes Cryptogr. 83, 503\u2013517 (2017).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01018-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01018-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01018-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T19:09:21Z","timestamp":1650913761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01018-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1018"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01018-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,21]]},"assertion":[{"value":"8 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}