{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:34:26Z","timestamp":1772242466888,"version":"3.50.1"},"reference-count":72,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I\/O capabilities, and the network topology. The tradeoff of choosing between gates executed remotely, through \u201cteleported gates\u201d on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I\/O bandwidth nodes and a simple network. Such a machine will run Shor's algorithm for factoring large numbers efficiently.<\/jats:p>","DOI":"10.1145\/1324177.1324179","type":"journal-article","created":{"date-parts":[[2008,2,8]],"date-time":"2008-02-08T15:32:16Z","timestamp":1202484736000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":55,"title":["Arithmetic on a distributed-memory quantum multicomputer"],"prefix":"10.1145","volume":"3","author":[{"given":"Rodney Van","family":"Meter","sequence":"first","affiliation":[{"name":"Keio University and CREST-JST, Japan"}]},{"given":"W. J.","family":"Munro","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Bristol, United Kingdom"}]},{"given":"Kae","family":"Nemoto","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"given":"Kohei M.","family":"Itoh","sequence":"additional","affiliation":[{"name":"Keio University and CREST-JST, Japan"}]}],"member":"320","published-online":{"date-parts":[[2008,1,28]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 33rd Annual International Symposium on Computer Architecture.","author":"ACM.","year":"2006"},{"key":"e_1_2_1_2_1","unstructured":"ARDA. 2004. A Quantum Information Science and Technology Roadmap v2.0 Ed. ARDA.  ARDA. 2004. A Quantum Information Science and Technology Roadmap v2.0 Ed. ARDA."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.89.133602"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.73"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.10"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011517.2011525"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.1034"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.70.1895"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/37539"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.1098"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.72.052330"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.59.4249"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796591"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777424"},{"key":"e_1_2_1_15_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\/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\/quant-ph\/0410184."},{"key":"e_1_2_1_16_1","unstructured":"Dally W. J. and Towles B. 2004. Principles and Practices of Interconnection Networks. Elsevier.   Dally W. J. and Towles B. 2004. Principles and Practices of Interconnection Networks. Elsevier."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1998.0159"},{"key":"e_1_2_1_19_1","unstructured":"Draper T. G. 2000. Addition on a quantum computer. http:\/\/arXiv.org\/quant-ph\/0008033.  Draper T. G. 2000. Addition on a quantum computer. http:\/\/arXiv.org\/quant-ph\/0008033."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Draper T. G. Kutin S. A. Rains E. M. and Svore K. M. 2006. A logarithmic-depth quantum carry-lookahead adder. Quantum Inform. Computa. 6 4&5 351--369.   Draper T. G. Kutin S. A. Rains E. M. and Svore K. M. 2006. A logarithmic-depth quantum carry-lookahead adder. Quantum Inform. Computa. 6 4&5 351--369.","DOI":"10.26421\/QIC6.4-5-4"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Ercegovac M. D. and Lang T. 2004. Digital Arithmetic. Morgan Kaufmann San Francisco CA.  Ercegovac M. D. and Lang T. 2004. Digital Arithmetic. Morgan Kaufmann San Francisco CA.","DOI":"10.1016\/B978-155860798-9\/50011-7"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.282.5390.932"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Furusawa A. S\u00f8rensen J. L. Braunstein S. L. Fuchs C. A. Kimble H. J. and Polzik E. S. 1998. Unconditional quantum teleportation. Science 282 5389 706--709.  Furusawa A. S\u00f8rensen J. L. Braunstein S. L. Fuchs C. A. Kimble H. J. and Polzik E. S. 1998. Unconditional quantum teleportation. Science 282 5389 706--709.","DOI":"10.1126\/science.282.5389.706"},{"key":"e_1_2_1_24_1","unstructured":"Gossett P. 1998. Quantum carry-save arithmetic. http:\/\/arXiv.org\/quant-ph\/9808061.  Gossett P. 1998. Quantum carry-save arithmetic. http:\/\/arXiv.org\/quant-ph\/9808061."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1038\/46503"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_2_1_27_1","unstructured":"Grover L. K. 1997. Quantum telecomputation. http:\/\/arXiv.org\/quant-ph\/9704012.  Grover L. K. 1997. Quantum telecomputation. http:\/\/arXiv.org\/quant-ph\/9704012."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature01336"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.130501"},{"key":"e_1_2_1_30_1","unstructured":"Johansson J. et al. 2005. Vacuum Rabi oscillations in a macroscopic superconducting qubit LC oscillator system. http:\/\/arXiv.org\/cond-mat\/0510457.  Johansson J. et al. 2005. Vacuum Rabi oscillations in a macroscopic superconducting qubit LC oscillator system. http:\/\/arXiv.org\/cond-mat\/0510457."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2002.1097"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature00784"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/LPT.2003.818653"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011656.2011657"},{"key":"e_1_2_1_35_1","unstructured":"Knuth D. E. 1998. The Art of Computer Programming Seminumerical Algorithms vol 2 3rd Ed. Addison-Wesley Reading MA.   Knuth D. E. 1998. The Art of Computer Programming Seminumerical Algorithms vol 2 3rd Ed. Addison-Wesley Reading MA."},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Lim Y. L. Barrett S. D. Beige A. Kok P. and Kwek L. C. 2005. Repeat-Until-Success quantum computing using stationary and flying qubits. http:\/\/arXiv.org\/quant-ph\/0508218.  Lim Y. L. Barrett S. D. Beige A. Kok P. and Kwek L. C. 2005. Repeat-Until-Success quantum computing using stationary and flying qubits. http:\/\/arXiv.org\/quant-ph\/0508218.","DOI":"10.1103\/PhysRevA.73.012304"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2005.09.017"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.1282"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.89.117901"},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Matsukevich D. N. and Kuzmich A. 2004. Quantum state transfer between matter and light. Science 306 5696 663--666.  Matsukevich D. N. and Kuzmich A. 2004. Quantum state transfer between matter and light. Science 306 5696 663--666.","DOI":"10.1126\/science.1103346"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.153001"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.2605"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/7\/1\/137"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1038\/19718"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.250502"},{"key":"e_1_2_1_46_1","unstructured":"Nielsen M. A. and Chuang I. L. 2000. Quantum Computation and Quantum Information. Cambridge University Press.   Nielsen M. A. and Chuang I. L. 2000. Quantum Computation and Quantum Information. Cambridge University Press."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.74.052313"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/859618.859661"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875509"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1080\/00107510500293261"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/8\/2\/030"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.042322"},{"key":"e_1_2_1_54_1","unstructured":"Steane A. M. 2004. How to build a 300 bit 1 Gop quantum computer. http:\/\/arxiv.org\/abs\/quant-ph\/0412165.  Steane A. M. 2004. How to build a 300 bit 1 Gop quantum computer. http:\/\/arxiv.org\/abs\/quant-ph\/0412165."},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Steane A. M. and Lucas D. M. 2000. Quantum computing with trapped ions atoms and light. Fortschritte der Physik. http:\/\/arXiv.org\/quant-ph\/0004053.  Steane A. M. and Lucas D. M. 2000. Quantum computing with trapped ions atoms and light. Fortschritte der Physik. http:\/\/arXiv.org\/quant-ph\/0004053.","DOI":"10.1063\/1.1354347"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1364\/JOSAB.19.003019"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 2nd Workshop on Massively Parallel Processing Using Optical Interconnections. IEEE.","author":"Szymanski T."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011670.2011672"},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the 33rd Annual International Symposium on Computer Architecture.","author":"Thaker D. D."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.96.240501"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052320"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.19"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70775"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/1126257.1126259"},{"key":"e_1_2_1_65_1","unstructured":"Van Meter III R. D. 2006. Architecture of a quantum multicomputer optimized for Shor's factoring algorithm. Ph.D. thesis Keio University.  Van Meter III R. D. 2006. Architecture of a quantum multicomputer optimized for Shor's factoring algorithm. Ph.D. thesis Keio University."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1038\/414883a"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.147"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature02851"},{"key":"e_1_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Williams C. P. and Clearwater S. H. 1999. Ultimate Zero and One: Computing at the Quantum Frontier. Copernicus Books.  Williams C. P. and Clearwater S. H. 1999. Ultimate Zero and One: Computing at the Quantum Frontier. Copernicus Books.","DOI":"10.1007\/978-1-4612-0495-4"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129183101002668"},{"key":"e_1_2_1_71_1","doi-asserted-by":"crossref","unstructured":"Yimsiriwattana A. and Lomonaco  Jr. S. J. 2004. Distributed quantum computing: A distributed Shor algorithm. http:\/\/arxiv.org\/quant-ph\/0403146.  Yimsiriwattana A. and Lomonaco Jr. S. J. 2004. Distributed quantum computing: A distributed Shor algorithm. http:\/\/arxiv.org\/quant-ph\/0403146.","DOI":"10.1117\/12.546504"},{"key":"e_1_2_1_72_1","unstructured":"Zalka C. 1998. Fast versions of Shor's quantum factoring algorithm. http:\/\/arXiv.org\/quant-ph\/9806084. http:\/\/arXiv.org\/quant-ph\/9806084.  Zalka C. 1998. Fast versions of Shor's quantum factoring algorithm. http:\/\/arXiv.org\/quant-ph\/9806084. http:\/\/arXiv.org\/quant-ph\/9806084."}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1324177.1324179","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1324177.1324179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:15Z","timestamp":1750254975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1324177.1324179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":72,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1145\/1324177.1324179"],"URL":"https:\/\/doi.org\/10.1145\/1324177.1324179","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"value":"1550-4832","type":"print"},{"value":"1550-4840","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]},"assertion":[{"value":"2006-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}