{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T15:02:38Z","timestamp":1776956558823,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Fujian Province Young and Middle-aged Teacher Education Research Project","award":["JAT231018"],"award-info":[{"award-number":["JAT231018"]}]},{"name":"Open Foundation of State Key Laboratory of Networking and Switching Technology","award":["SKLNST-2024-1-05"],"award-info":[{"award-number":["SKLNST-2024-1-05"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272056"],"award-info":[{"award-number":["62272056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2022J01186"],"award-info":[{"award-number":["2022J01186"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-026-05083-7","type":"journal-article","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:42:58Z","timestamp":1770813778000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum circuit for implementing AES S-box with low costs"],"prefix":"10.1007","volume":"25","author":[{"given":"Hui-Nan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Bin-Bin","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Song","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,11]]},"reference":[{"key":"5083_CR1","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"5083_CR2","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)","journal-title":"Quantum"},{"key":"5083_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813887","volume-title":"Quantum Computing for Computer Scientists","author":"NS Yanofsky","year":"2008","unstructured":"Yanofsky, N.S., Mannucci, M.A.: Quantum Computing for Computer Scientists. Cambridge University Press, Cambridge (2008)"},{"key":"5083_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1989","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400, 97\u2013117 (1989)","journal-title":"Proc. R. Soc. Lond. A"},{"key":"5083_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1098\/rspa.1998.0163","volume":"454","author":"R Jozsa","year":"1998","unstructured":"Jozsa, R.: Quantum algorithms and the Fourier transform. Proc. R. Soc. Lond. A 454, 323\u2013337 (1998)","journal-title":"Proc. R. Soc. Lond. A"},{"key":"5083_CR6","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1103\/RevModPhys.68.733","volume":"68","author":"A Ekert","year":"1996","unstructured":"Ekert, A., Jozsa, R.: Quantum computation and Shor\u2019s factoring algorithm. Rev. Mod. Phys. 68, 733\u2013753 (1996)","journal-title":"Rev. Mod. Phys."},{"key":"5083_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"5083_CR8","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv:1411.4028 (2014)"},{"key":"5083_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2019.106630","volume":"132","author":"A Ajagekar","year":"2020","unstructured":"Ajagekar, A., Humble, T., You, F.: Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems. Comput. Chem. Eng. 132, 106630 (2020)","journal-title":"Comput. Chem. Eng."},{"issue":"8","key":"5083_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-024-4486-x","volume":"68","author":"JJ Su","year":"2025","unstructured":"Su, J.J., Fan, J.C., Wu, S.Y., et al.: Topology-driven quantum architecture search framework. Sci. China Inf. Sci. 68(8), 180507 (2025)","journal-title":"Sci. China Inf. Sci."},{"issue":"5","key":"5083_CR11","first-page":"2400484","volume":"8","author":"SY Wu","year":"2025","unstructured":"Wu, S.Y., Song, Y.Q., Li, R.Z., et al.: Resource-efficient adaptive variational quantum algorithm for combinatorial optimization problems. Adv. Quant. Technol. 8(5), 2400484 (2025)","journal-title":"Adv. Quant. Technol."},{"key":"5083_CR12","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TFUZZ.2024.3435792","volume":"33","author":"SY Wu","year":"2025","unstructured":"Wu, S.Y., Li, R.Z., Song, Y.Q., et al.: Quantum assisted hierarchical fuzzy neural network for image classification. IEEE Trans. Fuzzy Syst. 33, 491\u2013502 (2025)","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"5083_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41, 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"5083_CR14","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1103\/RevModPhys.68.733","volume":"68","author":"A Ekert","year":"1996","unstructured":"Ekert, A., Jozsa, R.: Quantum computation and Shor\u2019s factoring algorithm. Rev. Mod. Phys. 68, 733\u2013753 (1996)","journal-title":"Rev. Mod. Phys."},{"key":"5083_CR15","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"5083_CR16","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1103\/PhysRevA.60.2742","volume":"60","author":"E Biham","year":"1999","unstructured":"Biham, E., Biham, O., Biron, D., et al.: Grover\u2019s quantum search algorithm for an arbitrary initial amplitude distribution. Phys. Rev. A 60, 2742\u20132745 (1999)","journal-title":"Phys. Rev. A"},{"key":"5083_CR17","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26, 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."},{"key":"5083_CR18","unstructured":"Brassard, G., Hoyer, P., Tapp, A.: Quantum algorithm for the collision problem. arXiv:quant-ph\/9705002 (1997)"},{"key":"5083_CR19","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1098\/rspa.1998.0164","volume":"454","author":"R Cleve","year":"1998","unstructured":"Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. Roy. Soc. Lond. A 454, 339\u2013354 (1998)","journal-title":"Proc. Roy. Soc. Lond. A"},{"key":"5083_CR20","unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring. arXiv:quant-ph\/0201067 (2002)"},{"key":"5083_CR21","unstructured":"Kitaev, A.Y.: Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph\/9511026 (1995)"},{"issue":"2","key":"5083_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"5083_CR23","unstructured":"Dworkin, M.J., Barker, E., Nechvatal, J.R., et al.: Advanced Encryption Standard (AES). NIST FIPS PUB 197 (2001)"},{"key":"5083_CR24","unstructured":"Kuwakado, H., Morii, M.: Security on the quantum-type Even-Mansour cipher. In: Proceedings of the 2012 International Symposium on Information Theory and Its Applications (ISITA), pp. 312\u2013316. IEEE (2012)"},{"key":"5083_CR25","doi-asserted-by":"crossref","unstructured":"Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round Feistel cipher and the random permutation. In: Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT), pp. 2682\u20132685. IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513654"},{"key":"5083_CR26","doi-asserted-by":"crossref","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., et al.: Implementing Grover oracles for quantum key search on AES and LowMC. In: Advances in Cryptology-EUROCRYPT 2020, pp. 280\u2013310. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"5083_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.2965697","volume":"1","author":"B Langenberg","year":"2020","unstructured":"Langenberg, B., Pham, H., Steinwandt, R.: Reducing the cost of implementing the advanced encryption standard as a quantum circuit. IEEE Trans. Quant. Eng. 1, 1\u201312 (2020)","journal-title":"IEEE Trans. Quant. Eng."},{"issue":"6","key":"5083_CR28","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., et al.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"5083_CR29","unstructured":"NIST.: Submission requirements and evaluation criteria for the post-quantum cryptography standardization process. NIST Internal Report (2016)"},{"key":"5083_CR30","doi-asserted-by":"crossref","unstructured":"Chen, L., Jordan, S., Liu, Y., et al.: Report on Post-Quantum Cryptography. U.S. Department of Commerce, NIST, Gaithersburg, MD, USA (2016)","DOI":"10.6028\/NIST.IR.8105"},{"key":"5083_CR31","doi-asserted-by":"crossref","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., et al.: Applying Grover\u2019s algorithm to AES: quantum resource estimates. In: Proceedings of the International Workshop on Post-Quantum Cryptography, pp. 29\u201343. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-29360-8_3"},{"key":"5083_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-1864-3","volume":"17","author":"M Almazrooie","year":"2018","unstructured":"Almazrooie, M., Samsudin, A., Abdullah, R., et al.: Quantum reversible circuit of AES-128. Quantum Inf. Process. 17, 1\u201330 (2018)","journal-title":"Quantum Inf. Process."},{"key":"5083_CR33","doi-asserted-by":"crossref","unstructured":"Zou, J., Wei, Z., Sun, S., et al.: Quantum circuit implementations of AES with fewer qubits. In: Advances in Cryptology-ASIACRYPT 2020, pp. 697\u2013726. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-64834-3_24"},{"issue":"4","key":"5083_CR34","doi-asserted-by":"publisher","first-page":"41501","DOI":"10.1007\/s11467-021-1141-2","volume":"17","author":"ZG Wang","year":"2022","unstructured":"Wang, Z.G., Wei, S.J., Long, G.L.: A quantum circuit design of AES requiring fewer quantum qubits and gate operations. Front. Phys. 17(4), 41501 (2022)","journal-title":"Front. Phys."},{"issue":"9","key":"5083_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-022-1921-y","volume":"65","author":"ZQ Li","year":"2022","unstructured":"Li, Z.Q., Cai, B.B., Sun, H.W., et al.: Novel quantum circuit implementation of advanced encryption standard with low costs. Sci. China Phys. Mech. Astronomy 65(9), 290311 (2022)","journal-title":"Sci. China Phys. Mech. Astronomy"},{"key":"5083_CR36","doi-asserted-by":"publisher","first-page":"1171753","DOI":"10.3389\/fphy.2023.1171753","volume":"11","author":"ZQ Li","year":"2023","unstructured":"Li, Z.Q., Gao, F., Qin, S., et al.: New record in the number of qubits for a quantum implementation of AES. Front. Phys. 11, 1171753 (2023)","journal-title":"Front. Phys."},{"key":"5083_CR37","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zhang, F., Lin, D.: Constructing quantum implementations with the minimal T-depth or minimal width and their applications. In: Advances in Cryptology-EUROCRYPT 2025, pp. 155\u2013185. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-91107-1_6"},{"key":"5083_CR38","doi-asserted-by":"crossref","unstructured":"Jang, K., Baksi, A., Kim, H., et al.: Improved quantum analysis of SPECK and LowMC. In: Proceedings of the International Conference on Cryptology in India, pp. 517\u2013540. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22912-1_23"},{"key":"5083_CR39","doi-asserted-by":"crossref","unstructured":"Huang, Z., Sun, S.: Synthesizing quantum circuits of AES with lower T-depth and fewer qubits. In: Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, pp. 614\u2013644. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22969-5_21"},{"key":"5083_CR40","doi-asserted-by":"crossref","unstructured":"Boyar, J., Peralta, R.: A small depth-16 circuit for the AES S-box. In: Proceedings of the IFIP International Information Security Conference, pp. 287\u2013298. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-30436-1_24"},{"key":"5083_CR41","doi-asserted-by":"crossref","unstructured":"Liu, Q., Preneel, B., Zhao, Z., et al.: Improved quantum circuits for AES: reducing the depth and the number of qubits. In: Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, pp. 67-98. Springer, Singapore (2023)","DOI":"10.1007\/978-981-99-8727-6_3"},{"key":"5083_CR42","doi-asserted-by":"publisher","first-page":"1582819","DOI":"10.3389\/fphy.2025.1582819","volume":"13","author":"LL Jiang","year":"2025","unstructured":"Jiang, L.L., Cai, B.B., Gao, F., et al.: Constructing resource-efficient quantum circuits for AES. Front. Phys. 13, 1582819 (2025)","journal-title":"Front. Phys."},{"key":"5083_CR43","doi-asserted-by":"crossref","unstructured":"Wolkerstorfer, J., Oswald, E., Lamberger, M.: An ASIC implementation of the AES S-boxes. In: Topics in Cryptology-CT-RSA 2002, pp. 67\u201378. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45760-7_6"},{"issue":"2","key":"5083_CR44","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s11128-025-04647-3","volume":"24","author":"SM Cho","year":"2025","unstructured":"Cho, S.M., Lee, C., Seo, S.H.: Quantum circuit designs of efficient squaring. Quantum Inf. Process. 24(2), 35 (2025)","journal-title":"Quantum Inf. Process."},{"key":"5083_CR45","doi-asserted-by":"crossref","unstructured":"Xiang, Z., Zeng, X., Lin, D., et al.: Optimizing implementations of linear layers. IACR Trans. Symmetric Cryptol. (2020)","DOI":"10.46586\/tosc.v2020.i2.120-145"},{"key":"5083_CR46","unstructured":"Chun, M., Baksi, A., Chattopadhyay, A.: Dorcis: depth optimized quantum implementation of substitution boxes. Cryptology ePrint Archive (2023)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05083-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-026-05083-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05083-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T10:52:02Z","timestamp":1771843922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-026-05083-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,11]]},"references-count":46,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["5083"],"URL":"https:\/\/doi.org\/10.1007\/s11128-026-05083-7","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,11]]},"assertion":[{"value":"4 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2026","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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"59"}}