{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:47:51Z","timestamp":1784206071555,"version":"3.55.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031090042","type":"print"},{"value":"9783031090059","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09005-9_3","type":"book-chapter","created":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:05:55Z","timestamp":1656371155000},"page":"28-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Constructing All Qutrit Controlled Clifford+T gates in\u00a0Clifford+T"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2704-4057","authenticated-orcid":false,"given":"Lia","family":"Yeh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5405-8959","authenticated-orcid":false,"given":"John","family":"van de Wetering","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,28]]},"reference":[{"issue":"5","key":"3_CR1","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/physreva.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457\u20133467 (1995). https:\/\/doi.org\/10.1103\/physreva.52.3457","journal-title":"Phys. Rev. A"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Basu, S., Mandal, S.B., Chakrabarti, A., Sur-Kolay, S., Choudhury, A.K.: An efficient synthesis method for ternary reversible logic. In: 2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2306\u20132309 (2016). https:\/\/doi.org\/10.1109\/ISCAS.2016.7539045","DOI":"10.1109\/ISCAS.2016.7539045"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Beverland, M., Campbell, E., Howard, M., Kliuchnikov, V.: Lower bounds on the non-Clifford resources for quantum computations. Quantum Sci. Technol. 5(3), 035009 (2020). https:\/\/doi.org\/10.1088\/2058-9565\/ab8963","DOI":"10.1088\/2058-9565\/ab8963"},{"key":"3_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.11.021010","volume":"11","author":"MS Blok","year":"2021","unstructured":"Blok, M.S., et al.: Quantum Information Scrambling on a Superconducting Qutrit Processor. Phys. Rev. X 11, 021010 (2021). https:\/\/doi.org\/10.1103\/PhysRevX.11.021010","journal-title":"Phys. Rev. X"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Bocharov, A.: A note on optimality of quantum circuits over metaplectic basis. Quantum Inf. Comput. 18 (2016). https:\/\/doi.org\/10.26421\/QIC18.1-2-1","DOI":"10.26421\/QIC18.1-2-1"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Bocharov, A., Cui, S., Roetteler, M., Svore, K.: Improved quantum ternary arithmetics. Quantum Inf. Comput. 16, 862\u2013884 (2016). https:\/\/doi.org\/10.26421\/QIC16.9-10-8","DOI":"10.26421\/QIC16.9-10-8"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Bocharov, A., Cui, X., Kliuchnikov, V., Wang, Z.: Efficient topological compilation for a weakly integral anyonic model. Phys. Rev. A 93(1) (2016). https:\/\/doi.org\/10.1103\/physreva.93.012313","DOI":"10.1103\/physreva.93.012313"},{"key":"3_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.012306","volume":"96","author":"A Bocharov","year":"2017","unstructured":"Bocharov, A., Roetteler, M., Svore, K.M.: Factoring with qutrits: Shor\u2019s algorithm on ternary and metaplectic quantum architectures. Phys. Rev. A 96, 012306 (2017). https:\/\/doi.org\/10.1103\/PhysRevA.96.012306","journal-title":"Phys. Rev. A"},{"key":"3_CR9","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, 022316 (2005). https:\/\/doi.org\/10.1103\/PhysRevA.71.022316","journal-title":"Phys. Rev. A"},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.113.230501","volume":"113","author":"ET Campbell","year":"2014","unstructured":"Campbell, E.T.: Enhanced fault-tolerant quantum computing in $$d$$-level systems. Phys. Rev. Lett. 113, 230501 (2014). https:\/\/doi.org\/10.1103\/PhysRevLett.113.230501","journal-title":"Phys. Rev. Lett."},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.041021","volume":"2","author":"ET Campbell","year":"2012","unstructured":"Campbell, E.T., Anwar, H., Browne, D.E.: Magic-state distillation in all prime dimensions using quantum reed-muller codes. Phys. Rev. X 2, 041021 (2012). https:\/\/doi.org\/10.1103\/PhysRevX.2.041021","journal-title":"Phys. Rev. X"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Cozzolino, D., Da Lio, B., Bacco, D., Oxenl\u00f8we, L.K.: High-dimensional quantum communication: benefits, progress, and future challenges. Adv. Quantum Technol. 2(12), 1900038 (2019). https:\/\/doi.org\/10.1002\/qute.201900038","DOI":"10.1002\/qute.201900038"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1063\/1.4914941","volume":"56","author":"SX Cui","year":"2015","unstructured":"Cui, S.X., Wang, Z.: Universal quantum computation with metaplectic anyons. J. Math. Phys. 56(3), 032202 (2015). https:\/\/doi.org\/10.1063\/1.4914941","journal-title":"J. Math. Phys."},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Datta, K., Sengupta, I., Rahaman, H.: Group theory based reversible logic synthesis. In: 2012 5th International Conference on Computers and Devices for Communication (CODEC), pp. 1\u20134 (2012). https:\/\/doi.org\/10.1109\/CODEC.2012.6509346","DOI":"10.1109\/CODEC.2012.6509346"},{"key":"3_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.012325","volume":"87","author":"YM Di","year":"2013","unstructured":"Di, Y.M., Wei, H.R.: Synthesis of multivalued quantum logic circuits by elementary gates. Phys. Rev. A 87, 012325 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.87.012325","journal-title":"Phys. Rev. A"},{"issue":"08","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1550121","DOI":"10.1142\/S0218126615501212","volume":"24","author":"F Fan","year":"2015","unstructured":"Fan, F., Yang, G., Yang, G., Hung, W.N.N.: A synthesis method of quantum reversible logic circuit based on elementary qutrit quantum logic gates. J. Circ. Syst. Comput. 24(08), 1550121 (2015). https:\/\/doi.org\/10.1142\/S0218126615501212","journal-title":"J. Circ. Syst. Comput."},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Giles, B., Selinger, P.: Exact synthesis of multiqubit Clifford+T circuits. Phys. Rev. A 87(3) (2013). https:\/\/doi.org\/10.1103\/physreva.87.032332","DOI":"10.1103\/physreva.87.032332"},{"key":"3_CR18","unstructured":"Glaudell, A., J. Ross, N., van de Wetering, J., Yeh, L.: Qutrit metaplectic gates are a subset of Clifford+T. In: 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (In press). https:\/\/arxiv.org\/abs\/2202.09235"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.aop.2019.04.001","volume":"406","author":"AN Glaudell","year":"2019","unstructured":"Glaudell, A.N., Ross, N.J., Taylor, J.M.: Canonical forms for single-qutrit Clifford+T operators. Ann. Phys. 406, 54\u201370 (2019). https:\/\/doi.org\/10.1016\/j.aop.2019.04.001","journal-title":"Ann. Phys."},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Gokhale, P., Baker, J.M., Duckering, C., Brown, N.C., Brown, K.R., Chong, F.T.: Asymptotic improvements to quantum circuits via qutrits. In: Proceedings of the 46th International Symposium on Computer Architecture, June 2019. https:\/\/doi.org\/10.1145\/3307650.3322253","DOI":"10.1145\/3307650.3322253"},{"key":"3_CR21","unstructured":"Gong, X., Wang, Q.: Equivalence of Local Complementation and Euler Decomposition in the Qutrit ZX-calculus, April 2017"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Gosset, D., Kliuchnikov, V., Mosca, M., Russo, V.: An algorithm for the T-count. Quantum Info. Comput. 14(15\u201316), 1261\u20131276 (2014). https:\/\/doi.org\/10.5555\/2685179.2685180","DOI":"10.5555\/2685179.2685180"},{"issue":"10","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1016\/s0960-0779(98)00218-5","volume":"10","author":"D Gottesman","year":"1999","unstructured":"Gottesman, D.: Fault-tolerant quantum computation with higher-dimensional systems. Chaos Solitons Fractals 10(10), 1749\u20131758 (1999). https:\/\/doi.org\/10.1016\/s0960-0779(98)00218-5","journal-title":"Chaos Solitons Fractals"},{"issue":"11","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-017-1735-3","volume":"16","author":"M Haghparast","year":"2017","unstructured":"Haghparast, M., Wille, R., Monfared, A.T.: Towards quantum reversible ternary coded decimal adder. Quantum Inf. Process. 16(11), 1\u201325 (2017). https:\/\/doi.org\/10.1007\/s11128-017-1735-3","journal-title":"Quantum Inf. Process."},{"key":"3_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.118.090501","volume":"118","author":"M Howard","year":"2017","unstructured":"Howard, M., Campbell, E.: Application of a resource theory for magic states to fault-tolerant quantum computing. Phys. Rev. Lett. 118, 090501 (2017). https:\/\/doi.org\/10.1103\/PhysRevLett.118.090501","journal-title":"Phys. Rev. Lett."},{"key":"3_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.022316","volume":"86","author":"M Howard","year":"2012","unstructured":"Howard, M., Vala, J.: Qudit versions of the qubit $$\\pi \/8$$ gate. Phys. Rev. A 86, 022316 (2012). https:\/\/doi.org\/10.1103\/PhysRevA.86.022316","journal-title":"Phys. Rev. A"},{"key":"3_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.012312","volume":"80","author":"R Ionicioiu","year":"2009","unstructured":"Ionicioiu, R., Spiller, T., Munro, W.: generalized toffoli gates using qudit catalysis. Phys. Rev. A 80, 012312 (2009). https:\/\/doi.org\/10.1103\/PhysRevA.80.012312","journal-title":"Phys. Rev. A"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.tcs.2006.09.006","volume":"367","author":"FS Khan","year":"2006","unstructured":"Khan, F.S., Perkowski, M.: Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition. Theor. Comput. Sci. 367(3), 336\u2013346 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.09.006","journal-title":"Theor. Comput. Sci."},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Khan, M., Perkowski, M.: Genetic algorithm based synthesis of multi-output ternary functions using quantum cascade of generalized ternary gates. In: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), vol. 2, pp. 2194\u20132201 (2004). https:\/\/doi.org\/10.1109\/CEC.2004.1331169","DOI":"10.1109\/CEC.2004.1331169"},{"issue":"7","key":"3_CR30","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.sysarc.2007.01.007","volume":"53","author":"MHA Khan","year":"2007","unstructured":"Khan, M.H.A., Perkowski, M.A.: Quantum ternary parallel adder\/subtractor with partially-look-ahead carry. J. Syst. Archit. 53(7), 453\u2013464 (2007). https:\/\/doi.org\/10.1016\/j.sysarc.2007.01.007","journal-title":"J. Syst. Archit."},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Kiktenko, E.O., Nikolaeva, A.S., Xu, P., Shlyapnikov, G.V., Fedorov, A.K.: Scalable quantum computing with qudits on a graph. Phys. Rev. A 101(2) (2020). https:\/\/doi.org\/10.1103\/physreva.101.022304","DOI":"10.1103\/physreva.101.022304"},{"issue":"1","key":"3_CR32","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-rn using a single ancillary qubit. Sci. Rep. 8(1), 5445 (2018). https:\/\/doi.org\/10.1038\/s41598-018-23764-x","journal-title":"Sci. Rep."},{"issue":"7\u20138","key":"3_CR33","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 Info. Comput. 13(7\u20138), 607\u2013630 (2013)","journal-title":"Quantum Info. Comput."},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Kole, A., Rani, P.M.N., Datta, K., Sengupta, I., Drechsler, R.: Exact synthesis of ternary reversible functions using ternary toffoli gates. In: 2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL), pp. 179\u2013184 (2017). https:\/\/doi.org\/10.1109\/ISMVL.2017.51","DOI":"10.1109\/ISMVL.2017.51"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Kole, D.K., Rahaman, H., Das, D.K., Bhattacharya, B.B.: Optimal reversible logic circuit synthesis based on a hybrid DFS-BFS technique. In: 2010 International Symposium on Electronic System Design, pp. 208\u2013212 (2010). https:\/\/doi.org\/10.1109\/ISED.2010.47","DOI":"10.1109\/ISED.2010.47"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Lanyon, B.P., et al.: Simplifying quantum logic using higher-dimensional Hilbert spaces. Nat. Phys. 5(2), 134\u2013140 (2009). https:\/\/doi.org\/10.1038\/nphys1150","DOI":"10.1038\/nphys1150"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Mandal, S.B., Chakrabarti, A., Sur-Kolay, S.: Quantum ternary circuit synthesis using projection operations (2012). https:\/\/doi.org\/10.48550\/ARXIV.1205.2390, https:\/\/arxiv.org\/abs\/1205.2390","DOI":"10.48550\/ARXIV.1205.2390"},{"key":"3_CR38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022311","volume":"93","author":"D Maslov","year":"2016","unstructured":"Maslov, D.: Advantages of using relative-phase toffoli gates with an application to multiple control toffoli optimization. Phys. Rev. A 93, 022311 (2016). https:\/\/doi.org\/10.1103\/PhysRevA.93.022311","journal-title":"Phys. Rev. A"},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Maslov, D.: Optimal and asymptotically optimal NCT reversible circuits by the gate types. Quantum Inf. Comput. 16(13 & 14) (2016). https:\/\/doi.org\/10.26421\/qic16.13-14","DOI":"10.26421\/qic16.13-14"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Meuli, G., Soeken, M., Roetteler, M., De Micheli, G.: Enumerating optimal quantum circuits using spectral classification. In: 2020 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20135 (2020). https:\/\/doi.org\/10.1109\/ISCAS45731.2020.9180792","DOI":"10.1109\/ISCAS45731.2020.9180792"},{"key":"3_CR41","doi-asserted-by":"publisher","unstructured":"Moraga, C.: On some basic aspects of ternary reversible and quantum computing. In: Proceedings of the 2014 IEEE 44th International Symposium on Multiple-Valued Logic, pp. 178\u2013183. ISMVL 2014, IEEE Computer Society, USA (2014). https:\/\/doi.org\/10.1109\/ISMVL.2014.39","DOI":"10.1109\/ISMVL.2014.39"},{"key":"3_CR42","doi-asserted-by":"publisher","unstructured":"Moraga, C.: Quantum p-valued toffoli and deutsch gates with conjunctive or disjunctive mixed polarity control. In: 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), pp. 241\u2013246 (2016). https:\/\/doi.org\/10.1109\/ISMVL.2016.22","DOI":"10.1109\/ISMVL.2016.22"},{"issue":"1","key":"3_CR43","doi-asserted-by":"publisher","first-page":"015003","DOI":"10.1088\/2058-9565\/ac2d3a","volume":"7","author":"M Mosca","year":"2021","unstructured":"Mosca, M., Mukhopadhyay, P.: A polynomial time and space heuristic algorithm for T-count. Quantum Sci. Technol. 7(1), 015003 (2021). https:\/\/doi.org\/10.1088\/2058-9565\/ac2d3a","journal-title":"Quantum Sci. Technol."},{"issue":"2241","key":"3_CR44","doi-asserted-by":"publisher","first-page":"20200187","DOI":"10.1098\/rspa.2020.0187","volume":"476","author":"S Prakash","year":"2020","unstructured":"Prakash, S.: Magic state distillation with the ternary golay code. Proc. R. Soc. A Math. Phys. Eng. Sci. 476(2241), 20200187 (2020). https:\/\/doi.org\/10.1098\/rspa.2020.0187","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"key":"3_CR45","doi-asserted-by":"publisher","unstructured":"Prakash, S., Jain, A., Kapur, B., Seth, S.: Normal form for single-qutrit Clifford+T operators and synthesis of single-qutrit gates. Phys. Rev. A 98(3) (2018). https:\/\/doi.org\/10.1103\/physreva.98.032304","DOI":"10.1103\/physreva.98.032304"},{"key":"3_CR46","doi-asserted-by":"publisher","unstructured":"Ralph, T.C., Resch, K.J., Gilchrist, A.: Efficient toffoli gates using qudits. Phys. Rev. A 75(2) (2007). https:\/\/doi.org\/10.1103\/physreva.75.022313","DOI":"10.1103\/physreva.75.022313"},{"issue":"12","key":"3_CR47","doi-asserted-by":"publisher","first-page":"2050192","DOI":"10.1142\/S0218126620501923","volume":"29","author":"PMN Rani","year":"2020","unstructured":"Rani, P.M.N., Datta, K.: Improved ternary reversible logic synthesis using group theoretic approach. J. Circuits Syst. Comput. 29(12), 2050192 (2020). https:\/\/doi.org\/10.1142\/S0218126620501923","journal-title":"J. Circuits Syst. Comput."},{"key":"3_CR48","doi-asserted-by":"publisher","unstructured":"Rani, P.M.N., Kole, A., Datta, K., Chakrabarty, A.: Realization of ternary reversible circuits using improved gate library. Procedia Comput. Sci. 93, 153\u2013160 (2016). https:\/\/doi.org\/10.1016\/j.procs.2016.07.195","DOI":"10.1016\/j.procs.2016.07.195"},{"key":"3_CR49","unstructured":"Ringbauer, M., et al.: A universal qudit quantum processor with trapped ions (2021). https:\/\/arxiv.org\/abs\/2109.06903"},{"issue":"4","key":"3_CR50","doi-asserted-by":"publisher","first-page":"042302","DOI":"10.1103\/PhysRevA.87.042302","volume":"87","author":"P Selinger","year":"2013","unstructured":"Selinger, P.: Quantum circuits of t-depth one. Phys. Rev. A 87(4), 042302 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.87.042302","journal-title":"Phys. Rev. A"},{"issue":"5","key":"3_CR51","first-page":"461","volume":"9","author":"VV Shende","year":"2009","unstructured":"Shende, V.V., Markov, I.L.: On the CNOT-Cost of TOFFOLI Gates. Quantum Info. Comput. 9(5), 461\u2013486 (2009)","journal-title":"Quantum Info. Comput."},{"issue":"5","key":"3_CR52","first-page":"361","volume":"4","author":"G Song","year":"2004","unstructured":"Song, G., Klappenecker, A.: Optimal realizations of simplified toffoli gates. Quantum Info. Comput. 4(5), 361\u2013372 (2004)","journal-title":"Quantum Info. Comput."},{"key":"3_CR53","doi-asserted-by":"publisher","first-page":"479","DOI":"10.3389\/fphy.2020.589504","volume":"8","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Hu, Z., Sanders, B.C., Kais, S.: Qudits and high-dimensional quantum computing. Front. Phys. 8, 479 (2020). https:\/\/doi.org\/10.3389\/fphy.2020.589504","journal-title":"Front. Phys."},{"key":"3_CR54","doi-asserted-by":"publisher","unstructured":"Yang, G., Xie, F., Song, X., Hung, W., Perkowski, M.: A constructive algorithm for reversible logic synthesis. In: 2006 IEEE International Conference on Evolutionary Computation, pp. 2416\u20132421 (2006). https:\/\/doi.org\/10.1109\/CEC.2006.1688608","DOI":"10.1109\/CEC.2006.1688608"},{"issue":"23","key":"3_CR55","doi-asserted-by":"publisher","first-page":"30689","DOI":"10.1364\/oe.26.030689","volume":"26","author":"B Ye","year":"2018","unstructured":"Ye, B., Zheng, Z.F., Zhang, Y., Yang, C.P.: Circuit QED: single-step realization of a multiqubit controlled phase gate with one microwave photonic qubit simultaneously controlling $$n-1$$ microwave photonic qubits. Opt. Exp. 26(23), 30689 (2018). https:\/\/doi.org\/10.1364\/oe.26.030689","journal-title":"Opt. Exp."},{"key":"3_CR56","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.180504","volume":"125","author":"MA Yurtalan","year":"2020","unstructured":"Yurtalan, M.A., Shi, J., Kononenko, M., Lupascu, A., Ashhab, S.: Implementation of a walsh-hadamard gate in a superconducting qutrit. Phys. Rev. Lett. 125, 180504 (2020). https:\/\/doi.org\/10.1103\/PhysRevLett.125.180504","journal-title":"Phys. Rev. Lett."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09005-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:06:18Z","timestamp":1656371178000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09005-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031090042","9783031090059"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09005-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Urbino","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation-2022.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"There were 5 sub-reviewers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}