{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:17:50Z","timestamp":1726031870622},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214999"},{"type":"electronic","value":"9783030215002"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-21500-2_11","type":"book-chapter","created":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:02:48Z","timestamp":1560726168000},"page":"171-190","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Evaluating the Flexibility of A* for Mapping Quantum Circuits"],"prefix":"10.1007","author":[{"given":"Alwin","family":"Zulehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartwig","family":"Bauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Wille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"11_CR1","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"15023","DOI":"10.1038\/npjqi.2015.23","volume":"2","author":"A Montanaro","year":"2016","unstructured":"Montanaro, A.: Quantum algorithms: an overview. NPJ Quantum Inf. 2, 15023 (2016)","journal-title":"NPJ Quantum Inf."},{"issue":"7614","key":"11_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1038\/nature18648","volume":"536","author":"S Debnath","year":"2016","unstructured":"Debnath, S., Linke, N., Figgatt, C., Landsman, K., Wright, K., Monroe, C.: Demonstration of a small programmable quantum computer with atomic qubits. Nature 536(7614), 63\u201366 (2016)","journal-title":"Nature"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Linke, N.M., et al.: Experimental comparison of two quantum computing architectures. In: Proceedings of the National Academy of Sciences (2017). \n                      https:\/\/doi.org\/10.1073\/pnas.1618020114","DOI":"10.1073\/pnas.1618020114"},{"key":"11_CR7","unstructured":"IBM Q Team: IBM Q. \n                      https:\/\/www.research.ibm.com\/ibm-q\/\n                      \n                    . Accessed 02 May 2019"},{"key":"11_CR8","unstructured":"Nay, C.: IBM unveils world\u2019s first integrated quantum computing system for commercial use. \n                      https:\/\/newsroom.ibm.com\/2019-01-08-IBM-Unveils-Worlds-First-Integrated-Quantum-Computing-System-for-Commercial-Use\n                      \n                    . Accessed 02 May 2019"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. arXiv preprint \n                      arXiv:1801.00862\n                      \n                     (2018)","DOI":"10.22331\/q-2018-08-06-79"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Sete, E.A., Zeng, W.J., Rigetti, C.T.: A functional architecture for scalable quantum computing. In: International Conference on Rebooting Computing, pp. 1\u20136 (2016)","DOI":"10.1109\/ICRC.2016.7738703"},{"issue":"6385","key":"11_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1126\/science.aao4309","volume":"360","author":"C Neill","year":"2018","unstructured":"Neill, C., et al.: A blueprint for demonstrating quantum supremacy with superconducting qubits. Science 360(6385), 195\u2013199 (2018)","journal-title":"Science"},{"issue":"5","key":"11_CR12","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 (1995)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"11_CR13","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. Trans. Comput. Aided Des. Integr. Circ. Syst. 32(6), 818\u2013830 (2013)","journal-title":"Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffoli gates. In: International Symposium on Multi-valued Logic, pp. 288\u2013293 (2011)","DOI":"10.1109\/ISMVL.2011.54"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Siraichi, M., Dos Santos, V.F., Collange, S., Pereira, F.M.Q.: Qubit allocation. In: International Symposium on Code Generation and Optimization, pp. 1\u201312 (2018)","DOI":"10.1145\/3179541.3168822"},{"key":"11_CR16","unstructured":"Botea, A., Kishimoto, A., Marinescu, R.: On the complexity of quantum circuit compilation. In: Symposium on Combinatorial Search (2018)"},{"issue":"3","key":"11_CR17","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."},{"issue":"12","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1109\/TCAD.2014.2356463","volume":"33","author":"R Wille","year":"2014","unstructured":"Wille, R., Lye, A., Drechsler, R.: Exact reordering of circuit lines for nearest neighbor quantum architectures. Trans. Comput. Aided Des. Integr. Circ. Syst. 33(12), 1818\u20131831 (2014)","journal-title":"Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Wille, R., Keszocze, O., Walter, M., Rohrs, P., Chattopadhyay, A., Drechsler, R.: Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In: Asia and South Pacific Design Automation Conference, pp. 292\u2013297 (2016)","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-99498-7_16","volume-title":"Reversible Computation","author":"W Hattori","year":"2018","unstructured":"Hattori, W., Yamashita, S.: Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 228\u2013243. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-99498-7_16"},{"key":"11_CR21","unstructured":"IBM Q Team: QISKit Python SDK Version 0.4.15. \n                      https:\/\/github.com\/QISKit\/qiskit-sdk-py\n                      \n                    . Accessed 02 May 2019"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Zulehner, A., Paler, A., Wille, R.: An efficient methodology for mapping quantum circuits to the IBM QX architectures. Trans. Comput. Aided Des. Integr. Circ. Syst. (2018)","DOI":"10.23919\/DATE.2018.8342181"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Zulehner, A., Wille, R.: Compiling SU(4) quantum circuits to IBM QX architectures. In: Asia and South Pacific Design Automation Conference, pp. 185\u2013190 (2019)","DOI":"10.1145\/3287624.3287704"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Itoko, T., Raymond, R., Imamichi, T., Matsuo, A., Cross, A.W.: Quantum circuit compilers using gate commutation rules. In: Proceedings of the 24th Asia and South Pacific Design Automation Conference, pp. 191\u2013196 (2019)","DOI":"10.1145\/3287624.3287701"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Dueck, G.W., Pathak, A., Rahman, M.M., Shukla, A., Banerjee, A.: Optimization of circuits for IBM\u2019s five-qubit quantum computers. In: Euromicro Conference on Digital System Design, pp. 680\u2013684 (2018)","DOI":"10.1109\/DSD.2018.00005"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Wille, R., Burgholzer, L., Zulehner, A.: Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. In: Design Automation Conference (2019)","DOI":"10.1145\/3316781.3317859"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Zulehner, A., Wille, R.: Advanced simulation of quantum computations. Trans. Comput. Aided Des. Integr. Circ. Syst. (2018)","DOI":"10.1109\/TCAD.2018.2834427"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Tannu, S.S., Qureshi, M.K.: Not all qubits are created equal: a case for variability-aware policies for NISQ-era quantum computers. In: International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 987\u2013999 (2019)","DOI":"10.1145\/3297858.3304007"},{"key":"11_CR29","unstructured":"Kelly, J.: A preview of Bristlecone, Google\u2019s new quantum processor (2018). \n                      https:\/\/ai.googleblog.com\/2018\/03\/a-preview-of-bristlecone-googles-new.html"},{"key":"11_CR30","unstructured":"IBM Q Team: IBM Q 16 Rueschlikon backend specification v1.1.0. \n                      https:\/\/ibm.biz\/qiskit-rueschlikon\n                      \n                    . Accessed 02 May 2019"},{"key":"11_CR31","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., Dueck, G.W., Drechsler, R.: RevLib: an online resource for reversible functions and reversible circuits. In: International Symposium on Multi-valued Logic, pp. 220\u2013225 (2008). RevLib: \n                      http:\/\/www.revlib.org"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21500-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:15:28Z","timestamp":1560726928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21500-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214999","9783030215002"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21500-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","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":"Lausanne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation.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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"55% - 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"}},{"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"}},{"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"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One invited paper is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}