{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T23:02:57Z","timestamp":1783465377048,"version":"3.55.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319994970","type":"print"},{"value":"9783319994987","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99498-7_11","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T08:45:39Z","timestamp":1534841139000},"page":"162-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Quantum Circuits for Floating-Point Arithmetic"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Haener","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Roetteler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krysta M.","family":"Svore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings, pp. 124\u2013134. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"033032","DOI":"10.1088\/1367-2630\/18\/3\/033032","volume":"18","author":"R Babbush","year":"2016","unstructured":"Babbush, R., Berry, D.W., Kivlichan, I.D., Wei, A.Y., Love, P.J., Aspuru-Guzik, A.: Exponentially more precise quantum simulation of fermions in second quantization. New J. Phys. 18(3), 033032 (2016)","journal-title":"New J. Phys."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., Troyer, M.: Elucidating reaction mechanisms on quantum computers. arXiv:1605.03590 (2016)","DOI":"10.1073\/pnas.1619152114"},{"issue":"15","key":"11_CR4","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"042322","DOI":"10.1103\/PhysRevA.68.042322","volume":"68","author":"AM Steane","year":"2003","unstructured":"Steane, A.M.: Overhead and noise threshold of fault-tolerant quantum error correction. Phys. Rev. A 68(4), 042322 (2003)","journal-title":"Phys. Rev. A"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Soeken, M., Roetteler, M., Wiebe, N., De Micheli, G.: Hierarchical reversible logic synthesis using LUTs. In: Design Automation Conference, pp. 78:1\u201378:6. ACM (2017)","DOI":"10.1145\/3061639.3062261"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/43.273754","volume":"13","author":"J Cong","year":"1994","unstructured":"Cong, J., Ding, Y.: FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. IEEE Trans. CAD Integr. Circ. Syst. 13(1), 1\u201312 (1994)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"11_CR8","unstructured":"Chen, D., Cong, J.: DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs. In: International Conference on Computer-Aided Design, pp. 752\u2013759 (2004)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Ray, S., Mishchenko, A., Een, N., Brayton, R., Jang, S., Chen, C.: Mapping into LUT structures. In: Design, Automation and Test in Europe, pp. 1579\u20131584 (2012)","DOI":"10.1109\/DATE.2012.6176724"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Abdessaied, N., Soeken, M., Drechsler, R.: Technology mapping for single target gate based circuits using Boolean functional decomposition. In: International Conference on Reversible Computation, pp. 219\u2013232 (2015)","DOI":"10.1007\/978-3-319-20860-2_14"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Soeken, M., Roetteler, M., Wiebe, N., De Micheli, G.: Design automation and design space exploration for quantum computers. In: Design, Automation and Test in Europe, pp. 470\u2013475. IEEE (2017)","DOI":"10.23919\/DATE.2017.7927035"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Soeken, Mathias Chattopadhyay, Anupam: Unlocking efficiency and scalability of reversible logic synthesis using conventional logic synthesis. In: Design Automation Conference, pages 149:1\u2013149:6 (2016)","DOI":"10.1145\/2897937.2898107"},{"key":"11_CR13","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. arXiv preprint arXiv:0910.2530 (2009)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"H\u00e4ner, T., Roetteler, M., Svore, K.M.: Factoring using 2n+ 2 qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7\u20138) (2017)","DOI":"10.26421\/QIC17.7-8-7"},{"key":"11_CR15","unstructured":"Wecker, D., Svore, K.M.: LIQ$$Ui|\\rangle $$: A software design architecture and domain-specific language for quantum computing. arXiv:1402.4467 (2014)"},{"key":"11_CR16","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"022328","DOI":"10.1103\/PhysRevA.87.022328","volume":"87","author":"C Jones","year":"2013","unstructured":"Jones, C.: Low-overhead constructions for the fault-tolerant Toffoli gate. Phys. Rev. A 87(2), 022328 (2013)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2629525","volume":"11","author":"TD Nguyen","year":"2014","unstructured":"Nguyen, T.D., Van Meter, R.: A resource-efficient design for a reversible floating point adder in quantum computing. ACM J. Emerg. Technol. Comput. Syst. 11(2), 13:1\u201313:18 (2014)","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"issue":"12","key":"11_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/355580.369074","volume":"5","author":"DE Knuth","year":"1962","unstructured":"Knuth, D.E.: Evaluation of polynomials by computer. Commun. ACM 5(12), 595\u2013599 (1962)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99498-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T22:10:17Z","timestamp":1661811017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99498-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319994970","9783319994987"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99498-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}