{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:23Z","timestamp":1740099503580,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030275617"},{"type":"electronic","value":"9783030275624"}],"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-27562-4_25","type":"book-chapter","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T19:02:47Z","timestamp":1565290967000},"page":"348-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Comparison of Exponentially Decreasing Vs. Polynomially Decreasing Objective Functions for Making Quantum Circuits Nearest Neighbour Compliant"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2270-0393","authenticated-orcid":false,"given":"Leo","family":"Rogers","sequence":"first","affiliation":[]},{"given":"John","family":"McAllister","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,8]]},"reference":[{"key":"25_CR1","unstructured":"A Preview of Bristlecone, Google\u2019s New Quantum Processor. \n                      https:\/\/bit.ly\/2KweJSF\n                      \n                    . Accessed 11 Oct 2018"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.eswa.2016.04.038","volume":"61","author":"MG Alfailakawi","year":"2016","unstructured":"Alfailakawi, M.G., Ahmad, I., Hamdan, S.: Harmony-search algorithm for 2D nearest neighbor quantum circuits realization. Expert Syst. Appl. 61, 16\u201327 (2016). \n                      https:\/\/doi.org\/10.1016\/j.eswa.2016.04.038\n                      \n                    . \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417416302172","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"25_CR3","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1038\/s41567-018-0124-x","volume":"14","author":"S Boixo","year":"2018","unstructured":"Boixo, S., et al.: Characterizing quantum supremacy in near-term devices. Nature Phys. 14(6), 595\u2013600 (2018). \n                      https:\/\/doi.org\/10.1038\/s41567-018-0124-x","journal-title":"Nature Phys."},{"issue":"48","key":"25_CR4","doi-asserted-by":"publisher","first-page":"18681","DOI":"10.1073\/pnas.0808245105","volume":"105","author":"I Kassal","year":"2008","unstructured":"Kassal, I., Jordan, S.P., Love, P.J., Mohseni, M., Aspuru-Guzik, A.: Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proc. Natl. Acad. Sci. USA 105(48), 18681\u201318686 (2008). \n                      https:\/\/doi.org\/10.1073\/pnas.0808245105\n                      \n                    . \n                      http:\/\/www.ncbi.nlm.nih.gov\/pmc\/articles\/PMC2596249\/\n                      \n                    , 5752[PII]","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/TCAD.2017.2693284","volume":"37","author":"A Kole","year":"2018","unstructured":"Kole, A., Datta, K., Sengupta, I.: A new heuristic for \n                      \n                        \n                      \n                      $$n$$\n                     -dimensional nearest neighbor realization of a quantum circuit. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(1), 182\u2013192 (2018). \n                      https:\/\/doi.org\/10.1109\/TCAD.2017.2693284","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"7","key":"25_CR6","doi-asserted-by":"publisher","first-page":"073043","DOI":"10.1088\/1367-2630\/13\/7\/073043","volume":"13","author":"M Kumph","year":"2011","unstructured":"Kumph, M., Brownnutt, M., Blatt, R.: Two-dimensional arrays of radio-frequency ion traps with addressable interactions. New J. Phys. 13(7), 073043 (2011). \n                      http:\/\/stacks.iop.org\/1367-2630\/13\/i=7\/a=073043","journal-title":"New J. Phys."},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Lye, A., Wille, R., Drechsler, R.: Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In: The 20th Asia and South Pacific Design Automation Conference, pp. 178\u2013183, January 2015. \n                      https:\/\/doi.org\/10.1109\/ASPDAC.2015.7059001","DOI":"10.1109\/ASPDAC.2015.7059001"},{"issue":"6124","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1126\/science.1231298","volume":"339","author":"C Monroe","year":"2013","unstructured":"Monroe, C., Kim, J.: Scaling the ion trap quantum processor. Science 339(6124), 1164\u20131169 (2013). \n                      https:\/\/doi.org\/10.1126\/science.1231298\n                      \n                    . \n                      http:\/\/science.sciencemag.org\/content\/339\/6124\/1164","journal-title":"Science"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018). \n                      https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Shafaei, A., Saeedi, M., Pedram, M.: Qubit placement to minimize communication overhead in 2D quantum architectures. In: 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC), January 2014","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"25_CR11","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, p. 124"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1088\/1367-2630\/8\/2\/030","volume":"8","author":"TP Spiller","year":"2006","unstructured":"Spiller, T.P., Nemoto, K., Braunstein, S.L., Munro, W.J., van Loock, P., Milburn, G.J.: Quantum computation by communication. New J. Phys. 8(2), 30 (2006). \n                      http:\/\/stacks.iop.org\/1367-2630\/8\/i=2\/a=030","journal-title":"New J. Phys."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.orp.2015.04.001","volume":"2","author":"D Weyland","year":"2015","unstructured":"Weyland, D.: A critical analysis of the harmony search algorithm-how not to solve sudoku. Oper. Res. Perspect. 2, 97\u2013105 (2015). \n                      https:\/\/doi.org\/10.1016\/j.orp.2015.04.001\n                      \n                    . \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S221471601500010X","journal-title":"Oper. Res. Perspect."},{"key":"25_CR14","doi-asserted-by":"publisher","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: 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC). pp. 292\u2013297, January 2016. \n                      https:\/\/doi.org\/10.1109\/ASPDAC.2016.7428026","DOI":"10.1109\/ASPDAC.2016.7428026"}],"container-title":["Lecture Notes in Computer Science","Embedded Computer Systems: Architectures, Modeling, and Simulation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27562-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T19:14:27Z","timestamp":1565291667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-27562-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030275617","9783030275624"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27562-4_25","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":"8 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAMOS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Embedded Computer Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pythagorion","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"7 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"samos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.samos-conference.com","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":"Softconf","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","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":"26","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":"0","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":"47% - 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":"4","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":"2.5","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)"}}]}}