{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T22:50:26Z","timestamp":1776725426580,"version":"3.51.2"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031380990","type":"print"},{"value":"9783031381003","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38100-3_11","type":"book-chapter","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T22:01:31Z","timestamp":1689112891000},"page":"150-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Uncomputation in\u00a0the\u00a0Qrisp High-Level Quantum Programming Framework"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3560-9556","authenticated-orcid":false,"given":"Raphael","family":"Seidel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6821-4417","authenticated-orcid":false,"given":"Nikolay","family":"Tcholtchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8362-8458","authenticated-orcid":false,"given":"Sebastian","family":"Bock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1839-0372","authenticated-orcid":false,"given":"Manfred","family":"Hauswirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"11_CR1","unstructured":"Qrisp online. http:\/\/www.qrisp.eu\/. Accessed 19 Feb 2023"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bichsel, B., Baader, M., Gehr, T., Vechev, M.: SILQ: a high-level quantum language with safe uncomputation and intuitive semantics. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2020, New York, NY, USA, pp. 286\u2013300. Association for Computing Machinery (2020)","DOI":"10.1145\/3385412.3386007"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search (1996)","DOI":"10.1145\/237814.237866"},{"issue":"12","key":"11_CR4","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1038\/s42254-020-00245-7","volume":"2","author":"B Heim","year":"2020","unstructured":"Heim, B., et al.: Quantum programming languages. Nat. Rev. Phys. 2(12), 709\u2013722 (2020)","journal-title":"Nat. Rev. Phys."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Maslov, D.: Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization. Physical Re. A 93(2) (2016)","DOI":"10.1103\/PhysRevA.93.022311"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Meuli, G., Soeken, M., Roetteler, M., Bjorner, N., Micheli, G.D.: Reversible pebbling game for quantum memory management (2019)","DOI":"10.23919\/DATE.2019.8715092"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Paradis, A., Bichsel, B., Steffen, S., Vechev, M.: Unqomp: synthesizing uncomputation in quantum circuits. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2021, New York, NY, USA, pp. 222\u2013236. Association for Computing Machinery (2021)","DOI":"10.1145\/3453483.3454040"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Seidel, R., Becker, C.K.-U., Bock, S., Tcholtchev, N., Gheorghe-Pop, I.-D., Hauswirth, M.: Automatic generation of Grover quantum oracles for arbitrary data structures. Quant. Sci. Technol. 8(2), 025003 (2023)","DOI":"10.1088\/2058-9565\/acaf9d"},{"key":"11_CR9","unstructured":"Seidel, R., Bock, S., Tcholtchev, N., Hauswirth, M.: Qrisp: a framework for compliable high-level programming of gate-based quantum computers. In: PlanQC - Programming Languages for Quantum Computing, September 2022"},{"key":"11_CR10","unstructured":"Song, G., Klappenecker, A.: The simplified Toffoli gate implementation by Margolus is optimal (2003)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Svore, K., et al.: Q#. In: Proceedings of the Real World Domain Specific Languages Workshop 2018 on - RWDSL2018. ACM Press (2018)","DOI":"10.1145\/3183895.3183901"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Wille, R., Van Meter, R., Naveh, Y.: Ibm\u2019s qiskit tool chain: working with and developing for real quantum computers. In: 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 1234\u20131240 (2019)","DOI":"10.23919\/DATE.2019.8715261"}],"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-38100-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T22:02:48Z","timestamp":1689112968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38100-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031380990","9783031381003"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38100-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 July 2023","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":"Giessen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation-2023.github.io\/site\/index.html","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":"19","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":"11","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":"3","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":"58% - 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)"}}]}}