{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:13Z","timestamp":1780711393249,"version":"3.54.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T00:00:00Z","timestamp":1287446400000},"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":[[2011,6]]},"DOI":"10.1007\/s11128-010-0201-2","type":"journal-article","created":{"date-parts":[[2010,10,18]],"date-time":"2010-10-18T04:00:34Z","timestamp":1287374434000},"page":"355-377","source":"Crossref","is-referenced-by-count":172,"title":["Synthesis of quantum circuits for linear nearest neighbor architectures"],"prefix":"10.1007","volume":"10","author":[{"given":"Mehdi","family":"Saeedi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Wille","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,10,19]]},"reference":[{"key":"201_CR1","unstructured":"Wille, R., Saeedi, M., Drechsler, R.: Synthesis of reversible functions beyond gate count and quantum cost. In: International Workshop on Logic Synthesis, pp. 43\u201349 (2009)"},{"key":"201_CR2","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)"},{"key":"201_CR3","doi-asserted-by":"crossref","unstructured":"Mosca, M.: Quantum algorithms. Springer Encyclopedia of Complexity and Systems Science (to appear) (2008)","DOI":"10.1007\/978-0-387-30440-3_423"},{"issue":"1","key":"201_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1126257.1126259","volume":"2","author":"R.V. Meter","year":"2006","unstructured":"Meter R.V., Oskin M.: Architectural implications of quantum computing technologies. J. Emerg. Technol. Comput. Syst. 2(1), 31\u201363 (2006)","journal-title":"J. Emerg. Technol. Comput. Syst."},{"issue":"7","key":"201_CR5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/1364782.1364787","volume":"51","author":"M. Ross","year":"2008","unstructured":"Ross M., Oskin M.: Quantum computing. Commun. ACM 51(7), 12\u201313 (2008)","journal-title":"Commun. ACM"},{"key":"201_CR6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1038\/35051009","volume":"409","author":"E. Knill","year":"2001","unstructured":"Knill E., Laflamme R., Milburn G.J.: A scheme for efficient quantum computation with linear optics. Nature 409, 46\u201352 (2001)","journal-title":"Nature"},{"key":"201_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.26421\/QIC4.4-1","volume":"4","author":"A.G. Fowler","year":"2004","unstructured":"Fowler A.G., Devitt S.J., Hollenberg L.C.L.: Implementation of shor\u2019s algorithm on a linear nearest neighbour qubit array. Quantum Information and Computation 4, 237\u2013245 (2004)","journal-title":"Quantum Information and Computation"},{"key":"201_CR8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1038\/nature04279","volume":"438","author":"H. H\u00e4ffner","year":"2005","unstructured":"H\u00e4ffner H., H\u00e4nsel W., Roos C.F., Benhelm J., Chek al kar D., Chwalla M., K\u00f6rber T., Rapol U.D., Riebe M., Schmidt P.O., Becher C., G\u00fchne O., D\u00fcr W., Blatt R.: Scalable multiparticle entanglement of trapped ions. Nature 438, 643\u2013646 (2005)","journal-title":"Nature"},{"key":"201_CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1103\/PhysRevA.75.012331","volume":"75","author":"M. Laforest","year":"2007","unstructured":"Laforest M., Simon D., Boileau J.-C., Baugh J., Ditty M., Laflamme R.: Using error correction to determine the noise model. Phys. Rev. A 75, 133\u2013137 (2007)","journal-title":"Phys. Rev. A"},{"key":"201_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/30156","volume":"393","author":"B. Kane","year":"1998","unstructured":"Kane B.: A silicon-based nuclear spin quantum computer. Nature 393, 133\u2013137 (1998)","journal-title":"Nature"},{"key":"201_CR11","doi-asserted-by":"crossref","unstructured":"Maslov, D.: Linear depth stabilizer and quantum fourier transformation circuits with no auxiliary qubits in finite neighbor quantum architectures. Phys. Rev. A 76 (2007)","DOI":"10.1103\/PhysRevA.76.052310"},{"key":"201_CR12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.26421\/QIC7.4-7","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 Information and Computation 7, 383\u2013391 (2007)","journal-title":"Quantum Information and Computation"},{"key":"201_CR13","unstructured":"Kutin, S.A.: Shor\u2019s algorithm on a nearest-neighbor machine. Asian Conference on Quantum Information Science (2007)"},{"key":"201_CR14","unstructured":"Choi, B.-S., Van Meter, R.: Effects of Interaction Distance on Quantum Addition Circuits. ArXiv e-prints (September 2008)"},{"key":"201_CR15","doi-asserted-by":"crossref","first-page":"042314.1","DOI":"10.1103\/PhysRevA.69.042314","volume":"69","author":"A.G. Fowler","year":"2004","unstructured":"Fowler A.G., Hill C.D., Hollenberg L.C.L.: Quantum error correction on linear nearest neighbor qubit arrays. Phys. Rev. A 69, 042314.1\u2013042314.4 (2004)","journal-title":"Phys. Rev. A"},{"key":"201_CR16","volume-title":"Decompositions of General Quantum Gates. Chapter 7 in Trends in Quantum Computing Research","author":"M. M\u00f6tt\u00f6nen","year":"2006","unstructured":"M\u00f6tt\u00f6nen M., Vartiainen J.J.: Decompositions of General Quantum Gates. Chapter 7 in Trends in Quantum Computing Research. NOVA Publishers, New York (2006)"},{"issue":"6","key":"201_CR17","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TCAD.2005.855930","volume":"25","author":"V.V. Shende","year":"2006","unstructured":"Shende V.V., Bullock S.S., Markov I.L.: Synthesis of quantum-logic circuits. IEEE Trans. on CAD 25(6), 1000\u20131010 (2006)","journal-title":"IEEE Trans. on CAD"},{"key":"201_CR18","unstructured":"Cheung, D., Maslov, D., Severini, S.: Translation techniques between quantum circuit architectures. Workshop on Quantum Information Processing (December 2007)"},{"key":"201_CR19","first-page":"356","volume":"15","author":"A. Chakrabarti","year":"2007","unstructured":"Chakrabarti A., Sur-Kolay S.: Nearest neighbour based synthesis of quantum boolean circuits. Eng. Lett. 15, 356\u2013361 (2007)","journal-title":"Eng. Lett."},{"key":"201_CR20","first-page":"1","volume":"16","author":"M.H.A. Khan","year":"2008","unstructured":"Khan M.H.A.: Cost reduction in nearest neighbour based synthesis of quantum boolean circuits. Eng. Lett. 16, 1\u20135 (2008)","journal-title":"Eng. Lett."},{"key":"201_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: International Conference on Quantum, Nano and Micro Technologies, pp. 26\u201333 (2009)","DOI":"10.1109\/ICQNM.2009.25"},{"key":"201_CR22","unstructured":"Lee, S., Lee, S.J., Kim, T., Lee, J.S., Biamonte, J., Perkowski, M.: The cost of quantum gate primitives. J. Multiple Value Logic Soft Comput. 12(5\u20136) (2006)"},{"key":"201_CR23","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A. Barenco","year":"1995","unstructured":"Barenco A., Bennett C., Cleve R., DiVincenzo D., Margolus N., Shor P., Sleator T., Smolin J., Weinfurter H.: Elementary gates for quantum computation. APS Phys. Rev. A 52, 3457\u20133467 (1995)","journal-title":"APS Phys. Rev. A"},{"issue":"3","key":"201_CR24","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/TCAD.2007.911334","volume":"27","author":"D. Maslov","year":"2008","unstructured":"Maslov D., Dueck G.W., Miller D.M., Negrevergne C.: Quantum circuit simplification and level compaction. IEEE Trans. on CAD 27(3), 436\u2013444 (2008)","journal-title":"IEEE Trans. on CAD"},{"issue":"9","key":"201_CR25","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1109\/TCAD.2005.858352","volume":"25","author":"W.N.N. Hung","year":"2006","unstructured":"Hung W.N.N., Song X., Yang G., Yang J., Perkowski M.: Optimal synthesis of multiple output boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. on CAD 25(9), 1652\u20131663 (2006)","journal-title":"IEEE Trans. on CAD"},{"key":"201_CR26","doi-asserted-by":"crossref","unstructured":"Gro\u00dfe, D., Wille, R., Dueck, G.W., Drechsler, R.: Exact synthesis of elementary quantum gate circuits for reversible functions with don\u2019t cares. International Symposium on Multiple Valued Logic, pp. 214\u2013219 (2008)","DOI":"10.1109\/ISMVL.2008.42"},{"issue":"6","key":"201_CR27","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TCAD.2005.847911","volume":"24","author":"D. Maslov","year":"2005","unstructured":"Maslov D., Dueck G.W., Michael Miller D.: Toffoli network synthesis with templates. IEEE Trans. on CAD 24(6), 807\u2013817 (2005)","journal-title":"IEEE Trans. on CAD"},{"issue":"4","key":"201_CR28","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/1278349.1278355","volume":"12","author":"D. Maslov","year":"2007","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 (2007)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"201_CR29","unstructured":"Saeedi, M., Sedighi, M., Saheb Zamani, M.: A novel synthesis algorithm for reversible circuits. IEEE\/ACM International Conference on Computer-aided design, pp. 65\u201368 (2007)"},{"issue":"11","key":"201_CR30","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. on CAD 25(11), 2317\u20132330 (2006)","journal-title":"IEEE Trans. on CAD"},{"issue":"5","key":"201_CR31","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/TCAD.2009.2017215","volume":"28","author":"D. Gro\u00dfe","year":"2009","unstructured":"Gro\u00dfe D., Wille R., Dueck G.W., Drechsler R.: Exact multiple control toffoli network synthesis with SAT techniques. IEEE Trans. on CAD 28(5), 703\u2013715 (2009)","journal-title":"IEEE Trans. on CAD"},{"key":"201_CR32","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: DAC \u201909: Proceedings of the 46th annual Design Automation Conference, pp. 270\u2013275 (2009)","DOI":"10.1145\/1629911.1629984"},{"issue":"4","key":"201_CR33","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.mejo.2010.02.002","volume":"41","author":"M. Saeedi","year":"2010","unstructured":"Saeedi M., Sedighi M., Zamani M. Saheb: A library-based synthesis methodology for reversible logic. Elsevier Microelectron. J. 41(4), 185\u2013194 (2010)","journal-title":"Elsevier Microelectron. J."},{"key":"201_CR34","doi-asserted-by":"crossref","unstructured":"Saeedi, M., Zamani M., Saheb, Sedighi, M., Sasanian, Z.: Synthesis of reversible circuit using cycle-based approach. ACM J. Emerg. Technol. Comput. Syst. http:\/\/arxiv.org\/abs\/1004.4320 (2010)","DOI":"10.1145\/1877745.1877747"},{"key":"201_CR35","doi-asserted-by":"crossref","unstructured":"Miller, D. Michael, Maslov, Dmitri, Dueck, Gerhard W.: A transformation based algorithm for reversible logic synthesis. In: DAC \u201903: Proceedings of the 40th annual Design Automation Conference, pp. 318\u2013323. New York, NY: ACM (2003)","DOI":"10.1145\/775914.775915"},{"key":"201_CR36","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Sur-Kolay, S.: Rules for synthesizing quantum boolean circuits using minimized nearest-neighbour templates. In: International Conference on Advanced Computing and Communications, pp. 183\u2013189 (2007)","DOI":"10.1109\/ADCOM.2007.83"},{"issue":"1","key":"201_CR37","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1103\/PhysRevA.54.139","volume":"54","author":"A. Barenco","year":"1996","unstructured":"Barenco A., Ekert A., Suominen K.-A., T\u00f6rm\u00e4 P.: Approximate quantum fourier transform and decoherence. Phys. Rev. A 54(1), 139\u2013146 (1996)","journal-title":"Phys. Rev. A"},{"key":"201_CR38","doi-asserted-by":"crossref","unstructured":"Wille, R., Gro\u00dfe, D., Dueck, G.W., Drechsler, R.: Reversible logic synthesis with output permutation. In: VLSID \u201909: Proceedings of the 2009 22nd International Conference on VLSI Design, pp. 189\u2013194, Washington, DC, USA: IEEE Computer Society (2009)","DOI":"10.1109\/VLSI.Design.2009.40"},{"key":"201_CR39","doi-asserted-by":"crossref","unstructured":"Wille, R., Gro\u00dfe, D., Teuber, L., Dueck, G.W., Drechsler, R.: Revlib: An online resource for reversible functions and reversible circuits. International Symposium on Multiple Valued Logic, pp. 220\u2013225 (May 2008)","DOI":"10.1109\/ISMVL.2008.43"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-010-0201-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-010-0201-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-010-0201-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:47:22Z","timestamp":1636678042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-010-0201-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,19]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s11128-010-0201-2","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,19]]}}}