{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T18:38:41Z","timestamp":1764700721229,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T00:00:00Z","timestamp":1554336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100007000","name":"Laboratory Directed Research and Development","doi-asserted-by":"publisher","award":["20160069DR and 20190065DR"],"award-info":[{"award-number":["20160069DR and 20190065DR"]}],"id":[{"id":"10.13039\/100007000","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,4,4]]},"DOI":"10.1145\/3297858.3304071","type":"proceedings-article","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T18:38:43Z","timestamp":1554403123000},"page":"529-543","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Targeting Classical Code to a Quantum Annealer"],"prefix":"10.1145","author":[{"given":"Scott","family":"Pakin","sequence":"first","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, NM, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734479"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/15\/10\/028"},{"key":"e_1_3_2_1_3_1","volume-title":"ABC: a system for sequential synthesis and verification. (July 17","author":"Berkeley Logic Synthesis and Verification Group","year":"2016","unstructured":"Berkeley Logic Synthesis and Verification Group. 2016. ABC: a system for sequential synthesis and verification. (July 17, 2016). Retrieved 07\/31\/2018 from http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000671"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.78.012352"},{"key":"e_1_3_2_1_6_1","volume-title":"Discrete optimization using quantum annealing on sparse Ising models. Frontiers in Physics, 2,(September 18","author":"Bian Zhengbing","year":"2014","unstructured":"Zhengbing Bian, Fabian Chudak, Robert Israel, Brad Lackey, William G. Macready, and Aidan Roy. 2014. Discrete optimization using quantum annealing on sparse Ising models. Frontiers in Physics, 2,(September 18, 2014). issn: 2296--424X."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646483.691738"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761625"},{"key":"e_1_3_2_1_9_1","volume-title":"Beweis des adiabatensatzes.Zeitschrift f\u00fcr Physik, 51, 3--4, (March 1","author":"Fock Born","year":"1928","unstructured":"M{ax} Born and V{ladimir} Fock. 1928. Beweis des adiabatensatzes.Zeitschrift f\u00fcr Physik, 51, 3--4, (March 1, 1928), 165--180. issn: 0044--3328."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011772.2011773"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASC.2014.2318294"},{"key":"e_1_3_2_1_13_1","volume-title":"D-Wave Systems Inc. (June 10","author":"Cai Jun","year":"2014","unstructured":"Jun Cai, Bill Macready, and Aidan Roy. 2014. A practical heuristic for finding graph minors. D-Wave Systems Inc. (June 10, 2014). arXiv:1406.2741v1{quant-ph}."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-008-0082-9"},{"key":"e_1_3_2_1_15_1","unstructured":"Geoffrey Chu Peter J. Stuckey Andreas Schutt Thorsten Ehlers Graeme Gange and Kathryn Francis. {n. d.} Chuffed a lazy clause generation solver. Retrieved 12\/19\/2018 from https:\/\/github.com\/chuffed\/chuffed."},{"volume-title":"Tools and Algorithms for the Construction and Analysis of Systems (Lecture Notes in Computer Science)","author":"Clarke Edmund","key":"e_1_3_2_1_16_1","unstructured":"Edmund Clarke, Daniel Kroening, and Flavio Lerda. 2004. A tool for checking ANSI-C programs. In Tools and Algorithms for the Construction and Analysis of Systems (Lecture Notes in Computer Science). Kurt Jensen and Andreas Podelski, editors. Volume 2988. Springer, Berlin, Germany and Heidelberg, Germany, 168--176. isbn: 978--3--540--24730--2."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:FORM.0000040025.89719.f3"},{"key":"e_1_3_2_1_18_1","article-title":"Google moves toward quantum supremacy with 72-qubit computer","volume":"193","author":"Conover Emily","year":"2018","unstructured":"Emily Conover. 2018. Google moves toward quantum supremacy with 72-qubit computer. Science News, 193, 6, (March 5, 2018), 13. Retrieved 07\/19\/2018 from https:\/\/www.sciencenews.org\/article\/google-moves-toward-quantum-supremacy-72-qubit-computer.","journal-title":"Science News"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1614191"},{"key":"e_1_3_2_1_21_1","unstructured":"D-Wave Systems Inc. 2017. D-Wave initiates open quantum software environment. (January 11 2017). Retrieved 08\/02\/2018 from https:\/\/www.dwavesys.com\/press-releases\/d-wave-initiates-open-quantum-software-environment."},{"key":"e_1_3_2_1_22_1","unstructured":"D-Wave Systems Inc. {n. d.} D-Wave Ocean software documentation. Retrieved 12\/19\/2018 from https:\/\/docs.ocean.dwavesys.com\/en\/latest\/index.html."},{"key":"e_1_3_2_1_23_1","unstructured":"D-Wave Systems Inc. 2016. qbsolv-Minimize the Objective Function Represented by a QUBO. qbsolv(1) manual page. Burnaby British Columbia Canada. 3 pages. Retrieved 07\/23\/2018 from https:\/\/github.com\/dwavesystems\/qbsolv\/blob\/master\/doc\/qbsolv.pdf."},{"key":"e_1_3_2_1_24_1","volume-title":"British Columbia","author":"Dahl E. D.","year":"2013","unstructured":"E. D. Dahl. 2013. Programming with D-Wave: Map Coloring Problem. White Paper. D-Wave Systems, Burnaby, British Columbia, Canada, (November 2013). https:\/\/www.dwavesys.com\/sites\/default\/files\/Map%20Coloring%20WP2.pdf."},{"volume-title":"British Columbia","year":"2018","key":"e_1_3_2_1_25_1","unstructured":"2018. Developer Guide for Python. User Manual 09--1024 A-K. D-Wave Systems, Inc., Burnaby, British Columbia, Canada, (July 30, 2018).69 pages."},{"key":"e_1_3_2_1_26_1","first-page":"1411","volume-title":"Massachusetts Institute of Technology","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. Technical report MIT-CTP\/4610. Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, (November 14, 2014). 16 pages. arXiv:1411.4028v1{quant-ph}."},{"key":"e_1_3_2_1_27_1","volume-title":"Quantum computation by adiabatic evolution. (January 28","author":"Farhi Edward","year":"2000","unstructured":"Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. 2000. Quantum computation by adiabatic evolution. (January 28, 2000). arXiv:0001106v1{quant-ph}."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(94)00117-0"},{"key":"e_1_3_2_1_29_1","volume-title":"D-Wave upgrade: how scientists are usingthe world's most controversial quantum computer. Nature, 541, 7638,(January 24","author":"Gibney Elizabeth","year":"2017","unstructured":"Elizabeth Gibney. 2017. D-Wave upgrade: how scientists are usingthe world's most controversial quantum computer. Nature, 541, 7638,(January 24, 2017), 447--448."},{"key":"e_1_3_2_1_30_1","first-page":"89","article-title":"Satisfiability solvers. In Handbook of Knowledge Representation.Foundations of Artificial Intelligence. Volume 3. Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter, editors","volume":"2","author":"Gomes Carla P.","year":"2008","unstructured":"Carla P. Gomes, Henry Kautz, Ashish Sabharwal, and Bart Selman. 2008. Satisfiability solvers. In Handbook of Knowledge Representation.Foundations of Artificial Intelligence. Volume 3. Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter, editors. Elsevier. Chapter 2, 89--134.","journal-title":"Elsevier. Chapter"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462177"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 7th Python in Science Conference. SciPy 2008","author":"Hagberg Aric A.","year":"2008","unstructured":"Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring network structure, dynamics, and function using Network X. In Proceedings of the 7th Python in Science Conference. SciPy 2008 (Pasadena, California, USA, August 19--24, 2008). Ga\u00ebl Varoquaux, Travis Vaught, and Jarrod Millman, editors, 11--15. Retrieved 12\/19\/2018 from http:\/\/conference.scipy.org\/proceedings\/SciPy2008\/paper_2\/."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"P. L. Hammer P. Hansen and B. Simeone. 1984. Roof duality complementation and persistency in quadratic 0--1 optimization. Mathematical Programming 28 2 (February 1984) 121--155. issn: 1436--4646.","DOI":"10.1007\/BF02612354"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.80.052506"},{"key":"e_1_3_2_1_35_1","volume-title":"IEEE Standard for Verilog Hardware Description Language","author":"IEEE.","year":"2005","unstructured":"IEEE. 2006. IEEE Standard for Verilog Hardware Description Language. Standard IEEE Std 1364--2005. Design Automation StandardCommittee of the IEEE Computer Society, New York, New York, USA, (April 7, 2006). 590 pages."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.12.001"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.58.5355"},{"key":"e_1_3_2_1_38_1","first-page":"0","article-title":"Electronic Design Interchange Format (EDIF)","volume":"4","author":"Kahn Hilary","year":"2000","unstructured":"Hilary Kahn, Robin La Fontaine, and Rachel Lau. 2000. Electronic Design Interchange Format (EDIF). Part 2: Version 4 0 0. International Standard IEC 61690--2:2000. International Electrotechnical Commission, Manchester, United Kingdom, (January 31, 2000).","journal-title":"Part 2: Version"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick C. D. Gelatt and M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220 4598 (May 13 1983) 671--680. issn: 0036--8075.","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9734-0"},{"key":"e_1_3_2_1_42_1","volume-title":"Ising formulations of many NP problems. Frontiers in Physics, 2, (February 14","author":"Lucas Andrew","year":"2014","unstructured":"Andrew Lucas. 2014. Ising formulations of many NP problems. Frontiers in Physics, 2, (February 14, 2014), 5. issn: 2296--424X."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61566-0_39"},{"key":"e_1_3_2_1_44_1","unstructured":"Microsoft Corp. 2017. The Q# progamming language. (December 11 2017). Retrieved 07\/23\/2018 fromhttps:\/\/docs.microsoft.com\/en-us\/quantum\/quantum-qr-intro."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.99.070502"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1771668.1771709"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761616"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRC.2017.8123652"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761637"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Scott Pakin. 2018. Performing fully parallel constraint logic programming on a quantum annealer. Theory and Practice of Logic Programming.","DOI":"10.1017\/S1471068418000066"},{"key":"e_1_3_2_1_51_1","first-page":"1473","article-title":"A tale of two sieves","volume":"43","author":"Pomerance Carl","year":"1996","unstructured":"Carl Pomerance. 1996. A tale of two sieves. Notices of the AMS, 43,12, 1473--1485. issn: 0002--9920. Retrieved 08\/05\/2018 from https:\/\/www.ams.org\/journals\/notices\/199612\/pomerance.pdf.","journal-title":"Notices of the AMS"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007428"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-014-0892-x"},{"key":"e_1_3_2_1_54_1","volume-title":"Internet Draft draft-rivest-sexp-00.txt. Internet Engineering Task Force","author":"Rivest Ronald L.","year":"1994","unstructured":"Ronald L. Rivest. 1994. S-Expressions. Internet Draft draft-rivest-sexp-00.txt. Internet Engineering Task Force, Network Working Group, Cambridge, Massachusetts, USA, (May 4, 1994). Retrieved 08\/01\/2018 from http:\/\/people.csail.mit.edu\/rivest\/Sexp.txt."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_2_1_56_1","volume-title":"a minimalist quantum programming language. (April 14","author":"Singh Alexander","year":"2017","unstructured":"Alexander Singh, Konstantinos Giannakis, and Theodore Andronikos. 2017. Qumin, a minimalist quantum programming language. (April 14, 2017). arXiv:1704.04460v1{cs.PL}."},{"key":"e_1_3_2_1_57_1","volume-title":"Inc.(February 17","author":"Smith Robert S.","year":"2017","unstructured":"Robert S. Smith, Michael J. Curtis, and William J. Zeng. 2017. Apractical quantum instruction set architecture. Rigetti & Co., Inc.(February 17, 2017). arXiv: 1608.03355v2{quant-ph}."},{"key":"e_1_3_2_1_58_1","volume-title":"ProjectQ: an open source software framework for quantum computing. Quantum, 2, (January 31","author":"Steiger Damian S.","year":"2018","unstructured":"Damian S. Steiger, Thomas H\u00e4ner, and Matthias Troyer. 2018. ProjectQ: an open source software framework for quantum computing. Quantum, 2, (January 31, 2018), 49. issn: 2521--327X. arXiv: 1612.08091v2{quant-ph}."},{"key":"e_1_3_2_1_59_1","unstructured":"The Cirq Developers. {n. d.} Cirq: a Python library for NISQ circuits. Retrieved 12\/19\/2018 from https:\/\/cirq.readthedocs.io\/."},{"key":"e_1_3_2_1_60_1","article-title":"An accelerator architecture for combinatorial optimization problems","volume":"53","author":"Tsukamoto Sanroku","year":"2017","unstructured":"Sanroku Tsukamoto, Motomu Takatsu, Satoshi Matsubara, and Hirotaka Tamura. 2017. An accelerator architecture for combinatorial optimization problems. Fujitsu Scientific & Technical Journal, 53, 5, (November 2017), 8--13. Retrieved 07\/20\/2018 from http:\/\/www.fujitsu.com\/global\/documents\/about\/resources\/publications\/fstj\/archives\/vol53--5\/paper02.pdf.","journal-title":"Fujitsu Scientific & Technical Journal"},{"key":"e_1_3_2_1_61_1","volume-title":"Microsoft Research. (February 18","author":"Wecker Dave","year":"2014","unstructured":"Dave Wecker and Krysta M. Svore. 2014. LIQU i|: a software designarchitecture and domain-specific language for quantum computing. Microsoft Research. (February 18, 2014). arXiv:1402.4467v1{quant-ph}."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"J. D. Whitfield M. Faccin and J. D. Biamonte. 2012. Ground-state spinlogic.Europhysics Letters 99 5 (September 11 2012) 57004-p1--p7.issn: 1286--4854.","DOI":"10.1209\/0295-5075\/99\/57004"},{"key":"e_1_3_2_1_63_1","volume-title":"Proceedings of the 21st Austrian Workshop on Microelectronics. Austrochip 2013","author":"Wolf Clifford","year":"2013","unstructured":"Clifford Wolf and Johann Glaser. 2013. Yosys-a free Verilog synthesis suite. In Proceedings of the 21st Austrian Workshop on Microelectronics. Austrochip 2013 (Linz, Austria). (October 10, 2013).Retrieved 08\/01\/2018 from http:\/\/www.clifford.at\/yosys\/files\/yosys-austrochip2013.pdf."},{"key":"e_1_3_2_1_64_1","article-title":"A 20k-spinIsing chip to solve combinatorial optimization problems with CMOSannealing","volume":"51","author":"Yamaoka Masanao","year":"2016","unstructured":"Masanao Yamaoka, Chihiro Yoshimura, Masato Hayashi, Takuya Okuyama, Hidetaka Aoki, and Hiroyuki Mizuno. 2016. A 20k-spinIsing chip to solve combinatorial optimization problems with CMOSannealing. IEEE Journal of Solid-State Circuits, 51, 1, (January 2016), 303--309. issn: 0018--9200.","journal-title":"IEEE Journal of Solid-State Circuits"}],"event":{"name":"ASPLOS '19: Architectural Support for Programming Languages and Operating Systems","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Providence RI USA","acronym":"ASPLOS '19"},"container-title":["Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297858.3304071","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297858.3304071","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297858.3304071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:15Z","timestamp":1750204395000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297858.3304071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,4]]},"references-count":64,"alternative-id":["10.1145\/3297858.3304071","10.1145\/3297858"],"URL":"https:\/\/doi.org\/10.1145\/3297858.3304071","relation":{},"subject":[],"published":{"date-parts":[[2019,4,4]]},"assertion":[{"value":"2019-04-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}