{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T16:59:22Z","timestamp":1761929962730,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T00:00:00Z","timestamp":1542585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2016R1D1A1B03934653"],"award-info":[{"award-number":["NRF-2016R1D1A1B03934653"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In this paper, new conditions on parameters in difference sets are derived to satisfy symplectic inner product, and new constructions of quantum stabilizer codes are proposed from the conditions. The conversion of the difference sets into parity-check matrices is first explained. Then, the proposed code construction is composed of three steps, which are to choose the generators of quantum stabilizer code, to determine the quantum stabilizer groups, and to determine subspace codewords with large minimum distance. The quantum stabilizer codes with various length are also presented to explain the practicality of the code construction. The proposed design can be applied to quantum stabilizer code construction based on combinatorial design.<\/jats:p>","DOI":"10.3390\/sym10110655","type":"journal-article","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T03:41:31Z","timestamp":1542944491000},"page":"655","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["New Constructions of Quantum Stabilizer Codes Based on Difference Sets"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4527-3358","authenticated-orcid":false,"given":"Duc Manh","family":"Nguyen","sequence":"first","affiliation":[{"name":"School of Electrical Engineering, University of Ulsan, Ulsan 44610, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-5915","authenticated-orcid":false,"given":"Sunghwan","family":"Kim","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, University of Ulsan, Ulsan 44610, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,11,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3390\/sym3020171","article-title":"Quantum Theory and Probability Theory: Their Relationship and Origin in Symmetry","volume":"3","author":"Goyal","year":"2011","journal-title":"Symmetry"},{"key":"ref_2","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for quantum computation discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Nguyen, D.M., and Kim, S. (2018). Quantum Key Distribution Protocol Based on Modified Generalization of Deutsch-Jozsa Algorithm in d-level Quantum System. Int. J. Theor. Phys.","DOI":"10.1007\/s10773-018-3910-4"},{"key":"ref_4","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_5","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1103\/PhysRevLett.77.793","article-title":"Error correcting codes in quantum theory","volume":"77","author":"Steane","year":"1996","journal-title":"Phys. Rev. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","article-title":"Good quantum error-correcting codes exist","volume":"54","author":"Calderbank","year":"1996","journal-title":"Phys. Rev. A"},{"key":"ref_7","unstructured":"Gottesman, D. (1997). Stabilizer Codes and Quantum Error Correction. [Ph.D. Thesis, California Institute of Technology]."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Nguyen, D.M., and Kim, S. (2017). Minimal-Entanglement Entanglement-Assisted Quantum Error Correction Codes from Modified Circulant Matrices. Symmetry, 9.","DOI":"10.3390\/sym9070122"},{"key":"ref_9","unstructured":"Nguyen, D.M., and Kim, S. (2016, January 5\u20138). Construction and complement circuit of a quantum stabilizer code with length 7. Proceedings of the Eighth International Conference on Ubiquitous and Future Networks, Vienna, Austria."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","article-title":"Low density parity check codes","volume":"8","author":"Gallager","year":"1962","journal-title":"IRE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4234.905935","article-title":"On the design of low-density parity check codes within 0.045 db of the shannon limit","volume":"45","author":"Chung","year":"2001","journal-title":"IEEE Comm. Lett."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TIT.2007.901193","article-title":"Quasi-cyclic low-density parity-check codes with girth larger than 12","volume":"53","author":"Kim","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1109\/LPT.2014.2361171","article-title":"Adaptive FEC codes suitable for variable dimming values in visible light communication","volume":"27","author":"Kim","year":"2015","journal-title":"IEEE Photonics Technol. Lett."},{"key":"ref_14","unstructured":"Postol, M.S. (arXiv, 2001). A proposed quantum low density parity check code, arXiv."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Hagiwara, M., and Imai, H. (2007, January 24\u201329). Quantum quasi-cyclic LDPC codes. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Nice, France.","DOI":"10.1109\/ISIT.2007.4557323"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2219","DOI":"10.1007\/s11128-012-0519-z","article-title":"A class of quantum low-density parity check codes by combining seed graphs","volume":"12","author":"Hwang","year":"2013","journal-title":"Quantum Inf. Process."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/TIT.2009.2034794","article-title":"Efficient quantum stabilizer codes: LDPC and LDPC convolutional constructions","volume":"56","author":"Tan","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Baumert, L.D. (1971). Cyclic Difference Sets, Springer.","DOI":"10.1007\/BFb0061260"},{"key":"ref_19","unstructured":"Anderson, I. (1990). Combinatorial Designs: Construction Methods, Ellis Horwood Limited."},{"key":"ref_20","unstructured":"Beth, T., Jungnickel, D., and Lenz, H. (1986). Design Theory, Cambridge University Press."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1109\/TIT.2004.834737","article-title":"Sparse-graph codes for quantum error correction","volume":"50","author":"MacKay","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wang, Y., Zhao, S., and Zheng, B. (2012, January 21\u201325). A construction of entanglement-assisted quantum LDPC codes from the cyclic difference set. Proceedings of the IEEE 11th International Conference on Signal Processing (ICSP), Beijing, China.","DOI":"10.1109\/ICoSP.2012.6491813"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Xie, Y., Yuan, J., and Malaney, R. (2013, January 7\u201312). Quantum stabilizer codes from difference sets. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620281"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"305","DOI":"10.3390\/sym3020305","article-title":"Symmetry Groups for the Decomposition of Reversible Computers, Quantum Computers, and Computers in between","volume":"3","author":"Vos","year":"2011","journal-title":"Symmetry"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/JCN.2018.000043","article-title":"Quantum Stabilizer Codes Construction from Hermitian Self-Orthogonal Codes over GF (4)","volume":"20","author":"Nguyen","year":"2018","journal-title":"J. Commun. Netw."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3721","DOI":"10.1109\/TCOMM.2018.2827945","article-title":"On design of quantum stabilizer codes from quadratic residues sets","volume":"66","author":"Xie","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","unstructured":"Grassl, M. (2018, November 07). Bounds on the Minimum Distance of Linear Codes and Quantum Codes. Available online: http:\/\/codetables.de\/."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/11\/655\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:30:44Z","timestamp":1760196644000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/11\/655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,19]]},"references-count":27,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2018,11]]}},"alternative-id":["sym10110655"],"URL":"https:\/\/doi.org\/10.3390\/sym10110655","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2018,11,19]]}}}