乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:48:31Z","timestamp":1725814111626},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662457108"},{"type":"electronic","value":"9783662457115"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-45711-5_7","type":"book-chapter","created":{"date-parts":[[2014,12,5]],"date-time":"2014-12-05T05:40:15Z","timestamp":1417758015000},"page":"111-128","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Synthesis of Reversible Circuits Based on EXORs of Products of EXORs"],"prefix":"10.1007","author":[{"given":"Linh","family":"Tran","sequence":"first","affiliation":[]},{"given":"Ben","family":"Schaeffer","sequence":"additional","affiliation":[]},{"given":"Addison","family":"Gronquist","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Perkowski","sequence":"additional","affiliation":[]},{"given":"Pawel","family":"Kerntopf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,6]]},"reference":[{"key":"7_CR1","unstructured":"Alhagi, N.: Synthesis of reversible functions using various gate libraries and design specifications. Ph.D. dissertation, Department of Electrical and Computer Engineering, Portland State University (2010)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alhagi, N., Hawash, M., Perkowski, M.A.: Synthesis of reversible circuits with no ancilla bits for large reversible functions specified with bit equations. In: 40th IEEE International Symposium on Multiple-Valued Logic, pp. 39\u201345 (2010)","DOI":"10.1109\/ISMVL.2010.16"},{"key":"7_CR3","unstructured":"Alhagi, N., Lukac, M., Tran, L., Perkowski, M.: Two-stage approach to the minimization of quantum circuit Based on ESOP minimization and addition of a single ancilla qubit. In: 21\u00a0st International Workshop on Post-Binary ULSI Systems, pp. 25\u201336 (2012)"},{"key":"7_CR4","unstructured":"Cheng, A., Tsai, E., Perkowski, M., Rajendar, A., Wang, Y.: Comparison of Maslov\u2019s quantum costs and LNNM quantum costs for four types of multi-qubit Toffoli gates. In: 21st International Workshop on Post-Binary ULSI Systems, pp. 81\u201387 (2012)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Fazel, K., Thornton, M., Rice, J.E.: ESOP-based Toffoli gate cascade generation. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, pp. 206\u2013209 (2007)","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"7_CR6","unstructured":"Hamza, Z., Dueck, G.W.: Near-optimal ordering of ESOP cubes for Toffoli networks. In: 2nd Workshop on Reversible Computation, pp. 49\u201353 (2010)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: 40th ACM\/IEEE Design Automation Conference, pp. 318\u2013323 (2003)","DOI":"10.1145\/775832.775915"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Wille, R., Drechsler, R.: Reducing reversible circuit cost by adding lines. In: 40th IEEE International Symposium on Multiple-Valued Logic, pp. 217\u2013222 (2010)","DOI":"10.1109\/ISMVL.2010.48"},{"key":"7_CR9","unstructured":"Mishchenko, A., Perkowski, M.: Fast heuristic minimization of exclusive sum-of-products. In: 5th International Reed-Muller Workshop, pp. 242\u2013250 (2001)"},{"key":"7_CR10","unstructured":"Mishchenko, A., Perkowski, M.: Logic synthesis of reversible wave cascades. In: IEEE\/ACM International Workshop on Logic and Synthesis, pp. 197\u2013202 (2002)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.2298\/FUEE1103385N","volume":"24","author":"NM Nayeem","year":"2011","unstructured":"Nayeem, N.M., Rice, J.E.: A shared-cube approach to ESOP-based synthesis of reversible logic. Facta Univ. Ser.: Electron. Energ. 24, 385\u2013402 (2011)","journal-title":"Facta Univ. Ser.: Electron. Energ."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1877745.1877747","volume":"6","author":"M Saeedi","year":"2010","unstructured":"Saeedi, M., Saheb Zamani, M., Sedighi, M., Sasanian, Z.: Reversible circuit synthesis using a cycle-based approach. ACM J. Emerg. Technol. Comput. Syst. 6, 1\u201326 (2010)","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"7_CR13","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. Circ. Syst. 27, 436\u2013444 (2008)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Schaeffer, B., Tran, L., Gronquist, A., Perkowski, M., Kerntopf, P.: Synthesis of reversible circuits based on products of exclusive or sum. In: 43th IEEE International Symposium on Multiple-Valued Logic, pp. 35\u201340 (2013)","DOI":"10.1109\/ISMVL.2013.54"},{"key":"7_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9783527633999","volume-title":"Reversible Computing: Fundamentals, Quantum Computing, and Applications","author":"A De Vos","year":"2010","unstructured":"De Vos, A.: Reversible Computing: Fundamentals, Quantum Computing, and Applications. Wiley-VCH, Weinheim (2010)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.4018\/jamc.2010100102","volume":"1","author":"R Wille","year":"2010","unstructured":"Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic. Int. J. Appl. Metaheuristic Comput. 1, 25\u201341 (2010)","journal-title":"Int. J. Appl. Metaheuristic Comput."},{"key":"7_CR17","unstructured":"RevLib - An Online Resource for Reversible Functions and Circuits. http:\/\/revlib.org\/"},{"key":"7_CR18","unstructured":"Maslov, D.: Reversible Logic Synthesis Benchmarks Page. http:\/\/webhome.cs.uvic.ca\/~dmaslov\/"},{"key":"7_CR19","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. Multiple-Valued Log. Soft Comput. 12, 561\u2013574 (2006)","journal-title":"J. Multiple-Valued Log. Soft Comput."},{"key":"7_CR20","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, 3457\u20133467 (1995)","journal-title":"Phys. Rev. A"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1049\/el:20031202","volume":"39","author":"D Maslov","year":"2003","unstructured":"Maslov, D., Dueck, G.W.: Improved quantum cost of n-bit Toffoli gates. Electron. Lett. 39, 1790\u20131791 (2003)","journal-title":"Electron. Lett."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1049\/ip-e.1993.0008","volume":"140","author":"A Tran","year":"1993","unstructured":"Tran, A., Wang, J.: A decomposition method for minimisation of reed-muller polynomials in mixed polarity. IEE Proc. Comput. Digit. Tech. 140, 65\u201368 (1993)","journal-title":"IEE Proc. Comput. Digit. Tech."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1109\/43.170986","volume":"11","author":"BJ Falkowski","year":"1992","unstructured":"Falkowski, B.J., Schaefer, I., Perkowski, M.A.: Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 11, 1207\u20131226 (1992)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/12.754996","volume":"48","author":"F Luccio","year":"1999","unstructured":"Luccio, F., Pagli, L. On a new Boolean function with applications. IEEE Trans. Comput. 48(3), 296\u2013310 (1999)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Science XXIV"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45711-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T13:17:44Z","timestamp":1674825464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-45711-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662457108","9783662457115"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45711-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}