{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:26:50Z","timestamp":1778905610575,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","funder":[{"name":"UK Engineering and Physical Sciences Research Council","award":["EP\/T517914\/1"],"award-info":[{"award-number":["EP\/T517914\/1"]}]},{"name":"Italy MUR (NextGenerationEU)","award":["SERICS (PE00000014)"],"award-info":[{"award-number":["SERICS (PE00000014)"]}]},{"name":"European Innovation Council","award":["EIC 101070802"],"award-info":[{"award-number":["EIC 101070802"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC 101089047"],"award-info":[{"award-number":["ERC 101089047"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"French National Research Agency","award":["EPIQ ANR-22-PETQ-0007"],"award-info":[{"award-number":["EPIQ ANR-22-PETQ-0007"]}]},{"name":"French National Research Agency","award":["HQI-Acquisition ANR-22-PNCQ-0001"],"award-info":[{"award-number":["HQI-Acquisition ANR-22-PNCQ-0001"]}]},{"name":"French National Research Agency","award":["HQI-R&D ANR-22-PNCQ-0002"],"award-info":[{"award-number":["HQI-R&D ANR-22-PNCQ-0002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3731545.3744152","type":"proceedings-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T12:46:16Z","timestamp":1757421976000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["High-level quantum algorithm programming using Silq"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3360-0231","authenticated-orcid":false,"given":"Viktorija","family":"Bezganovic","sequence":"first","affiliation":[{"name":"School of Computing, Newcastle University, Newcastle-upon-Tyne, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4893-7658","authenticated-orcid":false,"given":"Marco","family":"Lewis","sequence":"additional","affiliation":[{"name":"School of Computing, Newcastle University, Newcastle-upon-Tyne, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1922-6678","authenticated-orcid":false,"given":"Sadegh","family":"Soudjani","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Kaiserslautern, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6033-5919","authenticated-orcid":false,"given":"Paolo","family":"Zuliani","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 di Roma \"La Sapienza\", Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-020-00245-7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386007"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/261342.261346"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/305\/05215"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-05324-5_5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781003090052"},{"key":"e_1_3_2_1_7_1","unstructured":"Francini Corrales-Garro Danny Valerio-Ram\u00edrez and Santiago N\u00fa\u00f1ez-Corrales. 2025. Is Productivity in Quantum Programming Equivalent to Expressiveness? arXiv:2504.08876 [quant-ph]"},{"key":"e_1_3_2_1_8_1","unstructured":"Christoph D\u00fcrr and Peter H\u00f8yer. 1999. A Quantum Algorithm for Finding the Minimum. arXiv:quant-ph\/9607014 [quant-ph]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129506005378"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462177"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462177"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_13_1","unstructured":"Gurleenp. 2022. Quantum Algorithms [Qiskit Source Code]. https:\/\/github.com\/Gurleenp\/Quantum-Algorithms GitHub repository accessed 14\/04\/2025."},{"key":"e_1_3_2_1_14_1","unstructured":"Sergei V. Isakov Dvir Kafri Orion Martin Catherine Vollgraff Heidweiller Wojciech Mruczkiewicz Matthew P. Harrigan Nicholas C. Rubin Ross Thomson Michael Broughton Kevin Kissell Evan Peters Erik Gustafson Andy C. Y. Li Henry Lamm Gabriel Perdue Alan K. Ho Doug Strain and Sergio Boixo. 2021. Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq. arXiv:2111.02396 [quant-ph]"},{"key":"e_1_3_2_1_15_1","volume-title":"Gambetta","author":"Javadi-Abhari Ali","year":"2024","unstructured":"Ali Javadi-Abhari, Matthew Treinish, Kevin Krsulich, Christopher J. Wood, Jake Lishman, Julien Gacon, Simon Martiel, Paul D. Nation, Lev S. Bishop, Andrew W. Cross, Blake R. Johnson, and Jay M. Gambetta. 2024. Quantum computing with Qiskit. arXiv:2405.08810 [quant-ph]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3624483"},{"key":"e_1_3_2_1_17_1","volume-title":"Chuang","author":"Nielsen Michael A.","year":"2000","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-024-04258-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICICV50876.2021.9388498"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4204\/eptcs.394.10"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183895.3183901"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563297"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498691"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2218775120"}],"event":{"name":"HPDC '25: 34th International Symposium on High-Performance Parallel and Distributed Computing","location":"University of Notre Dame Conference Facilities Notre Dame IN USA","acronym":"HPDC '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3731545.3744152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T12:50:34Z","timestamp":1757422234000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3731545.3744152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":25,"alternative-id":["10.1145\/3731545.3744152","10.1145\/3731545"],"URL":"https:\/\/doi.org\/10.1145\/3731545.3744152","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-09-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}