{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:40:23Z","timestamp":1768347623980,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T00:00:00Z","timestamp":1697587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T00:00:00Z","timestamp":1697587200000},"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":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-04112-z","type":"journal-article","created":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T20:36:43Z","timestamp":1697661403000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A dynamic programming approach to multi-objective logic synthesis of quantum circuits"],"prefix":"10.1007","volume":"22","author":[{"given":"Arezoo","family":"Rajaei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2017-4369","authenticated-orcid":false,"given":"Mahboobeh","family":"Houshmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyyed Abed","family":"Hosseini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,18]]},"reference":[{"issue":"1","key":"4112_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/JPROC.1998.658762","volume":"86","author":"GE Moore","year":"1998","unstructured":"Moore, G.E.: Cramming more components onto integrated circuits. Proc. IEEE 86(1), 82\u201385 (1998)","journal-title":"Proc. IEEE"},{"key":"4112_CR2","volume-title":"Explorations in Quantum Computing. Texts in Computer Science","author":"CP Williams","year":"2010","unstructured":"Williams, C.P.: Explorations in Quantum Computing. Texts in Computer Science. Springer, London (2010)"},{"issue":"5","key":"4112_CR3","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":"1","key":"4112_CR4","first-page":"27","volume":"4","author":"SS Bullock","year":"2004","unstructured":"Bullock, S.S., Markov, I.L.: Asymptotically optimal circuits for arbitrary $$n$$-qubit diagonal computations. Quantum Inf. Comput. 4(1), 27\u201347 (2004)","journal-title":"Quantum Inf. Comput."},{"issue":"3","key":"4112_CR5","first-page":"262","volume":"11","author":"M Saeedi","year":"2010","unstructured":"Saeedi, M., Arabzadeh, M., Zamani, M.S., Sedighi, M.: Block-based quantum-logic synthesis. Quantum Inf. Comput. J. 11(3), 262\u2013277 (2010)","journal-title":"Quantum Inf. Comput. J."},{"issue":"6","key":"4112_CR6","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TCAD.2005.855930","volume":"25","author":"VV Shende","year":"2006","unstructured":"Shende, V.V., Bullock, S.S., Markov, I.L.: Synthesis of quantum-logic circuits. IEEE Trans. CAD 25(6), 1000\u20131010 (2006)","journal-title":"IEEE Trans. CAD"},{"key":"4112_CR7","first-page":"561","volume":"12","author":"S Lee","year":"2006","unstructured":"Lee, S., Lee, S.-J., Kim, T., Lee, J.-S., Biamonte, J., Perkowski, M.: The cost of quantum gate primitives. J. Multip. Valued Logic Soft Comput. 12, 561\u2013573 (2006)","journal-title":"J. Multip. Valued Logic Soft Comput."},{"issue":"2","key":"4112_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2431211.2431220","volume":"45","author":"M Saeedi","year":"2013","unstructured":"Saeedi, M., Markov, I.L.: Synthesis and optimization of reversible circuits\u2014a survey. ACM Comput. Surv. (CSUR) 45(2), 1\u201334 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"3","key":"4112_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/TCAD.2007.911334","volume":"27","author":"D Maslov","year":"2008","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M., Negrevergne, C.: Quantum circuit simplification and level compaction. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(3), 436\u2013444 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"3","key":"4112_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11128-010-0201-2","volume":"10","author":"M Saeedi","year":"2011","unstructured":"Saeedi, M., Wille, R., Drechsler, R.: Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Inf. Process. 10(3), 355\u2013377 (2011)","journal-title":"Quantum Inf. Process."},{"key":"4112_CR11","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"4112_CR12","unstructured":"Bennett, C.H.: Quantum cryptography: public key distribution and coin tossing. In: Proceeding of IEEE International Conference on Computer System and Signal Processing New York, pp. 175\u2013179 (1984)"},{"issue":"2","key":"4112_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/5992.908999","volume":"3","author":"G Cybenko","year":"2001","unstructured":"Cybenko, G.: Reducing quantum computations to elementary unitary operations. Comput. Sci. Eng. 3(2), 27\u201332 (2001)","journal-title":"Comput. Sci. Eng."},{"issue":"6","key":"4112_CR14","doi-asserted-by":"publisher","first-page":"062321","DOI":"10.1103\/PhysRevA.69.062321","volume":"69","author":"VV Shende","year":"2004","unstructured":"Shende, V.V., Markov, I.L., Bullock, S.S.: Minimal universal two-qubit controlled-not-based circuits. Phys. Rev. A 69(6), 062321 (2004)","journal-title":"Phys. Rev. A"},{"issue":"13","key":"4112_CR15","doi-asserted-by":"publisher","first-page":"130502","DOI":"10.1103\/PhysRevLett.93.130502","volume":"93","author":"M M\u00f6tt\u00f6nen","year":"2004","unstructured":"M\u00f6tt\u00f6nen, M., Vartiainen, J.J., Bergholm, V., Salomaa, M.M.: Quantum circuits for general multiqubit gates. Phys. Rev. Lett. 93(13), 130502 (2004)","journal-title":"Phys. Rev. Lett."},{"key":"4112_CR16","doi-asserted-by":"publisher","first-page":"052330","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, 052330 (2005)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"4112_CR17","doi-asserted-by":"publisher","first-page":"010301","DOI":"10.1103\/PhysRevA.69.010301","volume":"69","author":"G Vidal","year":"2004","unstructured":"Vidal, G., Dawson, C.M.: Universal quantum circuit for two-qubit transformations with three controlled-not gates. Phys. Rev. A 69(1), 010301 (2004)","journal-title":"Phys. Rev. A"},{"key":"4112_CR18","doi-asserted-by":"crossref","unstructured":"Shende, V.V., Markov, I.L., Bullock, S.S.: Smaller two-qubit circuits for quantum communication and computation, vol. 2, pp. 980\u2013985 (2004)","DOI":"10.1117\/12.542381"},{"issue":"3","key":"4112_CR19","doi-asserted-by":"publisher","first-page":"032315","DOI":"10.1103\/PhysRevA.69.032315","volume":"69","author":"F Vatan","year":"2004","unstructured":"Vatan, F., Williams, C.: Optimal quantum circuits for general two-qubit gates. Phys. Rev. A 69(3), 032315 (2004)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"4112_CR20","first-page":"139","volume":"3","author":"G Song","year":"2003","unstructured":"Song, G., Klappenecker, A.: Optimal realizations of controlled unitary gates. Quantum Inf. Comput. 3(2), 139\u2013155 (2003)","journal-title":"Quantum Inf. Comput."},{"issue":"4","key":"4112_CR21","first-page":"1","volume":"12","author":"M Arabzadeh","year":"2015","unstructured":"Arabzadeh, M., Houshmand, M., Sedighi, M., Zamani, M.S.: Quantum-logic synthesis of Hermitian gates. ACM J. Emerg. Technol. Comput. Syst. (JETC) 12(4), 1\u201315 (2015)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"issue":"3","key":"4112_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629526","volume":"11","author":"M Houshmand","year":"2014","unstructured":"Houshmand, M., Zamani, M.S., Sedighi, M., Arabzadeh, M.: Decomposition of diagonal Hermitian quantum gates using multiple-controlled pauli Z gates. ACM J. Emerg. Technol. Comput. Syst. (JETC) 11(3), 1\u201310 (2014)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"key":"4112_CR23","doi-asserted-by":"crossref","unstructured":"Danos, V., Kashefi, E., Panangaden, P., Perdrix, S.: Extended measurement calculus. Semantic techniques in quantum computation, pp. 235\u2013310 (2009)","DOI":"10.1017\/CBO9781139193313.008"},{"issue":"4","key":"4112_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3064834","volume":"13","author":"M Houshmand","year":"2017","unstructured":"Houshmand, M., Sedighi, M., Zamani, M.S., Marjoei, K.: Quantum circuit synthesis targeting to improve one-way quantum computation pattern cost metrics. ACM J. Emerg. Technol. Comput. Syst. (JETC) 13(4), 1\u201327 (2017)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"issue":"5","key":"4112_CR25","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1103\/PhysRevLett.77.793","volume":"77","author":"AM Steane","year":"1996","unstructured":"Steane, A.M.: Error correcting codes in quantum theory. Phys. Rev. Lett. 77(5), 793 (1996)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"4112_CR26","doi-asserted-by":"publisher","first-page":"012340","DOI":"10.1103\/PhysRevA.73.012340","volume":"73","author":"D Bacon","year":"2006","unstructured":"Bacon, D.: Operator quantum error-correcting subsystems for self-correcting quantum memories. Phys. Rev. A 73(1), 012340 (2006)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"4112_CR27","doi-asserted-by":"publisher","first-page":"020302","DOI":"10.1103\/PhysRevA.83.020302","volume":"83","author":"DS Wang","year":"2011","unstructured":"Wang, D.S., Fowler, A.G., Hollenberg, L.C.L.: Surface code quantum computing with error rates over 1%. Phys. Rev. A 83(2), 020302 (2011)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"4112_CR28","doi-asserted-by":"publisher","first-page":"052312","DOI":"10.1103\/PhysRevA.80.052312","volume":"80","author":"AG Fowler","year":"2009","unstructured":"Fowler, A.G., Stephens, A.M., Groszkowski, P.: High-threshold universal quantum computation on the surface code. Phys. Rev. A 80(5), 052312 (2009)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"4112_CR29","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1109\/TVLSI.2013.2269869","volume":"22","author":"C-C Lin","year":"2013","unstructured":"Lin, C.-C., Chakrabarti, A., Jha, N.K.: FTQLS: fault-tolerant quantum logic synthesis. IEEE Trans. Very Large Scale Integr. VLSI Syst. 22(6), 1350\u20131363 (2013)","journal-title":"IEEE Trans. Very Large Scale Integr. VLSI Syst."},{"issue":"7\u20138","key":"4112_CR30","first-page":"607","volume":"13","author":"V Kliuchnikov","year":"2013","unstructured":"Kliuchnikov, V., Maslov, D., Mosca, M.: Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates. Quantum Inf. Comput. 13(7\u20138), 607\u2013630 (2013)","journal-title":"Quantum Inf. Comput."},{"issue":"3","key":"4112_CR31","doi-asserted-by":"publisher","first-page":"032332","DOI":"10.1103\/PhysRevA.87.032332","volume":"87","author":"B Giles","year":"2013","unstructured":"Giles, B., Selinger, P.: Exact synthesis of multiqubit Clifford+ T circuits. Phys. Rev. A 87(3), 032332 (2013)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"4112_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3501334","volume":"3","author":"T H\u00e4ner","year":"2022","unstructured":"H\u00e4ner, T., Soeken, M.: Lowering the T-depth of quantum circuits via logic network optimization. ACM Trans. Quantum Comput. 3(2), 1\u201315 (2022)","journal-title":"ACM Trans. Quantum Comput."},{"key":"4112_CR33","unstructured":"Hwang, Y.: Fault-tolerant circuit synthesis for universal fault-tolerant quantum computing (2022). arXiv preprint arXiv:2206.02691"},{"issue":"2","key":"4112_CR34","doi-asserted-by":"publisher","first-page":"759","DOI":"10.3390\/app12020759","volume":"12","author":"AM Krol","year":"2022","unstructured":"Krol, A.M., Sarkar, A., Ashraf, I., Al-Ars, Z., Bertels, K.: Efficient decomposition of unitary matrices in quantum circuit compilers. Appl. Sci. 12(2), 759 (2022)","journal-title":"Appl. Sci."},{"key":"4112_CR35","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2011). (10th anniversary edition edition)"},{"issue":"1","key":"4112_CR36","first-page":"81","volume":"6","author":"CM Dawson","year":"2006","unstructured":"Dawson, C.M., Nielsen, M.A.: The Solovay\u2013Kitaev algorithm. Quantum Inf. Comput. 6(1), 81\u201395 (2006)","journal-title":"Quantum Inf. Comput."},{"issue":"19","key":"4112_CR37","doi-asserted-by":"publisher","first-page":"190502","DOI":"10.1103\/PhysRevLett.110.190502","volume":"110","author":"V Kliuchnikov","year":"2013","unstructured":"Kliuchnikov, V., Maslov, D., Mosca, M.: Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits. Phys. Rev. Lett. 110(19), 190502 (2013)","journal-title":"Phys. Rev. Lett."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04112-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-04112-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04112-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T18:16:35Z","timestamp":1698776195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-04112-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,18]]},"references-count":37,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2023,10]]}},"alternative-id":["4112"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-04112-z","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,18]]},"assertion":[{"value":"1 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"384"}}