{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T05:36:40Z","timestamp":1767850600344,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T00:00:00Z","timestamp":1604275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Penn State ICDS"},{"name":"National Science Foundation","award":["1722557,1718474,1723687,1821766"],"award-info":[{"award-number":["1722557,1718474,1723687,1821766"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,2]]},"DOI":"10.1145\/3400302.3415745","type":"proceedings-article","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T01:16:38Z","timestamp":1608254198000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Noise resilient compilation policies for quantum approximate optimization algorithm"],"prefix":"10.1145","author":[{"given":"Mahabubul","family":"Alam","sequence":"first","affiliation":[{"name":"Pennsylvania State University"}]},{"given":"Abdullah","family":"Ash-Saki","sequence":"additional","affiliation":[{"name":"Pennsylvania State University"}]},{"given":"Junde","family":"Li","sequence":"additional","affiliation":[{"name":"Pennsylvania State University"}]},{"given":"Anupam","family":"Chattopadhyay","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}]},{"given":"Swaroop","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Pennsylvania State University"}]}],"member":"320","published-online":{"date-parts":[[2020,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Addressing Temporal Variations in Qubit Quality Metrics for Parameterized Quantum Circuits. In 2019 IEEE\/ACM International Symposium on Low Power Electronics and Design (ISLPED). IEEE, 1--6.","author":"Alam Mahabubul","year":"2019"},{"key":"e_1_3_2_1_2_1","volume-title":"Automation Test in Europe Conference Exhibition (DATE). 686--689","author":"Alam M."},{"key":"e_1_3_2_1_3_1","volume-title":"Circuit Compilation Methodologies for Quantum Approximate Optimization Algorithm. IEEE\/ACM International Symposium on Microarchitecture","author":"Alam Mahabubul","year":"2020"},{"key":"e_1_3_2_1_4_1","volume-title":"2020 IEEE Custom Integrated Circuits Conference (CICC). 1--4.","author":"Alam M."},{"key":"e_1_3_2_1_5_1","volume-title":"An Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm. IEEE\/ACM Design Automation Conference","author":"Alam Mahabubul","year":"2020"},{"key":"e_1_3_2_1_6_1","unstructured":"Frank Arute Kunal Arya Ryan Babbush Bacon etal 2019. Quantum supremacy using a programmable superconducting processor. Nature 574 7779 (2019) 505--510.  Frank Arute Kunal Arya Ryan Babbush Bacon et al. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574 7779 (2019) 505--510."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317888"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.101.054508"},{"key":"e_1_3_2_1_9_1","volume-title":"Depth-optimal quantum circuit placement for arbitrary topologies. arXiv preprint arXiv:1703.08540","author":"Bhattacharjee Debjyoti","year":"2017"},{"key":"e_1_3_2_1_10_1","volume-title":"38th IEEE\/ACM International Conference on Computer-Aided Design, ICCAD","author":"Bhattacharjee Debjyoti","year":"2019"},{"key":"e_1_3_2_1_11_1","volume-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419","author":"Crooks Gavin E","year":"2018"},{"key":"e_1_3_2_1_12_1","volume-title":"APS Meeting Abstracts.","author":"Cross Andrew","year":"2018"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74450-4_1"},{"key":"e_1_3_2_1_14_1","volume-title":"30th International Symposium on Theoretical Aspects of Computer Science (STACS","author":"D\u00f3sa Gy\u00f6rgy","year":"2013"},{"key":"e_1_3_2_1_15_1","volume-title":"A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028","author":"Farhi Edward","year":"2014"},{"key":"e_1_3_2_1_16_1","volume-title":"Quantum algorithms for fixed qubit architectures. arXiv preprint arXiv:1703.06199","author":"Farhi Edward","year":"2017"},{"key":"e_1_3_2_1_17_1","volume-title":"The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size. arXiv preprint arXiv:1910.08187","author":"Farhi Edward","year":"2019"},{"key":"e_1_3_2_1_18_1","unstructured":"Edward Farhi and Aram W Harrow. [n.d.]. Quantum supremacy through the quantum approximate optimization algorithm. arXiv preprint arXiv:1602.07674 ([n. d.]).  Edward Farhi and Aram W Harrow. [n.d.]. Quantum supremacy through the quantum approximate optimization algorithm. arXiv preprint arXiv:1602.07674 ([n. d.])."},{"key":"e_1_3_2_1_19_1","volume-title":"Is the Trotterized UCCSD Ansatz Chemically Well-Defined? Journal of Chemical Theory and Computation","author":"Grimsley Harper R","year":"2019"},{"key":"e_1_3_2_1_20_1","volume-title":"CES 2018: Intel's 49-qubit chip shoots for quantum supremacy. IEEE Spectrum Tech Talk","author":"Hsu Jeremy","year":"2018"},{"key":"e_1_3_2_1_21_1","volume-title":"Google's new quantum processor. Google Research Blog 5","author":"Kelly Julian","year":"2018"},{"key":"e_1_3_2_1_22_1","unstructured":"Will Knight. 2018. IBM Raises the Bar with a 50-Qubit Quantum Computer News.  Will Knight. 2018. IBM Raises the Bar with a 50-Qubit Quantum Computer News."},{"key":"e_1_3_2_1_23_1","volume-title":"Branch-and-bound methods: A survey. Operations research 14, 4","author":"Lawler Eugene L","year":"1966"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304023"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304075"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322273"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378477"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_2_1_29_1","volume-title":"The Rigetti 128-qubit chip and what it means for quantum. Medium","author":"Rigetti Chad","year":"2018"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aad3e4"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855930"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304007"},{"key":"e_1_3_2_1_33_1","volume-title":"Simulated annealing: Theory and applications","author":"Van Laarhoven Peter JM"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aaa331"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317859"},{"key":"e_1_3_2_1_36_1","article-title":"Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices","author":"Zhou Leo","year":"2020","journal-title":"Physical Review"},{"key":"e_1_3_2_1_37_1","volume-title":"An efficient methodology for mapping quantum circuits to the IBM QX architectures","author":"Zulehner Alwin","year":"2018"}],"event":{"name":"ICCAD '20: IEEE\/ACM International Conference on Computer-Aided Design","location":"Virtual Event USA","acronym":"ICCAD '20","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA","IEEE CS"]},"container-title":["Proceedings of the 39th International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400302.3415745","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3400302.3415745","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3400302.3415745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:52Z","timestamp":1750197772000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400302.3415745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,2]]},"references-count":37,"alternative-id":["10.1145\/3400302.3415745","10.1145\/3400302"],"URL":"https:\/\/doi.org\/10.1145\/3400302.3415745","relation":{},"subject":[],"published":{"date-parts":[[2020,11,2]]},"assertion":[{"value":"2020-12-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}