{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:57:23Z","timestamp":1765371443272,"version":"3.46.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032133007","type":"print"},{"value":"9783032133014","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-13301-4_17","type":"book-chapter","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:35Z","timestamp":1765357955000},"page":"390-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practically Implementable Minimal Universal Gate Sets for\u00a0Multi-qudit Systems with\u00a0Cryptographic Validation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7575-5064","authenticated-orcid":false,"given":"Anisha","family":"Dutta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8655-1101","authenticated-orcid":false,"given":"Sayantan","family":"Chakraborty","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5994-0935","authenticated-orcid":false,"given":"Chandan","family":"Goswami","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7768-4629","authenticated-orcid":false,"given":"Avishek","family":"Adhikari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"17_CR1","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge university press (2010)"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A. Am. Phys. Soc. (1995). https:\/\/doi.org\/10.1103\/PhysRevA.52.3457","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"17_CR3","unstructured":"Barenco, A.: A universal two-bit gate for quantum computation. In: Proceedings: Mathematical and Physical Sciences. Royal Society (1995)"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Deutsch, D.E., Barenco, A., Ekert, A.: Universality in quantum computation. In: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences (1995). https:\/\/doi.org\/10.1098\/rspa.1995.0065","DOI":"10.1098\/rspa.1995.0065"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Deutsch, D.E., Barenco, A., Ekert, A.: Universality in quantum computation. In: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences. The Royal Society (1995). https:\/\/doi.org\/10.1098\/rspa.1995.0065","DOI":"10.1098\/rspa.1995.0065"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Yu, A.: Quantum computations: algorithms and error correction. In: Russian Mathematical Surveys (1996). https:\/\/doi.org\/10.1070\/RM1997v052n06ABEH002155","DOI":"10.1070\/RM1997v052n06ABEH002155"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Fischer, L.E., et al.: Universal qudit gate synthesis for transmons. In: PRX Quantum. American Physical Society (2023). https:\/\/doi.org\/10.1103\/PRXQuantum.4.030327","DOI":"10.1103\/PRXQuantum.4.030327"},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Boykin, P.O., Mor, T., Pulver, M., Roychowdhury, V., Vatan, F.: A new universal and fault-tolerant quantum basis. Inf. Process. Lett. 75, 101\u2013107 (2000) https:\/\/doi.org\/10.1016\/S0020-0190(00)00084-3","DOI":"10.1016\/S0020-0190(00)00084-3"},{"key":"17_CR9","unstructured":"Boykin, P.O., Mor, T., Pulver, M., Roychowdhury, V., Vatan, F.: On Universal and Fault-Tolerant Quantum Computing. quant-ph\/9906054 (1999)"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Cafaro, C., Mancini, S.: A geometric algebra perspective on quantum computational gates and universality in quantum computing. In: Advances in Applied Clifford Algebras. Springer Science and Business Media LLC (2011). https:\/\/doi.org\/10.1007\/s00006-010-0269-x","DOI":"10.1007\/s00006-010-0269-x"},{"key":"17_CR11","unstructured":"Havel, T.F., Doran, C.J.L.: Geometric algebra in quantum information processing. quant-ph\/0004031 (2000)"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Somaroo, S.S., Cory, D.G., Havel, T.F.: Expressing the operations of quantum computing in multiparticle geometric algebra. Phys. Lett. A. 240, 1\u20137. Elsevier BV (1998). https:\/\/doi.org\/10.1016\/S0375-9601(98)00010-3","DOI":"10.1016\/S0375-9601(98)00010-3"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Vlasov, A.Y.: Clifford algebras and universal sets of quantum gates. Phys. Rev. A. Am. Phys. Soc. (APS) 63, 054302 (2001). https:\/\/doi.org\/10.1103\/physreva.63.054302","DOI":"10.1103\/physreva.63.054302"},{"key":"17_CR14","unstructured":"Shi, Y.: Both Toffoli and Controlled-NOT need little help to do universal quantum computation. quant-ph\/0205115 (2002)"},{"key":"17_CR15","unstructured":"Narvaez, C.E.Q.: Universality for Sets of Three-Valued Qubit Gates. arXiv preprint arXiv:2109.07282 (2021)"},{"key":"17_CR16","unstructured":"Li, C.-K., Roberts, R., Yin, X.: Decomposition of unitary matrices and quantum gates. arxiv:1210.7366 (2012)"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Vartiainen, J.J., M\u00f6tt\u00f6\u00f6nen, M., Salomaa, M.M.: Efficient decomposition of quantum gates. Phys. Rev. Lett. 92, 177902 (2004) https:\/\/doi.org\/10.1103\/physrevlett.92.177902","DOI":"10.1103\/physrevlett.92.177902"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Reck, M., Zeilinger, A., Bernstein, H.J., Bertani, P.: Experimental realization of any discrete unitary operator. Phys. Rev. Lett. Am. Phys. Soc. 73, 58 (1992). https:\/\/doi.org\/10.1103\/PhysRevLett.73.58","DOI":"10.1103\/PhysRevLett.73.58"},{"issue":"11","key":"17_CR19","doi-asserted-by":"publisher","first-page":"3515","DOI":"10.1007\/s00023-017-0604-z","volume":"18","author":"A Sawicki","year":"2017","unstructured":"Sawicki, A., Karnas, K.: Universality of Single-Qudit Gates. Ann. Henri Poincar\u00e9 18(11), 3515\u20133552 (2017). https:\/\/doi.org\/10.1007\/s00023-017-0604-z","journal-title":"Ann. Henri Poincar\u00e9"},{"key":"17_CR20","unstructured":"Hulse, A., Liu, H., Marvian, I.: A framework for semi-universality: semi-universality of 3-Qudit SU(d)-invariant gates. arxiv:2407.21249"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Glaudell, A.N., Ross, N.J., van de Wetering, J., Yeh, L.: Qutrit metaplectic gates are a subset of clifford+T. In: Proceedings of the Theory of Quantum Computation Conference. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPICS.TQC.2022.12","DOI":"10.4230\/LIPICS.TQC.2022.12"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Amaro-Alcal\u00e1, D., Sanders, B.C., de Guise, H.: Randomised benchmarking for universal Qudit gates. New J. Phys. 26, 073052 (2024). https:\/\/doi.org\/10.1088\/1367-2630\/ad6635","DOI":"10.1088\/1367-2630\/ad6635"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Ivanov, S.S., Tonchev, H.S., Vitanov, N.V.: Time-efficient implementation of quantum search with Qudits. Phys. Rev. A. Am. Phys. Soc. 85, 062321 (2012). https:\/\/doi.org\/10.1103\/PhysRevA.85.062321","DOI":"10.1103\/PhysRevA.85.062321"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Wang, S., et al.: Proof-of-principle experimental realization of a qubit-like Qudit-based quantum key distribution scheme. Quantum Sci. Technol. 3, 025006. IOP Publishing (2018). https:\/\/doi.org\/10.1088\/2058-9565\/aaace4","DOI":"10.1088\/2058-9565\/aaace4"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Lu, Y., Ding, G.: A novel quantum security multi-party extremum protocol in a d-dimensional quantum system. Phys. Scripta 99, 095111. IOP Publishing (2024). https:\/\/doi.org\/10.1088\/1402-4896\/ad6aee","DOI":"10.1088\/1402-4896\/ad6aee"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Sutradhar, K., Om, H.: An efficient simulation for quantum secure multiparty computation. Sci. Rep. (2021). https:\/\/doi.org\/10.1038\/s41598-021-81799-z","DOI":"10.1038\/s41598-021-81799-z"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Keet, A., Fortescue, B., Markham, D., Sanders, B.C.: Quantum secret sharing with Qudit graph states. Phys. Rev. A. Am. Phys. Soc. (APS) 82, 062315 (2010). https:\/\/doi.org\/10.1103\/PhysRevA.82.062315","DOI":"10.1103\/PhysRevA.82.062315"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Tavakoli, A., Herbauts, I., Ukowski, M., Bourennane, M.: Secret sharing with a single $$d$$-level quantum system. Phys. Rev. A. Am. Phys. Soc. 92, 030302 (2015). https:\/\/doi.org\/10.1103\/PhysRevA.92.030302","DOI":"10.1103\/PhysRevA.92.030302"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"McMahon, D.: Quantum Gates and Circuits. In: Quantum Computing Explained (2007). https:\/\/doi.org\/10.1002\/9780470181386.ch8","DOI":"10.1002\/9780470181386.ch8"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Mandilara, A., Dellen, B., Jaekel, U., et al.: Classification of data with a Qudit, a geometric approach. Quantum Mach. Intell. 6, 17 (2024). https:\/\/doi.org\/10.1007\/s42484-024-00146-3","DOI":"10.1007\/s42484-024-00146-3"},{"key":"17_CR31","doi-asserted-by":"publisher","unstructured":"Roca-Jerat, S., Rom\u00e1n-Roche, J., Zueco, D.: Qudit machine learning. In: Machine Learning: Science and Technology. IOP Publishing (2024). https:\/\/doi.org\/10.1088\/2632-2153\/ad360d","DOI":"10.1088\/2632-2153\/ad360d"},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"DiVincenzo, D.P.: Quantum gates and circuits. In: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences. The Royal Society (1998). https:\/\/doi.org\/10.1098\/rspa.1998.0159","DOI":"10.1098\/rspa.1998.0159"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Feynman, R.P.: Quantum mechanical computers. In: Optics News. Optica Publishing Group (1985). https:\/\/doi.org\/10.1364\/ON.11.2.000011","DOI":"10.1364\/ON.11.2.000011"},{"key":"17_CR34","doi-asserted-by":"publisher","unstructured":"Thew, R.T., Nemoto, K., White, A.G., Munro, W.J.: Qudit quantum-state tomography. Phys. Rev. A. Am. Phys. Soc. 66, 012303 (2002). https:\/\/doi.org\/10.1103\/PhysRevA.66.012303","DOI":"10.1103\/PhysRevA.66.012303"},{"key":"17_CR35","doi-asserted-by":"publisher","unstructured":"Howard, M., Vala, J.: Qudit versions of the qubit $$\\pi \/8$$ gate. Phys. Rev. A. Am. Phys. Soc. 86, 022316 (2012). https:\/\/doi.org\/10.1103\/PhysRevA.86.022316","DOI":"10.1103\/PhysRevA.86.022316"},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Du, F.-F., Ren, X.-M., Ma, M., Fan, G.: Qudit-based high-dimensional controlled-not gate. Opt. Lett. 49, 1229\u20131232. Optica Publishing Group (2024). https:\/\/doi.org\/10.1364\/OL.518336","DOI":"10.1364\/OL.518336"},{"key":"17_CR37","doi-asserted-by":"publisher","unstructured":"Wang, Y., Hu, Z., Sanders, B.C., Kais, S.: Qudits and High-Dimensional Quantum Computing. Front. Phys. (2020). https:\/\/doi.org\/10.3389\/fphy.2020.589504","DOI":"10.3389\/fphy.2020.589504"},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"Prasad, S., Scully, M.O., Martienssen, W.: A quantum description of the beam splitter. Optics Commun. 62, 139\u2013145 (1987). https:\/\/doi.org\/10.1016\/0030-4018(87)90015-0","DOI":"10.1016\/0030-4018(87)90015-0"},{"key":"17_CR39","doi-asserted-by":"publisher","unstructured":"Gr\u00f6blacher, S., Jennewein, T., Vaziri, A., Weihs, G., Zeilinger, A.: Experimental quantum cryptography with qutrits. New J. Phys. 8, 75 (2006). https:\/\/doi.org\/10.1088\/1367-2630\/8\/5\/075","DOI":"10.1088\/1367-2630\/8\/5\/075"},{"key":"17_CR40","doi-asserted-by":"publisher","unstructured":"van de Wetering, J., Yeh, L.: Building qutrit diagonal gates from phase gadgets. In: Electronic Proceedings in Theoretical Computer Science (2023). https:\/\/doi.org\/10.4204\/eptcs.394.4","DOI":"10.4204\/eptcs.394.4"},{"key":"17_CR41","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s11128-025-04949-6","volume":"24","author":"S Ghosh","year":"2025","unstructured":"Ghosh, S., Adhikari, A.: An efficient quantum secret sharing scheme for general access structure based on a novel partitioning technique. Quantum Inf. Process. 24, 328 (2025). https:\/\/doi.org\/10.1007\/s11128-025-04949-6","journal-title":"Quantum Inf. Process."},{"key":"17_CR42","doi-asserted-by":"publisher","unstructured":"Ghosh, S., Adhikari, A.A.: $$d (\\ge 2)$$-level $$(t,n)$$ threshold quantum secret reconstruction scheme using symmetric entanglements. Quantum Inf. Process. 24, 64 (2025). https:\/\/doi.org\/10.1007\/s11128-025-04679-9","DOI":"10.1007\/s11128-025-04679-9"},{"key":"17_CR43","doi-asserted-by":"publisher","unstructured":"Adhikari, M.R., Adhikari, A.: Basic Modern Algebra with Applications. Springer, New Delhi (2014). https:\/\/doi.org\/10.1007\/978-81-322-1599-8","DOI":"10.1007\/978-81-322-1599-8"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13301-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T10:01:44Z","timestamp":1765360904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13301-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"ISBN":["9783032133007","9783032133014"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13301-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"11 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that they are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneshwar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}