{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:22Z","timestamp":1750220182202,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"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":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530483","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"535-540","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A bridge-based algorithm for simultaneous primal and dual defects compression on topologically quantum-error-corrected circuits"],"prefix":"10.1145","author":[{"given":"Wei-Hsiang","family":"Tseng","sequence":"first","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}]},{"given":"Yao-Wen","family":"Chang","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.26.20"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-014-0867-y"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E102.A.624"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2010.5419899"},{"key":"e_1_3_2_1_5_1","volume-title":"A bridge to lower overhead quantum computation. arXiv preprint arXiv:1209.0510","author":"Fowler Austin G","year":"2012","unstructured":"Austin G Fowler and Simon J Devitt. 2012. A bridge to lower overhead quantum computation. arXiv preprint arXiv:1209.0510 (2012)."},{"key":"e_1_3_2_1_6_1","volume-title":"Topological cluster state quantum computing. arXiv preprint arXiv:0805.3202","author":"Fowler Austin G","year":"2008","unstructured":"Austin G Fowler and Kovid Goyal. 2008. Topological cluster state quantum computing. arXiv preprint arXiv:0805.3202 (2008)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/12\/123011"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586322"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2760511"},{"volume-title":"Proc. of FPGA.","author":"McMurchie L.","key":"e_1_3_2_1_12_1","unstructured":"L. McMurchie and C. Ebeling. 1995. PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs. In Proc. of FPGA."},{"key":"e_1_3_2_1_13_1","unstructured":"The Boost organization. 2019. The Boost C++ Libraries. https:\/\/www.boost.org\/users\/history\/version_1_72_0"},{"key":"e_1_3_2_1_14_1","volume-title":"Quantum circuit optimization by topological compaction in the surface code. arXiv preprint arXiv: 1304.2807","author":"Paetznick Adam","year":"2013","unstructured":"Adam Paetznick and Austin G Fowler. 2013. Quantum circuit optimization by topological compaction in the surface code. arXiv preprint arXiv: 1304.2807 (2013)."},{"key":"e_1_3_2_1_15_1","first-page":"1","article-title":"Synthesis of arbitrary quantum circuits to topological assembly. Sci","volume":"6","author":"Paler Alexandru","year":"2016","unstructured":"Alexandru Paler, Simon J Devitt, and Austin G Fowler. 2016. Synthesis of arbitrary quantum circuits to topological assembly. Sci. Rep. 6, 1 (2016), 1--16.","journal-title":"Rep."},{"key":"e_1_3_2_1_16_1","first-page":"1","article-title":"Synthesis of arbitrary quantum circuits to topological assembly: Systematic, online and compact. Sci","volume":"7","author":"Paler Alexandru","year":"2017","unstructured":"Alexandru Paler, Austin G Fowler, and Robert Wille. 2017. Synthesis of arbitrary quantum circuits to topological assembly: Systematic, online and compact. Sci. Rep. 7, 1 (2017), 1--16.","journal-title":"Rep."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Alexandru Paler Ilia Polian Kae Nemoto and Simon J Devitt. 2015. A fully fault-tolerant representation of quantum circuits. In Reversible Computation.","DOI":"10.1007\/978-3-319-20860-2_9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aa66eb"},{"key":"e_1_3_2_1_19_1","unstructured":"Kovacs Peter El-Kebir Mohammed Juttner Alpar and Dezso Balazs. 2017. The LEMON Graph Library. https:\/\/lemon.cs.elte.hu\/trac\/lemon"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/9\/6\/199"},{"key":"e_1_3_2_1_21_1","series-title":"SIAM review 41, 2","volume-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","author":"Shor Peter W","year":"1999","unstructured":"Peter W Shor. 1999. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review 41, 2 (1999), 303--332."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2008.43"}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"location":"San Francisco California","acronym":"DAC '22"},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530483","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:17Z","timestamp":1750186937000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":22,"alternative-id":["10.1145\/3489517.3530483","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530483","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}