{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:36:16Z","timestamp":1743089776659,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811563171"},{"type":"electronic","value":"9789811563188"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-981-15-6318-8_16","type":"book-chapter","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T23:12:33Z","timestamp":1592953953000},"page":"182-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimization of Local Ordering Technique for Nearest Neighbour Circuits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2254-1663","authenticated-orcid":false,"given":"Lalengmawia","family":"Chhangte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1363-8383","authenticated-orcid":false,"given":"Alok","family":"Chakrabarty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"issue":"C","key":"16_CR1","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(C), 16\u201327 (2016). \nhttps:\/\/doi.org\/10.1016\/j.eswa.2016.04.038","journal-title":"Expert Syst. Appl."},{"key":"16_CR2","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, 3457\u20133467 (1995). \nhttps:\/\/doi.org\/10.1103\/PhysRevA.52.3457","journal-title":"Phys. Rev. A"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Bhattacharjee, A., Bandyopadhyay, C., Wille, R., Drechsler, R., Rahaman, H.: A novel approach for nearest neighbor realization of 2D quantum circuits. In: 2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 305\u2013310 (2018). \nhttps:\/\/doi.org\/10.1109\/ISVLSI.2018.00063","DOI":"10.1109\/ISVLSI.2018.00063"},{"key":"16_CR4","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-981-13-8821-7_12","volume-title":"Design and Testing of Reversible Logic","author":"A Bhattacharjee","year":"2020","unstructured":"Bhattacharjee, A., Bandyopadhyay, C., Mondal, B., Wille, R., Drechsler, R., Rahaman, H.: An efficient nearest neighbor design for 2D quantum circuits. In: Singh, A.K., Fujita, M., Mohan, A. (eds.) Design and Testing of Reversible Logic. LNEE, vol. 577, pp. 215\u2013231. Springer, Singapore (2020). \nhttps:\/\/doi.org\/10.1007\/978-981-13-8821-7_12"},{"key":"16_CR5","unstructured":"Bhattacharjee, D., Chattopadhyay, A.: Depth-optimal quantum circuit placement for arbitrary topologies. CoRR abs\/1703.08540 (2017)"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Hirata, Y., Nakanishi, M., Yamashita, S., Nakashima, Y.: An efficient method to convert arbitrary quantum circuits to ones on a linear nearest neighbor architecture. In: 2009 Third International Conference on Quantum, Nano and Micro Technologies, pp. 26\u201333 (2009). \nhttps:\/\/doi.org\/10.1109\/ICQNM.2009.25","DOI":"10.1109\/ICQNM.2009.25"},{"key":"16_CR7","unstructured":"IBM QX device. \nhttps:\/\/quantumexperience.ng.bluemix.net\/qx\/devices"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"031007","DOI":"10.1103\/PhysRevX.2.031007","volume":"2","author":"NC Jones","year":"2012","unstructured":"Jones, N.C., et al.: Layered architecture for quantum computing. Phys. Rev. X 2, 031007 (2012). \nhttps:\/\/doi.org\/10.1103\/PhysRevX.2.031007","journal-title":"Phys. Rev. X"},{"issue":"1","key":"16_CR9","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-dimensional nearest neighbor realization of a quantum circuit. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(1), 182\u2013192 (2018). \nhttps:\/\/doi.org\/10.1109\/TCAD.2017.2693284","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Lin, C., Sur-Kolay, S., Jha, N.K.: PAQCS: physical design-aware fault-tolerant quantum circuit synthesis. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 23(7), 1221\u20131234 (2015). \nhttps:\/\/doi.org\/10.1109\/TVLSI.2014.2337302","DOI":"10.1109\/TVLSI.2014.2337302"},{"key":"16_CR11","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 (2015). \nhttps:\/\/doi.org\/10.1109\/ASPDAC.2015.7059001","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-59936-6_19","volume-title":"Reversible Computation","author":"L Marbaniang","year":"2017","unstructured":"Marbaniang, L., Kole, A., Datta, K., Sengupta, I.: Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture. In: Phillips, I., Rahaman, H. (eds.) RC 2017. LNCS, vol. 10301, pp. 248\u2013253. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59936-6_19"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1109\/TCAD.2008.917562","volume":"27","author":"D Maslov","year":"2008","unstructured":"Maslov, D., Falconer, S.M., Mosca, M.: Quantum circuit placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(4), 752\u2013763 (2008). \nhttps:\/\/doi.org\/10.1109\/TCAD.2008.917562","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"10","key":"16_CR14","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1007\/s11128-013-0601-1","volume":"12","author":"M AlFailakawi","year":"2013","unstructured":"AlFailakawi, M., AlTerkawi, L., Ahmad, I., Hamdan, S.: Line ordering of reversible circuits for linear nearest neighbor realization. Quantum Inf. Process. 12(10), 3319\u20133339 (2013). \nhttps:\/\/doi.org\/10.1007\/s11128-013-0601-1","journal-title":"Quantum Inf. Process."},{"key":"16_CR15","unstructured":"Nickerson, N.H., Li, Y., Benjamin, S.C.: Topological quantum computing with a very noisy network and local error rates approaching one percent. Nat. Commun. 4 (2013). \nhttps:\/\/www.nature.com\/articles\/ncomms2773\n\n. Article no. 1756"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Ohliger, M., Eisert, J.: Efficient measurement-based quantum computing with continuous-variable systems. Phys. Rev. A 85(6) (2012). \nhttps:\/\/doi.org\/10.1103\/physreva.85.062318","DOI":"10.1103\/physreva.85.062318"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Rahman, M.M., Dueck, G.W., Chattopadhyay, A., Wille, R.: Integrated synthesis of linear nearest neighbor ancilla-free MCT circuits. In: 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), pp. 144\u2013149 (2016). \nhttps:\/\/doi.org\/10.1109\/ISMVL.2016.54","DOI":"10.1109\/ISMVL.2016.54"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Shafaei, A., Saeedi, M., Pedram, M.: Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures. In: 2013 50th ACM\/EDAC\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2013). \nhttps:\/\/doi.org\/10.1145\/2463209.2488785","DOI":"10.1145\/2463209.2488785"},{"key":"16_CR19","doi-asserted-by":"publisher","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), pp. 495\u2013500 (2014). \nhttps:\/\/doi.org\/10.1109\/ASPDAC.2014.6742940","DOI":"10.1109\/ASPDAC.2014.6742940"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Shrivastwa, R.R., Datta, K., Sengupta, I.: Fast qubit placement in 2D architecture using nearest neighbor realization. In: 2015 IEEE International Symposium on Nanoelectronic and Information Systems, pp. 95\u2013100 (2015). \nhttps:\/\/doi.org\/10.1109\/iNIS.2015.59","DOI":"10.1109\/iNIS.2015.59"},{"key":"16_CR21","series-title":"Studies in Systems, Decision and Control","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-319-23479-3_2","volume-title":"Reversible Logic Synthesis Methodologies with Application to Quantum Computing","author":"SMR Taha","year":"2016","unstructured":"Taha, S.M.R.: Fundamentals of reversible logic. Reversible Logic Synthesis Methodologies with Application to Quantum Computing. SSDC, vol. 37, pp. 7\u201316. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23479-3_2"},{"key":"16_CR22","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 (2016). \nhttps:\/\/doi.org\/10.1109\/ASPDAC.2016.7428026","DOI":"10.1109\/ASPDAC.2016.7428026"},{"issue":"12","key":"16_CR23","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. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(12), 1818\u20131831 (2014). \nhttps:\/\/doi.org\/10.1109\/TCAD.2014.2356463","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"16_CR24","unstructured":"Wille, R., Saeedi, M., Drechsler, R.: Synthesis of reversible functions beyond gate count and quantum cost. In: International Workshop on Logic Synthesis (2009)"}],"container-title":["Communications in Computer and Information Science","Machine Learning, Image Processing, Network Security and Data Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6318-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T23:14:02Z","timestamp":1592954042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6318-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811563171","9789811563188"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6318-8_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIND","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Image Processing, Network Security and Data Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Silchar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mind2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/mind2020.nits.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"219","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":"79","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":"4","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":"36% - 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":"4","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)"}}]}}