{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T18:14:37Z","timestamp":1780078477908,"version":"3.54.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2013,6,19]],"date-time":"2013-06-19T00:00:00Z","timestamp":1371600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11128-013-0601-1","type":"journal-article","created":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T13:41:33Z","timestamp":1371562893000},"page":"3319-3339","source":"Crossref","is-referenced-by-count":32,"title":["Line ordering of reversible circuits for linear nearest neighbor realization"],"prefix":"10.1007","volume":"12","author":[{"given":"Mohammad","family":"AlFailakawi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laila","family":"AlTerkawi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Imtiaz","family":"Ahmad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suha","family":"Hamdan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,6,19]]},"reference":[{"issue":"1","key":"601_CR1","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1016\/j.eswa.2011.08.046","volume":"39","author":"I Ahmad","year":"2012","unstructured":"Ahmad, I., Mohammad, MGh, Salman, A.A., Hamdan, S.A.: Broadcast scheduling in packet radio networks using harmony search algorithm. Expert Syst. Appl. 39(1), 1526\u20131535 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"601_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10462-010-9201-y","volume":"36","author":"OM Alia","year":"2011","unstructured":"Alia, O.M., Mandava, R.: The variants of the harmony search algorithm: an overview. Artif. Intell. Rev. 36(1), 49\u201368 (2011)","journal-title":"Artif. Intell. Rev."},{"key":"601_CR3","unstructured":"Arabzadeh, M., Saeedi, M.: RCViewer+. Available at http:\/\/ceit.aut.ac.ir\/QDA\/RCV.htm , 2.42 edition, February 2013"},{"key":"601_CR4","doi-asserted-by":"crossref","unstructured":"Arabzadeh, M., Saeedi, M., Zamani, M. S.: Rule-based optimization of reversible circuits. In: 15th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 849\u2013854 (2010)","DOI":"10.1109\/ASPDAC.2010.5419684"},{"key":"601_CR5","unstructured":"Chakrabarti, A., Sur-Kolay, S.: Nearest neighbour based synthesis of quantum boolean circuits. Eng. Lett. 15(2), 356\u2013361 (2007)"},{"key":"601_CR6","unstructured":"Chakrabarti, A., Sur-Kolay, S., Chaudhury, A.: Linear nearest neighbor synthesis of reversible circuits by graph partitioning. http:\/\/arxiv.org\/abs\/1112.0564 , v2[cs.ET], (2012)"},{"key":"601_CR7","unstructured":"Cheung, D., Maslov, D., Severini, S.: Translation techniques between quantum circuit architectures. In: Workshop on Quantum Information Processing (2007)"},{"key":"601_CR8","doi-asserted-by":"crossref","unstructured":"Choi, B.S., Meter, R.V.: On the effect of quantum interaction distance on quantum addition circuits. ACM J. Emerg. Technol. Comput. Syst. 7(3), 11:1\u201311:17 (2011)","DOI":"10.1145\/2000502.2000504"},{"key":"601_CR9","doi-asserted-by":"crossref","unstructured":"Donald, J., Jha, N.K.: Reversible logic synthesis with fredkin and peres gates. ACM J. Emerg. Technol. Comput. Syst. 4(1), 2:1\u20132:19 (2008)","DOI":"10.1145\/1330521.1330523"},{"key":"601_CR10","doi-asserted-by":"crossref","unstructured":"Drechsler, R., Wille, R.: Reversible circuits: Recent accomplishments and future challenges for an emerging technology. In: Progress in VLSI Design and Test, volume LNCS 7373, pp. 383\u2013392 (2012)","DOI":"10.1007\/978-3-642-31494-0_53"},{"key":"601_CR11","doi-asserted-by":"crossref","unstructured":"Fazel, K., Thornton, M.A., Rice, J.E.: Esop-based toffoli gate cascade generation. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, pp. 206\u2013209 (2007)","DOI":"10.1109\/PACRIM.2007.4313212"},{"key":"601_CR12","volume-title":"Simulating Physics with Computers","author":"RP Feynman","year":"2002","unstructured":"Feynman, R.P.: Simulating Physics with Computers. Westview Press, Boulder (2002)"},{"key":"601_CR13","doi-asserted-by":"crossref","unstructured":"Fowler, A.G., Hill, C.D., Hollenberg, L.C.L.: Quantum error correction on linear nearest neighbor qubit arrays. Phys. Rev. A 69(4), 042314.1042314.4 (2004)","DOI":"10.1103\/PhysRevA.69.042314"},{"issue":"1","key":"601_CR14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.amc.2007.09.049","volume":"199","author":"ZW Geem","year":"2008","unstructured":"Geem, Z.W.: Novel derivative of harmony search algorithm for discrete design variables. Appl. Math. Comput. 199(1), 223\u2013230 (2008)","journal-title":"Appl. Math. Comput."},{"key":"601_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00185-7","volume-title":"Music-Inspired Harmony Search Algorithm: Theory and Applications","author":"ZW Geem","year":"2009","unstructured":"Geem, Z.W.: Music-Inspired Harmony Search Algorithm: Theory and Applications. Springer, Berlin (2009)"},{"issue":"2","key":"601_CR16","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J., Loganathan, G.: A new heuristic optimization algorithm. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"issue":"9","key":"601_CR17","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1109\/TC.2011.144","volume":"61","author":"O Golubitsky","year":"2012","unstructured":"Golubitsky, O., Maslov, D.: A study of optimal 4-bit reversible toffoli circuits and their synthesis. IEEE Trans. Comput. 61(9), 1341\u20131353 (2012)","journal-title":"IEEE Trans. Comput."},{"issue":"23","key":"601_CR18","doi-asserted-by":"crossref","first-page":"4709","DOI":"10.1103\/PhysRevLett.79.4709","volume":"79","author":"L Grover","year":"1997","unstructured":"Grover, L.: Quantum computers can search arbitrarily large databases by a single query. Phys. Rev. Lett. 79(23), 4709\u20134712 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"11","key":"601_CR19","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1109\/TCAD.2006.871622","volume":"25","author":"P Gupta","year":"2006","unstructured":"Gupta, P., Agrawal, A., Jha, N.K.: An algorithm for synthesis of reversible logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(11), 2317\u20132330 (2006)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"601_CR20","doi-asserted-by":"crossref","unstructured":"Haffner, H., Hansel, W., Roos, C. F., Benhelm, J., Chek-al-kar, D., Chwalla, M., Korber, T., Rapol, U. D., Riebe, M., Schmidt, P. O., Becher, C., Guhne, O., Dur, W., Blatt, R.: Scalable multiparticle entanglement of trapped ions. Nature 438(7068), 643\u2013646, 12 (2005)","DOI":"10.1038\/nature04279"},{"key":"601_CR21","doi-asserted-by":"crossref","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: Third International Conference on Quantum, Nano and Micro Technologies, pp. 26\u201333 (2009)","DOI":"10.1109\/ICQNM.2009.25"},{"issue":"1","key":"601_CR22","first-page":"142","volume":"11","author":"Y Hirata","year":"2011","unstructured":"Hirata, Y., Nakanishi, M., Yamashita, S., Nakashima, Y.: An efficient conversion of quantum circuits to a linear nearest neighbor architecture. Quantum Inf. Comput. 11(1), 142\u2013166 (2011)","journal-title":"Quantum Inf. Comput."},{"key":"601_CR23","unstructured":"Karybis, G.: METIS\u2013Serial Graph Partitioning and Fill-reducing Matrix Ordering. Available at http:\/\/glaros.dtc.umn.edu\/gkhome\/metis\/metis\/overview\/"},{"issue":"1","key":"601_CR24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1146\/annurev-physchem-032210-103512","volume":"62","author":"I Kassal","year":"2011","unstructured":"Kassal, I., Whitfield, J.D., Perdomo-Ortiz, A., Yung, M.H., Aspuru-Guzik, A.: Simulating chemistry using quantum computers. Annu. Rev. Phys. Chem. 62(1), 185\u2013207 (2011)","journal-title":"Annu. Rev. Phys. Chem."},{"key":"601_CR25","doi-asserted-by":"crossref","unstructured":"Kerntopf, P.: A new heuristic algorithm for reversible logic synthesis. In: 41st Design Automation Conference, pp. 834\u2013837 (2004)","DOI":"10.1145\/996566.996789"},{"key":"601_CR26","doi-asserted-by":"crossref","unstructured":"Kerntopf, P., Perkowski, M., Podlaski, K.: Synthesis of reversible circuits: A view on the state-of-the-art. In: 12th IEEE Conference on Nanotechnology (IEEE-NANO), pp. 1\u20136, (2012)","DOI":"10.1109\/NANO.2012.6322176"},{"key":"601_CR27","first-page":"1","volume":"16","author":"MH Khan","year":"2008","unstructured":"Khan, M.H.: Cost reduction in nearest neighbour based synthesis of quantum boolean circuits. Eng. Lett. 16, 1\u20135 (2008)","journal-title":"Eng. Lett."},{"key":"601_CR28","unstructured":"Khan, M.H.A., Perkowski, M.A.: Multi-output esop synthesis with cascades of new reversible gate family. In: International Symposium On Representations and Methodology of Future Compo Technology (2003)"},{"key":"601_CR29","unstructured":"Kutin, S.A.: Shor\u2019s algorithm on a nearest-neighbor machine. In: Asian Conference on Quantum Information Science (AQIS) (2007)"},{"key":"601_CR30","unstructured":"Lee, C. H., Lee, D., Kim, M.: Optimal task assignment in linear networks. IEEE Trans. Comput. 41(7), 877\u2013880 (1992)"},{"key":"601_CR31","first-page":"5","volume":"12","author":"S Lee","year":"2006","unstructured":"Lee, S., Lee, S., Kim, T., Lee, J., Biamonte, J., Perkowski, M.: The cost of quantum gate primitives. J. Multivalued Log. Soft Comput. 12, 5\u20136 (2006)","journal-title":"J. Multivalued Log. Soft Comput."},{"key":"601_CR32","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1109\u20131117 (2005)"},{"key":"601_CR33","doi-asserted-by":"crossref","unstructured":"Maslov, D., Dueck, G. W., Miller, D. M.: Techniques for the synthesis of reversible toffoli networks. ACM Trans. Des. Autom. Electron. Syst. 12(4), 42:142:28 (2007)","DOI":"10.1145\/1278349.1278355"},{"issue":"1","key":"601_CR34","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1126257.1126259","volume":"2","author":"RV Meter","year":"2006","unstructured":"Meter, R.V., Oskin, M.: Architectural implications of quantum computing technologies. ACM J. Emerg. Technol. Comput. Syst. 2(1), 31\u201363 (2006)","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"601_CR35","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: 40th annual Design Automation Conference (2003)","DOI":"10.1145\/775914.775915"},{"key":"601_CR36","doi-asserted-by":"crossref","first-page":"170501","DOI":"10.1103\/PhysRevLett.96.170501","volume":"96","author":"C Negrevergne","year":"2006","unstructured":"Negrevergne, C., Mahesh, T.S., Ryan, C.A., Ditty, M., Cyr-Racine, F., Power, W., Boulant, N., Havel, T., Cory, D.G., Laflamme, R.: Benchmarking quantum control methods on a 12-qubit system. Phys. Rev. Lett. 96, 170501 (2006)","journal-title":"Phys. Rev. Lett."},{"key":"601_CR37","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2002","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2002)"},{"key":"601_CR38","unstructured":"Patel, K. N., Markov, I. L., Hayes, J. P.: Efficient synthesis of linear reversible circuits. In: International Workshop on Logic Synthesis (IWLS), pp. 4470\u20134477 (2004)"},{"issue":"3","key":"601_CR39","first-page":"282","volume":"8","author":"KN Patel","year":"2008","unstructured":"Patel, K.N., Markov, I.L., Hayes, J.P.: Optimal synthesis of linear reversible circuits. Quantum Inf. Comput. 8(3), 282\u2013294 (2008)","journal-title":"Quantum Inf. Comput."},{"issue":"1","key":"601_CR40","doi-asserted-by":"crossref","first-page":"71","DOI":"10.2298\/FUEE1101071P","volume":"24","author":"M Perkowski","year":"2011","unstructured":"Perkowski, M., Lukac, M., Shah, D., Kameyama, M.: Synthesis of quantum circuits in linear nearest neighbor model using positive davio lattices. Electron. Energ. 24(1), 71\u201387 (2011)","journal-title":"Electron. Energ."},{"key":"601_CR41","doi-asserted-by":"crossref","unstructured":"Saeedi, M., Markov, I. L.: Synthesis and optimization of reversible circuits\u2014a survey. ACM Comput. Surv. 45(2), 21:1\u201321:34 (2013)","DOI":"10.1145\/2431211.2431220"},{"issue":"3","key":"601_CR42","doi-asserted-by":"crossref","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":"4","key":"601_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1877745.1877747","volume":"6","author":"M Saeedi","year":"2010","unstructured":"Saeedi, M., Zamani, M.S., Sedighi, M., Sasanian, Z.: Reversible circuit synthesis using a cycle-based approach. ACM J. Emerg. Technol. Comput. Syst. 6(4), 1\u201326 (2010)","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"601_CR44","doi-asserted-by":"crossref","unstructured":"Salman, A.A., Ahmad, I., Al-Rushood, H., Hamdan, S.: Solving the task assignment problem using harmony search algorithm. Evolv. Syst. (2012)","DOI":"10.1007\/s12530-012-9058-1"},{"key":"601_CR45","doi-asserted-by":"crossref","unstructured":"Schaeffer, B., Perkowski, M.: Linear reversible circuit synthesis in the linear nearest-neighbor model. In: 42nd IEEE International Symposium on, Multiple-Valued Logic, pp. 157\u2013160 (2012)","DOI":"10.1109\/ISMVL.2012.53"},{"issue":"6","key":"601_CR46","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TCAD.2005.855930","volume":"25","author":"VV Shende","year":"2006","unstructured":"Shende, V.V., Bullock, S.S., Markov, I.L.: Synthesis of quantum-logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(6), 1000\u20131010 (2006)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"5","key":"601_CR47","first-page":"461","volume":"9","author":"VV Shende","year":"2009","unstructured":"Shende, V.V., Markov, I.L.: On the cnot-cost of toffoli gates. Quantum Inf. Comput. 9(5), 461\u2013486 (2009)","journal-title":"Quantum Inf. Comput."},{"issue":"6","key":"601_CR48","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/TCAD.2003.811448","volume":"22","author":"VV Shende","year":"2003","unstructured":"Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(6), 710\u2013722 (2003)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"5","key":"601_CR49","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P.: 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."},{"issue":"4","key":"601_CR50","first-page":"383","volume":"7","author":"Y Takahashi","year":"2007","unstructured":"Takahashi, Y., Kunihiro, N., Ohta, K.: The quantum fourier transform on a linear nearest neighbor architecture. Quantum Inf. Comput. 7(4), 383\u2013391 (2007)","journal-title":"Quantum Inf. Comput."},{"key":"601_CR51","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.egypro.2011.11.052","volume":"13","author":"D Wang","year":"2011","unstructured":"Wang, D., Sun, S., Chen, H.: Matrix-based algorithm for 4-qubit reversible logic circuits synthesis. Energy Procedia 13, 365\u2013371 (2011)","journal-title":"Energy Procedia"},{"key":"601_CR52","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R.: Bdd-based synthesis of reversible logic for large functions. In: 46th Annual Design Automation Conference, pp. 270\u2013275 (2009)","DOI":"10.1145\/1629911.1629984"},{"key":"601_CR53","doi-asserted-by":"crossref","unstructured":"Wille, R., Grosse, D., Teuber, L., Dueck, G. W., Drechsler, R.: Revlib: An online resource for reversible functions and reversible circuits. In: 38th IEEE International Symposium on Multiple Valued Logic, pp. 220\u2013225 (2008)","DOI":"10.1109\/ISMVL.2008.43"},{"key":"601_CR54","unstructured":"Wille, R., Saeedi, M., Drechsler, R.: Synthesis of reversible functions beyond gate count and quantum cost. In: International Workshop on Logic Synthesis (IWLS) (2009)"},{"issue":"7","key":"601_CR55","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1080\/00207210412331272643","volume":"91","author":"A Younes","year":"2004","unstructured":"Younes, A., Miller, J.F.: Representation of boolean quantum circuits as reed muller expansions. Int. J. Electron. 91(7), 431\u2013444 (2004)","journal-title":"Int. J. Electron."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-013-0601-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-013-0601-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-013-0601-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T19:50:25Z","timestamp":1563220225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-013-0601-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,19]]},"references-count":55,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["601"],"URL":"https:\/\/doi.org\/10.1007\/s11128-013-0601-1","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,19]]}}}