{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:36:38Z","timestamp":1725737798388},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389856"},{"type":"electronic","value":"9783642389863"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38986-3_6","type":"book-chapter","created":{"date-parts":[[2013,6,28]],"date-time":"2013-06-28T20:54:03Z","timestamp":1372452843000},"page":"58-69","source":"Crossref","is-referenced-by-count":4,"title":["Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures"],"prefix":"10.1007","author":[{"given":"Mehdi","family":"Saeedi","sequence":"first","affiliation":[]},{"given":"Alireza","family":"Shafaei","sequence":"additional","affiliation":[]},{"given":"Massoud","family":"Pedram","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Cheung, D., Maslov, D., Severini, S.: Translation techniques between quantum circuit architectures. In: Workshop on Quant. Inf. Proc. (December 2007)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.J.: A survey of graph layout problems. ACM Comput. Surv.\u00a034(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2000502.2000504","volume":"7","author":"B.-S. Choi","year":"2011","unstructured":"Choi, B.-S., Van Meter, R.: On the effect of quantum interaction distance on quantum addition circuits. J. Emerg. Technol. Comput. Syst.\u00a07(3), 11(1-17) (2011)","journal-title":"J. Emerg. Technol. Comput. Syst."},{"key":"6_CR4","unstructured":"Beals, R., et al.: Efficient distributed quantum computing arXiv:1207.2307v2 (2012)"},{"key":"6_CR5","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. Quant. Inf. Comput.\u00a07, 383\u2013391 (2007)","journal-title":"Quant. Inf. Comput."},{"key":"6_CR6","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\u00a076 (2007)","DOI":"10.1103\/PhysRevA.76.052310"},{"key":"6_CR7","first-page":"237","volume":"4","author":"A.G. Fowler","year":"2004","unstructured":"Fowler, A.G., Devitt, S.J., Hollenberg, L.: Implementation of Shor\u2019s algorithm on a linear nearest neighbour qubit array. Quant. Inf. Comput.\u00a04, 237\u2013245 (2004)","journal-title":"Quant. Inf. Comput."},{"key":"6_CR8","unstructured":"Kutin, S.A.: Shor\u2019s algorithm on a nearest-neighbor machine. In: Asian Conf. on Quant. Inf. Sci. (2007)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Pham, P., Svore, K.M.: A 2D nearest-neighbor quantum architecture for factoring arXiv:1207.6655 (2012)","DOI":"10.26421\/QIC13.11-12-3"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"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\u00a069, 042314.1\u2013042314.4 (2004)","journal-title":"Phys. Rev. A"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1007\/s11128-012-0482-8","volume":"12","author":"M. Arabzadeh","year":"2013","unstructured":"Arabzadeh, M., Saheb Zamani, M., Sedighi, M., Saeedi, M.: Depth-optimized reversible circuit synthesis. Quant. Inf. Proc.\u00a012(4), 1677\u20131699 (2013)","journal-title":"Quant. Inf. Proc."},{"key":"6_CR12","volume-title":"Trends in Quant. Comput. Research","author":"M. M\u00f6tt\u00f6nen","year":"2006","unstructured":"M\u00f6tt\u00f6nen, M., Vartiainen, J.J.: Decompositions of general quantum gates. In: Trends in Quant. Comput. Research, Ch. 7. NOVA Publishers, New York (2006)"},{"issue":"6","key":"6_CR13","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. CAD\u00a025(6), 1000\u20131010 (2006)","journal-title":"IEEE Trans. CAD"},{"issue":"3-4","key":"6_CR14","first-page":"262","volume":"11","author":"M. Saeedi","year":"2011","unstructured":"Saeedi, M., Arabzadeh, M., Saheb Zamani, M., Sedighi, M.: Block-based quantum-logic synthesis. Quant. Inf. Comput.\u00a011(3-4), 0262\u20130277 (2011)","journal-title":"Quant. Inf. Comput."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Saeedi, M., Saheb Zamani, M., Sedighi, M., Sasanian, Z.: Reversible circuit synthesis using a cycle-based approach. J. Emerg. Technol. Comput.\u00a06(4), 13(1\u201326) (2010)","DOI":"10.1145\/1877745.1877747"},{"issue":"3","key":"6_CR16","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. Quant. Inf. Proc.\u00a010(3), 355\u2013377 (2011)","journal-title":"Quant. Inf. Proc."},{"issue":"1-2","key":"6_CR17","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. Quant. Inf. Comput.\u00a011(1-2), 0142\u20130166 (2011)","journal-title":"Quant. Inf. Comput."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Shafaei, A., Saeedi, M., Pedram, M.: Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures. In: Design Autom. Conf. (2013)","DOI":"10.1145\/2463209.2488785"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2287696.2287707","volume":"8","author":"B.-S. Choi","year":"2012","unstructured":"Choi, B.-S., Van Meter, R.: A $\\sqrt{n}$ -depth quantum adder on the 2D NTC quantum computer architecture. J. Emerg. Technol. Comput. Syst.\u00a08(3), 24(1-22) (2012)","journal-title":"J. Emerg. Technol. Comput. Syst."},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/TNANO.2005.861402","volume":"5","author":"T. Szkopek","year":"2006","unstructured":"Szkopek, T., et al.: Threshold error penalty for fault-tolerant quantum computation with nearest neighbor communication. IEEE Trans. Nano.\u00a05(1), 42\u201349 (2006)","journal-title":"IEEE Trans. Nano."},{"key":"6_CR21","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge Univ. Press (2000)"},{"issue":"5-6","key":"6_CR22","first-page":"361","volume":"12","author":"I.L. Markov","year":"2012","unstructured":"Markov, I.L., Saeedi, M.: Constant-optimized quantum circuits for modular multiplication and exponentiation. Quant. Info. Comput.\u00a012(5-6), 361\u2013394 (2012)","journal-title":"Quant. Info. Comput."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"12310","DOI":"10.1103\/PhysRevA.87.012310","volume":"87","author":"I.L. Markov","year":"2013","unstructured":"Markov, I.L., Saeedi, M.: Faster quantum number factoring via circuit synthesis. Phys. Rev. A\u00a087, 012310 (2013)","journal-title":"Phys. Rev. A"},{"issue":"5-6","key":"6_CR24","first-page":"461","volume":"9","author":"V.V. Shende","year":"2009","unstructured":"Shende, V.V., Markov, I.L.: On the CNOT-cost of TOFFOLI gates. Quant. Inf. Comput.\u00a09(5-6), 461\u2013486 (2009)","journal-title":"Quant. Inf. Comput."},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Amy, M., Maslov, D., Mosca, M., R\u00f6tteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. CAD arXiv:1206.0758v3 (2013)","DOI":"10.1109\/TCAD.2013.2244643"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38986-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,26]],"date-time":"2022-02-26T14:49:27Z","timestamp":1645886967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38986-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389856","9783642389863"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38986-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}