{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:10:39Z","timestamp":1778256639616,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"EmPOWER Research Grant Scheme (EmRGS) 2022","award":["MACS\/EmRGS\/2022\/03"],"award-info":[{"award-number":["MACS\/EmRGS\/2022\/03"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Cyclotomic cosets are intrinsically linked with the design and construction of classical cyclic codes whose properties can be inferred from the coset structures. This paper proposes some new quantum variations of cyclotomic cosets for cyclic stabiliser construction. These variations are governed by several parameters which are devoted to designing the two essential parts: the error part and the position part of these cosets. Criteria on these cosets in generating additive cyclic stabiliser are extensively studied, followed by actual implementation on stabiliser codes construction of several selected classes of length.<\/jats:p>","DOI":"10.1007\/s11128-024-04451-5","type":"journal-article","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T07:01:46Z","timestamp":1718607706000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum variations of cyclotomic cosets for cyclic stabiliser codes construction"],"prefix":"10.1007","volume":"23","author":[{"given":"En Chong","family":"Yap","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai Lin","family":"Ong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"4451_CR1","doi-asserted-by":"crossref","unstructured":"Childs, A.M., et al.: Exponential algorithmic speedup by a quantum walk. Paper presented at the STOC \u201903: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, 9\u201311 June 2003 (2003)","DOI":"10.1145\/780551.780552"},{"key":"4451_CR2","doi-asserted-by":"publisher","first-page":"3172","DOI":"10.1039\/B517914A","volume":"8","author":"Y Shao","year":"2006","unstructured":"Shao, Y., et al.: Advances in methods and algorithms in a modern quantum chemistry program package. Phys. Chem. Chem. Phys. 8, 3172\u20133191 (2006). https:\/\/doi.org\/10.1039\/B517914A","journal-title":"Phys. Chem. Chem. Phys."},{"key":"4451_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1038\/s41586-022-04623-2","volume":"605","author":"D Joseph","year":"2022","unstructured":"Joseph, D., et al.: Transitioning organizations to post-quantum cryptography. Nature 605, 237\u2013243 (2022). https:\/\/doi.org\/10.1038\/s41586-022-04623-2","journal-title":"Nature"},{"key":"4451_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/que2.34","volume":"2","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Ni, Q.: Recent advances in quantum machine learning. Quantum Eng. 2, 34 (2020). https:\/\/doi.org\/10.1002\/que2.34","journal-title":"Quantum Eng."},{"key":"4451_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"key":"4451_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279","volume-title":"Coding Theory: A First Course","author":"S Ling","year":"2004","unstructured":"Ling, S., Xing, C.: Coding Theory: A First Course. Cambridge University Press, Cambridge (2004)"},{"key":"4451_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.4236\/ojapps.2012.24B025","volume":"2","author":"A Garg","year":"2012","unstructured":"Garg, A., Dutt, S.: Cyclic codes of length $$2^k$$ over $$z_8$$. Open J. Appl. Sci. 2, 104\u2013107 (2012). https:\/\/doi.org\/10.4236\/ojapps.2012.24B025","journal-title":"Open J. Appl. Sci."},{"key":"4451_CR8","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, A., Sarvepalli, P.K.: On quantum and classical BCH codes. IEEE Trans. Inf. Theory 53, 1183\u20131188 (2007). https:\/\/doi.org\/10.1109\/TIT.2006.890730","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4451_CR9","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/TIT.1980.1056268","volume":"26","author":"D Mandelbaum","year":"1980","unstructured":"Mandelbaum, D.: Two applications of cyclotomic cosets to certain BCH codes (corresp.). IEEE Trans. Inf. Theory 26, 737\u2013738 (1980). https:\/\/doi.org\/10.1109\/TIT.1980.1056268","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4451_CR10","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1109\/18.887870","volume":"46","author":"D-W Yue","year":"2000","unstructured":"Yue, D.-W., Feng, G.-Z.: Minimum cyclotomic coset representatives and their applications to bch codes and Goppa codes. IEEE Trans. Inf. Theory 46, 2625\u20132628 (2000). https:\/\/doi.org\/10.1109\/18.887870","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4451_CR11","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1007\/s10623-020-00762-7","volume":"88","author":"KL Ong","year":"2020","unstructured":"Ong, K.L., Ang, M.H.: On equivalency of zero-divisor codes via classifying their idempotent generator. Des. Codes Crypt. 88, 2051\u20132065 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00762-7","journal-title":"Des. Codes Crypt."},{"key":"4451_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.22342\/jims.23.2.288.67-75","volume":"23","author":"KL Ong","year":"2017","unstructured":"Ong, K.L., Ang, M.H.: Full identification of idempotens in binary abelian group rings. J. Indones. Math. Soc. 23, 67\u201375 (2017). https:\/\/doi.org\/10.22342\/jims.23.2.288.67-75","journal-title":"J. Indones. Math. Soc."},{"key":"4451_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/B978-0-12-383874-2.00002-3","volume-title":"Classical and Quantum Information","author":"DC Marinescu","year":"2012","unstructured":"Marinescu, D.C., Marinescu, G.M.: Measurements and quantum information. In: Marinescu, D.C., Marinescu, G.M. (eds.) Classical and Quantum Information, pp. 133\u2013220. Academic Press, Boston (2012)"},{"key":"4451_CR14","unstructured":"Gottesman, D.: Stabilizer codes and quantum error correction. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/9705052 (1997)"},{"key":"4451_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.laa.2015.09.034","volume":"488","author":"GG La Guardia","year":"2016","unstructured":"La Guardia, G.G., Alves, M.M.S.: On cyclotomic cosets and code constructions. Linear Algebra Appl. 488, 302\u2013319 (2016). https:\/\/doi.org\/10.1016\/j.laa.2015.09.034","journal-title":"Linear Algebra Appl."},{"key":"4451_CR16","doi-asserted-by":"publisher","unstructured":"Ong, K.L.: Study of idempotents in cyclic group rings over $${\\bf F2}$$. AIP Conference Proceedings 1739(1), (2016). https:\/\/doi.org\/10.1063\/1.4952491","DOI":"10.1063\/1.4952491"},{"key":"4451_CR17","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s11128-023-03904-7","volume":"22","author":"KL Ong","year":"2023","unstructured":"Ong, K.L.: Burst error-correcting quantum stabilizer codes designed from idempotents. Quantum Inf. Process. 22, 158 (2023). https:\/\/doi.org\/10.1007\/s11128-023-03904-7","journal-title":"Quantum Inf. Process."},{"key":"4451_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24, 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125","journal-title":"J. Symbolic Comput."},{"key":"4451_CR19","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http:\/\/www.codetables.de. Accessed on 2024-05-12 (2007)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04451-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04451-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04451-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T11:30:38Z","timestamp":1720006238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04451-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":19,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["4451"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04451-5","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"4 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"241"}}