{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T15:26:14Z","timestamp":1770132374087,"version":"3.49.0"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","award":["NRF-2010-359-D00012"],"award-info":[{"award-number":["NRF-2010-359-D00012"]}],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p>\n            In this work, we propose an adder for the 2-Dimensional Nearest-Neighbor, Two-Qubit gate, Concurrent (2D NTC) architecture, designed to match the architectural constraints of many quantum computing technologies. The chosen architecture allows the layout of logical qubits in two dimensions with \u221a\n            <jats:italic>n<\/jats:italic>\n            columns where each column has \u221a\n            <jats:italic>n<\/jats:italic>\n            qubits and the concurrent execution of one- and two-qubit gates with nearest-neighbor interaction only. The proposed adder works in three phases. In the first phase, the first column generates the summation output and the other columns do the carry-lookahead operations. In the second phase, these intermediate values are propagated from column to column, preparing for computation of the final carry for each register position. In the last phase, each column, except the first one, generates the summation output using this column-level carry. The depth and the number of qubits of the proposed adder are \u0398(\u221a\n            <jats:italic>n<\/jats:italic>\n            ) and\n            <jats:italic>O(n)<\/jats:italic>\n            , respectively. The proposed adder executes faster than the adders designed for the 1D NTC architecture when the length of the input registers\n            <jats:italic>n<\/jats:italic>\n            is larger than 51.\n          <\/jats:p>","DOI":"10.1145\/2287696.2287707","type":"journal-article","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T13:06:30Z","timestamp":1345554390000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["A \u0398( \u221a n)-depth quantum adder on the 2D NTC quantum computer architecture"],"prefix":"10.1145","volume":"8","author":[{"given":"Byung-Soo","family":"Choi","sequence":"first","affiliation":[{"name":"University of Seoul, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney","family":"Van Meter","sequence":"additional","affiliation":[{"name":"Keio University, Fujisawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799359385"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646353.1646375"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.1034"},{"key":"e_1_2_1_5_1","unstructured":"Brown K. L. Munro W. J. and Kendon V. M. 2010. Using quantum computers for quantum simulation. http:\/\/arxiv.org\/abs\/1004.5528.  Brown K. L. Munro W. J. and Kendon V. M. 2010. Using quantum computers for quantum simulation. http:\/\/arxiv.org\/abs\/1004.5528."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.1098"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:20020949"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000502.2000504"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777424"},{"key":"e_1_2_1_10_1","unstructured":"Cuccaro S. A. Draper T. G. Kutin S. A. and Moulton D. P. 2004. A new quantum ripple-carry addition circuit. http:\/\/arxiv.org\/abs\/quant-ph\/0410184.  Cuccaro S. A. Draper T. G. Kutin S. A. and Moulton D. P. 2004. A new quantum ripple-carry addition circuit. http:\/\/arxiv.org\/abs\/quant-ph\/0410184."},{"key":"e_1_2_1_11_1","unstructured":"Devitt S. J. Nemoto K. and Munro W. J. 2009. The idiots guide to quantum error correction. http:\/\/arxiv.org\/abs\/0905.2794.  Devitt S. J. Nemoto K. and Munro W. J. 2009. The idiots guide to quantum error correction. http:\/\/arxiv.org\/abs\/0905.2794."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.69.214501"},{"key":"e_1_2_1_13_1","unstructured":"Draper T. G. 2000. Addition on a quantum computer. http:\/\/arxiv.org\/abs\/quant-ph\/0008033.  Draper T. G. 2000. Addition on a quantum computer. http:\/\/arxiv.org\/abs\/quant-ph\/0008033."},{"key":"e_1_2_1_14_1","first-page":"4","article-title":"A logarithmic-depth quantum carry-lookahead adder","volume":"6","author":"Draper T. G.","year":"2006","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_15_1","unstructured":"Feynman R. P. 1996. Feynman Lectures on Computation. Addison Wesley.   Feynman R. P. 1996. Feynman Lectures on Computation. Addison Wesley."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011827.2011828"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.76.174507"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01857727"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/38.946635"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.57.127"},{"key":"e_1_2_1_21_1","unstructured":"Gottesman D. 2009. An introduction to quantum error correction and fault-tolerant quantum computation. http:\/\/arxiv.org\/abs\/0904.2557.  Gottesman D. 2009. An introduction to quantum error correction and fault-tolerant quantum computation. http:\/\/arxiv.org\/abs\/0904.2557."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature04279"},{"key":"e_1_2_1_24_1","unstructured":"Helmer F. Mariantoni M. Fowler A. G. von Delft J. Solano E. and Marquardt F. 2007. Two-Dimensional cavity grid for scalable quantum computation with superconducting circuits. http:\/\/arxiv.org\/abs\/0706.3625.  Helmer F. Mariantoni M. Fowler A. G. von Delft J. Solano E. and Marquardt F. 2007. Two-Dimensional cavity grid for scalable quantum computation with superconducting circuits. http:\/\/arxiv.org\/abs\/0706.3625."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICQNM.2009.25"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/30156"},{"key":"e_1_2_1_27_1","unstructured":"Kawata Y. Yayu S. and Ueno S. 2008. An efficient quantum addition circuit : Extended abstract. Circ. Syst. 107 527 95--96.  Kawata Y. Yayu S. and Ueno S. 2008. An efficient quantum addition circuit : Extended abstract. Circ. Syst. 107 527 95--96."},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Kielpinski D. Monroe C. and Wineland D. J. 2002. Architecture for a large-scale ion-trap quantum computer. Nature 417 6890 709--711.  Kielpinski D. Monroe C. and Wineland D. J. 2002. Architecture for a large-scale ion-trap quantum computer. Nature 417 6890 709--711.","DOI":"10.1038\/nature00784"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.75.012331"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.052310"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917562"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Metodi T. S. and Chong F. T. 2006. Quantum Computing for Computer Architects. Synthesis Lectures on Computer Architecture Morgan &amp; Claypool Publishers.   Metodi T. S. and Chong F. T. 2006. Quantum Computing for Computer Architects. Synthesis Lectures on Computer Architecture Morgan &amp; Claypool Publishers.","DOI":"10.1007\/978-3-031-01718-6"},{"key":"e_1_2_1_33_1","unstructured":"Mosca M. 2008. Quantum algorithms. http:\/\/arxiv.org\/abs\/0808.0369.  Mosca M. 2008. Quantum algorithms. http:\/\/arxiv.org\/abs\/0808.0369."},{"key":"e_1_2_1_34_1","unstructured":"M\u00f6tt\u00f6nen M. and Vartiainen J. J. 2006. Decompositions of general quantum gates. http:\/\/arxiv.org\/abs\/0504100.  M\u00f6tt\u00f6nen M. and Vartiainen J. J. 2006. Decompositions of general quantum gates. http:\/\/arxiv.org\/abs\/0504100."},{"key":"e_1_2_1_35_1","unstructured":"Nielsen M. A. and Chuang I. L. 2000. Quantum Computation and Quantum Information 1st Ed. Cambridge University Press.   Nielsen M. A. and Chuang I. L. 2000. Quantum Computation and Quantum Information 1st Ed. Cambridge University Press."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.97.100501"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.022312"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.98.190504"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0201-2"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855930"},{"key":"e_1_2_1_41_1","first-page":"5","article-title":"On the CNOT-cost of TOFFOLI gates","volume":"9","author":"Shende V. V.","year":"2009","journal-title":"Quant. Inf. Comput."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.104.046802"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.77.793"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<443::AID-PROP443>3.0.CO;2-8"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.042322"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.72.022317"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNANO.2005.861402"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011670.2011672"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011725.2011732"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052320"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1126257.1126259"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.147"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Williams C. and Clearwater S. 2000. Ultimate Zero and One: Computing at the Quantum Frontier Copernicus Series Copernicus.   Williams C. and Clearwater S. 2000. Ultimate Zero and One: Computing at the Quantum Frontier Copernicus Series Copernicus.","DOI":"10.1007\/978-1-4612-0495-4"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2287696.2287707","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2287696.2287707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:04Z","timestamp":1750236544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2287696.2287707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.1145\/2287696.2287707"],"URL":"https:\/\/doi.org\/10.1145\/2287696.2287707","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"value":"1550-4832","type":"print"},{"value":"1550-4840","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]},"assertion":[{"value":"2011-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-08-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}