{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T15:24:27Z","timestamp":1774279467730,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Research Foundation of Korea (NRF)","award":["2019R1A5A1027055"],"award-info":[{"award-number":["2019R1A5A1027055"]}]},{"name":"Institute of Information & communications Technology Planning & Evaluation (IITP) by Korea government (MSIT)","award":["2021-0-00754"],"award-info":[{"award-number":["2021-0-00754"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,16]]},"DOI":"10.1145\/3566097.3567928","type":"proceedings-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:40:49Z","timestamp":1675190449000},"page":"690-695","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Graph Partitioning Approach for Fast Quantum Circuit Simulation"],"prefix":"10.1145","author":[{"given":"Jaekyung","family":"Im","sequence":"first","affiliation":[{"name":"Pohang University of Science and Technology, Pohang, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seokhyeong","family":"Kang","sequence":"additional","affiliation":[{"name":"Pohang University of Science and Technology, Pohang, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_2_1_2_1","first-page":"212","volume-title":"Proc. Symposium of Theory of Computing","author":"Grover L. K.","year":"1996","unstructured":"L. K. Grover, \"A Fast Quantum Mechanical Algorithm for Database Search\", Proc. Symposium of Theory of Computing, 1996, pp. 212--219"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1823458"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. DAC","author":"Markov I. L.","year":"2020","unstructured":"I. L. Markov, A. Fatima, S. V. Isakov et al., \"Massively Parallel Approximate Simulation of Hard Quantum Circuits\", Proc. DAC, 2020"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. HPCA","author":"Fatima A.","year":"2021","unstructured":"A. Fatima, I. L. Markov, \"Faster Schr\u00f6dinger-style Simulation of Quantum Circuits\", Proc. HPCA, 2021"},{"issue":"5","key":"e_1_3_2_1_7_1","first-page":"848","article-title":"Advanced Simulation of Quantum Computations","volume":"38","author":"Zulehner A.","year":"2018","unstructured":"A. Zulehner, R. Wille, \"Advanced Simulation of Quantum Computations\", IEEE TCAD 38(5) (2018), pp. 848--859","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE52317.2021.00037"},{"key":"e_1_3_2_1_9_1","volume-title":"arXiv:1807.10749","author":"Markov I. L.","year":"2018","unstructured":"I. L. Markov, A. Fatima, S. V. Isakov, \"Quantum Supremacy is Both Closer and Farther than It Appears\", arXiv:1807.10749, 2018"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-41753-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9591-6"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. DAC","author":"Fidduccia C. M.","year":"1982","unstructured":"C. M. Fidduccia, R. M. Mattheyses, \"A Linear-Time Heuristic for Improving Network Partitions\", Proc. DAC, 1982"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-018-0124-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"e_1_3_2_1_16_1","unstructured":"GRCS https:\/\/github.com\/sboixo\/GRCS"},{"key":"e_1_3_2_1_17_1","volume-title":"Simulating Shor's Factorization of 24-Bit Number on Desktop\", arXiv:1908.07187","author":"Tankasala A.","year":"2019","unstructured":"A. Tankasala, H. Ilatikhameneh, \"Quantum-Kit: Simulating Shor's Factorization of 24-Bit Number on Desktop\", arXiv:1908.07187, 2019"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942057"}],"event":{"name":"ASPDAC '23: 28th Asia and South Pacific Design Automation Conference","location":"Tokyo Japan","acronym":"ASPDAC '23","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEICE","IEEE CAS","IPSJ"]},"container-title":["Proceedings of the 28th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567928","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3566097.3567928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T17:34:02Z","timestamp":1767807242000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":18,"alternative-id":["10.1145\/3566097.3567928","10.1145\/3566097"],"URL":"https:\/\/doi.org\/10.1145\/3566097.3567928","relation":{},"subject":[],"published":{"date-parts":[[2023,1,16]]},"assertion":[{"value":"2023-01-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}