{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T09:51:47Z","timestamp":1761126707926,"version":"3.41.0"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,12,28]],"date-time":"2015-12-28T00:00:00Z","timestamp":1451260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Quantum Computer Science (QCS) program"},{"name":"Intelligence Advanced Research Projects Activity (IARPA) under the Multi-Qubit Coherent Operation (MQCO) Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2016,7,26]]},"abstract":"<jats:p>The optimal design of a fault-tolerant quantum computer involves finding an appropriate balance between the burden of large-scale integration of noisy components and the load of improving the reliability of hardware technology. This balance can be evaluated by quantitatively modeling the execution of quantum logic operations on a realistic quantum hardware containing limited computational resources. In this work, we report a complete performance simulation software tool capable of (1) searching the hardware design space by varying resource architecture and technology parameters, (2) synthesizing and scheduling a fault-tolerant quantum algorithm within the hardware constraints, (3) quantifying the performance metrics such as the execution time and the failure probability of the algorithm, and (4) analyzing the breakdown of these metrics to highlight the performance bottlenecks and visualizing resource utilization to evaluate the adequacy of the chosen design. Using this tool, we investigate a vast design space for implementing key building blocks of Shor\u2019s algorithm to factor a 1,024-bit number with a baseline budget of 1.5 million qubits. We show that a trapped-ion quantum computer designed with twice as many qubits and one-tenth of the baseline infidelity of the communication channel can factor a 2,048-bit integer in less than 5 months.<\/jats:p>","DOI":"10.1145\/2830570","type":"journal-article","created":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T13:13:41Z","timestamp":1451481221000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Designing a Million-Qubit Quantum Computer Using a Resource Performance Simulator"],"prefix":"10.1145","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0221-0939","authenticated-orcid":false,"given":"Muhammad","family":"Ahsan","sequence":"first","affiliation":[{"name":"Duke University, North Carolina, United States of America"}]},{"given":"Rodney Van","family":"Meter","sequence":"additional","affiliation":[{"name":"Keio University, Japan"}]},{"given":"Jungsang","family":"Kim","sequence":"additional","affiliation":[{"name":"Duke University, North Carolina, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2015,12,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258579"},{"volume-title":"IEEE 31st International Conference on Computer Design (ICCD\u201913)","author":"Ahsan M.","key":"e_1_2_1_2_1"},{"volume-title":"Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE&rsquo;& Exhibition (DATE&rsquo;\u201915)","author":"Ahsan M.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","unstructured":"P. Aliferis D. Gottesman and J. Preskill. 2005. Quantum accuracy threshold for concatenated distance-3 codes. arXiv:quant-ph\/0504218 (2005). P. Aliferis D. Gottesman and J. Preskill. 2005. Quantum accuracy threshold for concatenated distance-3 codes. arXiv:quant-ph\/0504218 (2005)."},{"volume":"5815","volume-title":"Proceedings of the SPIE","author":"Balensiefer S.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.1034"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4900754"},{"key":"e_1_2_1_8_1","unstructured":"S. A. Cuccaro T. G. Draper S. A. Kutin and D. P. Moulton. 2004. A new quantum ripple-carry addition circuit. arXiv preprint quant-ph\/0410184 (2004). S. A. Cuccaro T. G. Draper S. A. Kutin and D. P. Moulton. 2004. A new quantum ripple-carry addition circuit. arXiv preprint quant-ph\/0410184 (2004)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2012086.2012090"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011617.2011618"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.032329"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.85.042321"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.032332"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"D. Gottesman and I. L. Chuang. 1999. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402 (October 1999) 390--393. D. Gottesman and I. L. Chuang. 1999. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402 (October 1999) 390--393.","DOI":"10.1038\/46503"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"N. D. Guise S. D. Fallek K. E. Stevens K. R. Brown C. Volin A. W. Harter J. M. Amini R. E. Higashi S. T. Lu H. M. Chanhvongsak etal 2014. Ball-grid array architecture for microfabricated ion traps. arXiv preprint arXiv:1412.5576 (2014). N. D. Guise S. D. Fallek K. E. Stevens K. R. Brown C. Volin A. W. Harter J. M. Amini R. E. Higashi S. T. Lu H. M. Chanhvongsak et al. 2014. Ball-grid array architecture for microfabricated ion traps. arXiv preprint arXiv:1412.5576 (2014).","DOI":"10.1063\/1.4917385"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.62.052317"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597917.2597939"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.79.032325"},{"volume-title":"Retrieved","year":"2011","author":"Jordan S.","key":"e_1_2_1_21_1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90229-4"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011781.2011782"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/LPT.2003.818653"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"T. Kleinjung K. Aoki J. Franke A. K. Lenstra E. Thom\u00e9 J. W. Bos P. Gaudry A. Kruppa P. L. Montgomery D. A. Osvik etal 2010. Factorization of a 768-bit RSA modulus. In Advances in Cryptology (CRYPTO\u201910). Springer 333--350. T. Kleinjung K. Aoki J. Franke A. K. Lenstra E. Thom\u00e9 J. W. Bos P. Gaudry A. Kruppa P. L. Montgomery D. A. Osvik et al. 2010. Factorization of a 768-bit RSA modulus. In Advances in Cryptology (CRYPTO\u201910). Springer 333--350.","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.190502"},{"volume-title":"Quantum computers. Nature 464, 7285","year":"2010","author":"Ladd T. D.","key":"e_1_2_1_28_1"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2005.9"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1231298"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.89.022317"},{"key":"e_1_2_1_32_1","unstructured":"M. A. Nielsen and I. L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press. M. A. Nielsen and I. L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.052314"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.77.793"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.4"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150019.1136518"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2494568"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.052320"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1324177.1324179"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.147"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242531.1242546"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555802"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161917"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.62.052316"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2830570","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2830570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:00Z","timestamp":1750225380000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2830570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,28]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7,26]]}},"alternative-id":["10.1145\/2830570"],"URL":"https:\/\/doi.org\/10.1145\/2830570","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"type":"print","value":"1550-4832"},{"type":"electronic","value":"1550-4840"}],"subject":[],"published":{"date-parts":[[2015,12,28]]},"assertion":[{"value":"2015-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-12-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}