{"id":"https://openalex.org/W3109045280","doi":"https://doi.org/10.1145/3428198","title":"Enabling accuracy-aware Quantum compilers using symbolic resource estimation","display_name":"Enabling accuracy-aware Quantum compilers using symbolic resource estimation","publication_year":2020,"publication_date":"2020-11-13","ids":{"openalex":"https://openalex.org/W3109045280","doi":"https://doi.org/10.1145/3428198","mag":"3109045280"},"language":"en","primary_location":{"id":"doi:10.1145/3428198","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3428198","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3428198","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3428198","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Giulia Meuli","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Giulia Meuli","raw_affiliation_strings":["EPFL, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Mathias Soeken","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139986","display_name":"Microsoft (Switzerland)","ror":"https://ror.org/03zryq964","country_code":"CH","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210139986"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Mathias Soeken","raw_affiliation_strings":["Microsoft, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft, Switzerland","institution_ids":["https://openalex.org/I4210139986"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Martin Roetteler","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Roetteler","raw_affiliation_strings":["Microsoft, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":null,"display_name":"Thomas H\u00e4ner","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139986","display_name":"Microsoft (Switzerland)","ror":"https://ror.org/03zryq964","country_code":"CH","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210139986"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Thomas H\u00e4ner","raw_affiliation_strings":["Microsoft, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft, Switzerland","institution_ids":["https://openalex.org/I4210139986"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8051,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.79900875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"4","issue":"OOPSLA","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.746399998664856},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6373000144958496},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5842999815940857},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.5792999863624573},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5684000253677368},{"id":"https://openalex.org/keywords/quantum-circuit","display_name":"Quantum circuit","score":0.5594000220298767},{"id":"https://openalex.org/keywords/quantum-phase-estimation-algorithm","display_name":"Quantum phase estimation algorithm","score":0.5144000053405762},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4758000075817108}],"concepts":[{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.746399998664856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7401999831199646},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6373000144958496},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5842999815940857},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5792999863624573},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5684000253677368},{"id":"https://openalex.org/C124148022","wikidata":"https://www.wikidata.org/wiki/Q2122210","display_name":"Quantum circuit","level":5,"score":0.5594000220298767},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.5144000053405762},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4758000075817108},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.47099998593330383},{"id":"https://openalex.org/C59500034","wikidata":"https://www.wikidata.org/wiki/Q1464944","display_name":"Quantum Fourier transform","level":5,"score":0.4666999876499176},{"id":"https://openalex.org/C58849907","wikidata":"https://www.wikidata.org/wiki/Q2118982","display_name":"Quantum gate","level":4,"score":0.4359000027179718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38510000705718994},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.329800009727478},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32839998602867126},{"id":"https://openalex.org/C51003876","wikidata":"https://www.wikidata.org/wiki/Q1536431","display_name":"Quantum error correction","level":4,"score":0.3244999945163727},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.26809999346733093},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.2533000111579895},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C83581934","wikidata":"https://www.wikidata.org/wiki/Q527381","display_name":"Arbitrary-precision arithmetic","level":2,"score":0.2524999976158142},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.25}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3428198","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3428198","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3428198","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2003.08408","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2003.08408","pdf_url":"https://arxiv.org/pdf/2003.08408","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:288777","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/288777","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"research article"}],"best_oa_location":{"id":"doi:10.1145/3428198","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3428198","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3428198","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3109045280.pdf","grobid_xml":"https://content.openalex.org/works/W3109045280.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W1480910789","https://openalex.org/W1537615043","https://openalex.org/W1624887593","https://openalex.org/W1970005004","https://openalex.org/W1975548669","https://openalex.org/W2015179126","https://openalex.org/W2030867075","https://openalex.org/W2033216491","https://openalex.org/W2044357043","https://openalex.org/W2061091230","https://openalex.org/W2079294297","https://openalex.org/W2131668426","https://openalex.org/W2144319269","https://openalex.org/W2150528339","https://openalex.org/W2153235257","https://openalex.org/W2168676717","https://openalex.org/W2302430074","https://openalex.org/W2349487082","https://openalex.org/W2410653068","https://openalex.org/W2478948476","https://openalex.org/W2535738892","https://openalex.org/W2566002283","https://openalex.org/W2618676735","https://openalex.org/W2790668893","https://openalex.org/W2798434869","https://openalex.org/W2889126882","https://openalex.org/W2899524259","https://openalex.org/W2948602808","https://openalex.org/W2952568606","https://openalex.org/W2990961515","https://openalex.org/W3102303141","https://openalex.org/W3107039920","https://openalex.org/W4233847666","https://openalex.org/W4248729839","https://openalex.org/W4255749072","https://openalex.org/W6912284476"],"related_works":[],"abstract_inverted_index":{"Approximation":[0],"errors":[1,23],"must":[2],"be":[3,126],"taken":[4],"into":[5,11,81],"account":[6],"when":[7],"compiling":[8],"quantum":[9,46,70,96,104,156,161,164],"programs":[10],"a":[12,18,32,123],"low-level":[13],"gate":[14,97],"set.":[15],"We":[16,132,150],"present":[17],"methodology":[19],"that":[20,58],"tracks":[21],"such":[22],"automatically":[24],"and":[25,89,143,167],"then":[26],"optimizes":[27],"accuracy":[28,35,115],"parameters":[29,101],"to":[30,38,55],"guarantee":[31],"specified":[33],"overall":[34],"while":[36],"aiming":[37],"minimize":[39],"the":[40,60,65,69,86,91,103,119,129,146,160],"implementation":[41,92],"cost":[42,93],"in":[43,111,138],"terms":[44],"of":[45,51,68,102],"gates.":[47],"The":[48],"core":[49],"idea":[50],"our":[52,152],"approach":[53],"is":[54],"extract":[56],"functions":[57],"specify":[59],"optimization":[61,121],"problem":[62],"directly":[63],"from":[64,128],"high-level":[66],"description":[67],"program.":[71],"Then,":[72],"custom":[73],"compiler":[74,148],"passes":[75],"optimize":[76],"these":[77,112],"functions,":[78],"turning":[79],"them":[80],"(near-)symbolic":[82],"expressions":[83],"for":[84],"(1)":[85],"total":[87,95],"error":[88],"(2)":[90],"(e.g.,":[94],"count).":[98],"All":[99],"unspecified":[100],"program":[105],"will":[106],"show":[107],"up":[108],"as":[109],"variables":[110],"expressions,":[113],"including":[114,159],"parameters.":[116],"After":[117],"solving":[118],"corresponding":[120],"problem,":[122],"circuit":[124],"can":[125],"instantiated":[127],"found":[130],"solution.":[131],"develop":[133],"two":[134],"prototype":[135],"implementations,":[136],"one":[137],"C++":[139],"based":[140],"on":[141,154],"Clang/LLVM,":[142],"another":[144],"using":[145],"Q#":[147],"infrastructure.":[149],"benchmark":[151],"prototypes":[153],"typical":[155],"computing":[157],"programs,":[158],"Fourier":[162],"transform,":[163],"phase":[165],"estimation,":[166],"Shor's":[168],"algorithm.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2020-12-07T00:00:00"}