{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:30:53Z","timestamp":1772908253161,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003708","name":"Korea Institute of Science and Technology Information","doi-asserted-by":"publisher","award":["K24L4M1C2"],"award-info":[{"award-number":["K24L4M1C2"]}],"id":[{"id":"10.13039\/501100003708","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003708","name":"Korea Institute of Science and Technology Information","doi-asserted-by":"publisher","award":["K24L4M1C2"],"award-info":[{"award-number":["K24L4M1C2"]}],"id":[{"id":"10.13039\/501100003708","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003708","name":"Korea Institute of Science and Technology Information","doi-asserted-by":"publisher","award":["K24L4M1C2"],"award-info":[{"award-number":["K24L4M1C2"]}],"id":[{"id":"10.13039\/501100003708","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003708","name":"Korea Institute of Science and Technology Information","doi-asserted-by":"publisher","award":["K24L4M1C2"],"award-info":[{"award-number":["K24L4M1C2"]}],"id":[{"id":"10.13039\/501100003708","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008783","name":"National Research Council of Science and Technology","doi-asserted-by":"publisher","award":["CAP22053-000"],"award-info":[{"award-number":["CAP22053-000"]}],"id":[{"id":"10.13039\/501100008783","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008783","name":"National Research Council of Science and Technology","doi-asserted-by":"publisher","award":["CAP22053-000"],"award-info":[{"award-number":["CAP22053-000"]}],"id":[{"id":"10.13039\/501100008783","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008783","name":"National Research Council of Science and Technology","doi-asserted-by":"publisher","award":["CAP22053-000"],"award-info":[{"award-number":["CAP22053-000"]}],"id":[{"id":"10.13039\/501100008783","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008783","name":"National Research Council of Science and Technology","doi-asserted-by":"publisher","award":["CAP22053-000"],"award-info":[{"award-number":["CAP22053-000"]}],"id":[{"id":"10.13039\/501100008783","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008783","name":"National Research Council of Science and Technology","doi-asserted-by":"publisher","award":["CAP22053-000"],"award-info":[{"award-number":["CAP22053-000"]}],"id":[{"id":"10.13039\/501100008783","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-025-04651-7","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T09:33:48Z","timestamp":1737624828000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Error-correctable efficient quantum homomorphic encryption using Calderbank\u2013Shor\u2013Steane codes"],"prefix":"10.1007","volume":"24","author":[{"given":"IlKwon","family":"Sohn","sequence":"first","affiliation":[]},{"given":"Boseon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Kwangil","family":"Bae","sequence":"additional","affiliation":[]},{"given":"Wooyeong","family":"Song","sequence":"additional","affiliation":[]},{"given":"Wonhyuk","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,23]]},"reference":[{"key":"4651_CR1","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-10665-1_63","volume-title":"Cloud computing","author":"L Qian","year":"2009","unstructured":"Qian, L., Luo, Z., Du, Y., Guo, L.: Cloud computing: an overview. In: Jaatun, M.G., Zhao, G., Rong, C. (eds.) Cloud computing, pp. 626\u2013631. Springer, Berlin, Heidelberg (2009)"},{"key":"4651_CR2","doi-asserted-by":"publisher","unstructured":"Chen, D., Zhao, H.: Data security and privacy protection issues in cloud computing. In: 2012 International Conference on Computer Science and Electronics Engineering, vol. 1, pp. 647\u2013651 (2012). https:\/\/doi.org\/10.1109\/ICCSEE.2012.193","DOI":"10.1109\/ICCSEE.2012.193"},{"key":"4651_CR3","doi-asserted-by":"publisher","unstructured":"Zhao, F., Li, C., Liu, C.F.: A cloud computing security solution based on fully homomorphic encryption. In: 16th International Conference on Advanced Communication Technology, pp. 485\u2013488 (2014). https:\/\/doi.org\/10.1109\/ICACT.2014.6779008","DOI":"10.1109\/ICACT.2014.6779008"},{"issue":"11","key":"4651_CR4","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L., et al.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"key":"4651_CR5","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Providing Sound Foundations for Cryptography: on the Work of Shafi Goldwasser and Silvio Micali, pp. 173\u2013201 (2019)"},{"issue":"4","key":"4651_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4651_CR7","unstructured":"Benaloh, J.: Verifiable secret-ballot elections. PhD thesis, Yale University, Department of Computer Science (1987)"},{"key":"4651_CR8","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Proceedings of the 5th ACM Conference on Computer and Communications Security, pp. 59\u201366 (1998)","DOI":"10.1145\/288090.288106"},{"key":"4651_CR9","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Advances in Cryptology-EUROCRYPT\u201998: International Conference on the Theory and Application of Cryptographic Techniques Espoo, Finland, May 31\u2013June 4, 1998 Proceedings 17, pp. 308\u2013318. Springer (1998)","DOI":"10.1007\/BFb0054135"},{"key":"4651_CR10","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 223\u2013238, Springer (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"4651_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, Proceedings 2, pp. 325\u2013341, Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"4651_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"4651_CR13","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012)"},{"issue":"3","key":"4651_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"issue":"12","key":"4651_CR15","doi-asserted-by":"publisher","first-page":"3675","DOI":"10.1007\/s11128-013-0626-5","volume":"12","author":"M Liang","year":"2013","unstructured":"Liang, M.: Symmetric quantum fully homomorphic encryption with perfect security. Quantum Inform. Process. 12(12), 3675\u20133687 (2013)","journal-title":"Quantum Inform. Process."},{"key":"4651_CR16","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Jeffery, S.: Quantum homomorphic encryption for circuits of low t-gate complexity. In: Annual Cryptology Conference, pp. 609\u2013629, Springer (2015)","DOI":"10.1007\/978-3-662-48000-7_30"},{"issue":"8","key":"4651_CR17","doi-asserted-by":"publisher","first-page":"2749","DOI":"10.1007\/s11128-015-1034-9","volume":"14","author":"M Liang","year":"2015","unstructured":"Liang, M.: Quantum fully homomorphic encryption scheme based on universal quantum circuit. Quantum Inform. Process. 14(8), 2749\u20132759 (2015)","journal-title":"Quantum Inform. Process."},{"issue":"4","key":"4651_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.042334","volume":"98","author":"Y Ouyang","year":"2018","unstructured":"Ouyang, Y., Tan, S.-H., Fitzsimons, J.F.: Quantum homomorphic encryption from quantum codes. Phys. Rev. A 98(4), 042334 (2018)","journal-title":"Phys. Rev. A"},{"key":"4651_CR19","first-page":"0785","volume":"18","author":"C-Y Lai","year":"2018","unstructured":"Lai, C.-Y., Chung, K.-M.: On statistically-secure quantum homomorphic encryption. Quantum Inform. Comput. 18, 0785 (2018)","journal-title":"Quantum Inform. Comput."},{"issue":"1","key":"4651_CR20","doi-asserted-by":"publisher","first-page":"33467","DOI":"10.1038\/srep33467","volume":"6","author":"S-H Tan","year":"2016","unstructured":"Tan, S.-H., Kettlewell, J.A., Ouyang, Y., Chen, L., Fitzsimons, J.F.: A quantum approach to homomorphic encryption. Sci. Rep. 6(1), 33467 (2016)","journal-title":"Sci. Rep."},{"key":"4651_CR21","doi-asserted-by":"crossref","unstructured":"Dulek, Y., Schaffner, C., Speelman, F.: Quantum homomorphic encryption for polynomial-sized circuits. In: Advances in Cryptology\u2013CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, Proceedings, Part III 36, pp. 3\u201332, Springer (2016)","DOI":"10.1007\/978-3-662-53015-3_1"},{"issue":"4","key":"4651_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.042308","volume":"97","author":"S-H Tan","year":"2018","unstructured":"Tan, S.-H., Ouyang, Y., Rohde, P.P.: Practical somewhat-secure quantum somewhat-homomorphic encryption with coherent states. Phys. Rev. A 97(4), 042308 (2018)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"4651_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.013332","volume":"2","author":"Y Ouyang","year":"2020","unstructured":"Ouyang, Y., Tan, S.-H., Fitzsimons, J., Rohde, P.P.: Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security. Phys. Rev. Res. 2(1), 013332 (2020)","journal-title":"Phys. Rev. Res."},{"key":"4651_CR24","unstructured":"Ouyang, Y., Rohde, P.P.: A general framework for the composition of quantum homomorphic encryption$$\\backslash $$ & quantum error correction. arXiv preprint arXiv:2204.10471 (2022)"},{"key":"4651_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.94.032329","volume":"94","author":"SJ Devitt","year":"2016","unstructured":"Devitt, S.J.: Performing quantum computing experiments in the cloud. Phys. Rev. A 94, 032329 (2016)","journal-title":"Phys. Rev. A"},{"issue":"7029","key":"4651_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1038\/nature03350","volume":"434","author":"E Knill","year":"2005","unstructured":"Knill, E.: Quantum computing with realistically noisy devices. Nature 434(7029), 39\u201344 (2005)","journal-title":"Nature"},{"issue":"2","key":"4651_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.95.022313","volume":"95","author":"C Chamberland","year":"2017","unstructured":"Chamberland, C., Jochym-O\u2019Connor, T., Laflamme, R.: Overhead analysis of universal concatenated quantum codes. Phys. Rev. A 95(2), 022313 (2017)","journal-title":"Phys. Rev. A"},{"key":"4651_CR28","unstructured":"Fowler, A.G., Gidney, C.: Low overhead quantum computation using lattice surgery. arXiv preprint arXiv:1808.06709 (2018)"},{"issue":"5","key":"4651_CR29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.129.050504","volume":"129","author":"MA Tremblay","year":"2022","unstructured":"Tremblay, M.A., Delfosse, N., Beverland, M.E.: Constant-overhead quantum error correction with thin planar connectivity. Phys. Rev. Lett. 129(5), 050504 (2022)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"4651_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010315","volume":"3","author":"K Noh","year":"2022","unstructured":"Noh, K., Chamberland, C., Brand\u00e3o, F.G.: Low-overhead fault-tolerant quantum error correction with the surface-gkp code. PRX Quantum 3(1), 010315 (2022)","journal-title":"PRX Quantum"},{"key":"4651_CR31","doi-asserted-by":"publisher","first-page":"1961","DOI":"10.1007\/s10623-018-00597-3","volume":"87","author":"C-Y Lai","year":"2019","unstructured":"Lai, C.-Y., Chung, K.-M.: Quantum encryption and generalized Shannon impossibility. Des. Codes Cryptogr. 87, 1961\u20131972 (2019)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"4651_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.117.010501","volume":"117","author":"C Chamberland","year":"2016","unstructured":"Chamberland, C., Jochym-O\u2019Connor, T., Laflamme, R.: Thresholds for universal concatenated quantum codes. Phys. Rev. Lett. 117(1), 010501 (2016)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"4651_CR33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.112.010505","volume":"112","author":"T Jochym-O\u2019Connor","year":"2014","unstructured":"Jochym-O\u2019Connor, T., Laflamme, R.: Using concatenated quantum codes for universal fault-tolerant quantum gates. Phys. Rev. Lett. 112(1), 010505 (2014)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"4651_CR34","volume":"6","author":"TJ Yoder","year":"2016","unstructured":"Yoder, T.J., Takagi, R., Chuang, I.L.: Universal fault-tolerant gates on concatenated stabilizer codes. Phys. Rev. X 6(3), 031039 (2016)","journal-title":"Phys. Rev. X"},{"issue":"2","key":"4651_CR35","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022316","volume":"71","author":"S Bravyi","year":"2005","unstructured":"Bravyi, S., Kitaev, A.: Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71(2), 022316 (2005)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"4651_CR36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.92.062309","volume":"92","author":"P Webster","year":"2015","unstructured":"Webster, P., Bartlett, S.D., Poulin, D.: Reducing the overhead for quantum computation when noise is biased. Phys. Rev. A 92(6), 062309 (2015)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"4651_CR37","doi-asserted-by":"publisher","first-page":"3302","DOI":"10.1038\/s41598-019-39439-0","volume":"9","author":"I Sohn","year":"2019","unstructured":"Sohn, I., Bang, J., Heo, J.: Dynamic concatenation of quantum error correction in integrated quantum computing architecture. Sci. Rep. 9(1), 3302 (2019)","journal-title":"Sci. Rep."},{"issue":"2","key":"4651_CR38","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.W.: Good quantum error-correcting codes exist. Phys. Rev. A 54(2), 1098 (1996)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"4651_CR39","doi-asserted-by":"publisher","first-page":"4741","DOI":"10.1103\/PhysRevA.54.4741","volume":"54","author":"AM Steane","year":"1996","unstructured":"Steane, A.M.: Simple quantum error-correcting codes. Phys. Rev. A 54(6), 4741 (1996)","journal-title":"Phys. Rev. A"},{"issue":"11","key":"4651_CR40","doi-asserted-by":"publisher","first-page":"2252","DOI":"10.1103\/PhysRevLett.78.2252","volume":"78","author":"AM Steane","year":"1997","unstructured":"Steane, A.M.: Active stabilization, quantum computation, and quantum state synthesis. Phys. Rev. Lett. 78(11), 2252 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"7949","key":"4651_CR41","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1038\/s41586-022-05434-1","volume":"614","author":"AI Google Quantum","year":"2023","unstructured":"Google Quantum, A.I.: Suppressing quantum errors by scaling a surface code logical qubit. Nature 614(7949), 676\u2013681 (2023)","journal-title":"Nature"},{"issue":"3","key":"4651_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"issue":"6","key":"4651_CR43","first-page":"18","volume":"52","author":"U Mahadev","year":"2020","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. SIAM J. Comput. 52(6), 18\u2013189 (2020)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"4651_CR44","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1103\/PhysRevA.51.1015","volume":"51","author":"DP DiVincenzo","year":"1995","unstructured":"DiVincenzo, D.P.: Two-bit gates are universal for quantum computation. Phys. Rev. A 51(2), 1015 (1995)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"4651_CR45","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"4651_CR46","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1103\/PhysRevLett.75.346","volume":"75","author":"S Lloyd","year":"1995","unstructured":"Lloyd, S.: Almost any quantum logic gate is universal. Phys. Rev. Lett. 75(2), 346 (1995)","journal-title":"Phys. Rev. Lett."},{"key":"4651_CR47","unstructured":"Knill, E.: Approximation by quantum circuits. arXiv preprint arXiv:quant-ph\/9508006 (1995)"},{"issue":"6","key":"4651_CR48","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1070\/RM1997v052n06ABEH002155","volume":"52","author":"AY Kitaev","year":"1997","unstructured":"Kitaev, A.Y.: Quantum computations: algorithms and error correction. Rus. Math. Surv. 52(6), 1191 (1997)","journal-title":"Rus. Math. Surv."},{"issue":"6760","key":"4651_CR49","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1038\/46503","volume":"402","author":"D Gottesman","year":"1999","unstructured":"Gottesman, D., Chuang, I.L.: Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402(6760), 390\u2013393 (1999)","journal-title":"Nature"},{"key":"4651_CR50","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1103\/RevModPhys.87.307","volume":"87","author":"BM Terhal","year":"2015","unstructured":"Terhal, B.M.: Quantum error correction for quantum memories. Rev. Mod. Phys. 87, 307\u2013346 (2015). https:\/\/doi.org\/10.1103\/RevModPhys.87.307","journal-title":"Rev. Mod. Phys."},{"key":"4651_CR51","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.95.032339","volume":"95","author":"C-Y Lai","year":"2017","unstructured":"Lai, C.-Y., Zheng, Y.-C., Brun, T.A.: Fault-tolerant preparation of stabilizer states for quantum Calderbank\u2013Shor\u2013Steane codes by classical error-correcting codes. Phys. Rev. A 95, 032339 (2017). https:\/\/doi.org\/10.1103\/PhysRevA.95.032339","journal-title":"Phys. Rev. A"},{"issue":"5","key":"4651_CR52","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052330","volume":"71","author":"V Bergholm","year":"2005","unstructured":"Bergholm, V., Vartiainen, J.J., M\u00f6tt\u00f6nen, M., Salomaa, M.M.: Quantum circuits with uniformly controlled one-qubit gates. Phys. Rev. A 71(5), 052330 (2005)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"4651_CR53","doi-asserted-by":"publisher","first-page":"5445","DOI":"10.1038\/s41598-018-23764-x","volume":"8","author":"T Kim","year":"2018","unstructured":"Kim, T., Choi, B.-S.: Efficient decomposition methods for controlled-r n using a single ancillary qubit. Sci. Rep. 8(1), 5445 (2018)","journal-title":"Sci. Rep."},{"key":"4651_CR54","doi-asserted-by":"publisher","first-page":"976","DOI":"10.22331\/q-2023-04-13-976","volume":"7","author":"Y Hu","year":"2023","unstructured":"Hu, Y., Ouyang, Y., Tomamichel, M.: Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption. Quantum 7, 976 (2023)","journal-title":"Quantum"},{"key":"4651_CR55","doi-asserted-by":"crossref","unstructured":"Forlivesi, D., Valentini, L., Chiani, M.: Performance analysis of quantum error-correcting codes via macwilliams identities. arXiv preprint arXiv:2305.01301 (2023)","DOI":"10.1109\/ICC45041.2023.10279096"},{"key":"4651_CR56","doi-asserted-by":"crossref","unstructured":"Dutka, J.: The early history of the factorial function. Archive for history of exact sciences, pp. 225\u2013249 (1991)","DOI":"10.1007\/BF00389433"},{"key":"4651_CR57","doi-asserted-by":"crossref","unstructured":"Grassl, M.: Searching for linear codes with large minimum distance. In: Discovering Mathematics with Magma: Reducing the Abstract to the Concrete, pp. 287\u2013313, Springer (2006)","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"4651_CR58","unstructured":"Grassl, M.: Bounds on the minimum distance of additive quantum codes. http:\/\/www.codetables.de (2008)"}],"updated-by":[{"DOI":"10.1007\/s11128-025-04717-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000}}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04651-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04651-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04651-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T05:59:34Z","timestamp":1744955974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04651-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,23]]},"references-count":58,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["4651"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04651-7","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s11128-025-04717-6","asserted-by":"object"}]},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,23]]},"assertion":[{"value":"8 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2025","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The figure 4 has been corrected.","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2025","order":7,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":8,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":9,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11128-025-04717-6","URL":"https:\/\/doi.org\/10.1007\/s11128-025-04717-6","order":10,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This work poses no ethical issues or challenges and is rightfully in line with the format for writing manuscripts or articles.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"All authors consent to participate in this research or paper.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors consent to publish this research or paper.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"28"}}