{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T09:23:58Z","timestamp":1773912238511,"version":"3.50.1"},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T00:00:00Z","timestamp":1764288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Centre for HPC, Big Data and Quantum Computing","award":["CN00000013"],"award-info":[{"award-number":["CN00000013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,3,16]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Quantum computing offers transformative capabilities by exploiting quantum mechanical principles to solve problems that are intractable for classical systems, particularly in areas like cryptography, optimization, and data analysis. However, most current quantum programming languages operate at a low level, requiring in-depth expertise in quantum mechanics and circuit theory, which presents a barrier to wider adoption. In this work, we introduce Qutes, a high-level quantum programming language that simplifies the development of quantum algorithms while preserving the flexibility needed for advanced applications. Qutes abstracts low-level quantum operations through intuitive syntax and high-level constructs, enabling developers to express complex algorithms without detailed circuit knowledge. Built atop Qiskit, Qutes transpiles seamlessly into executable code, ensuring compatibility with real quantum hardware. We present the architecture, language design, and hybrid classical-quantum integration of Qutes, and demonstrate its use through implementations of canonical quantum algorithms. Our results highlight Qutes\u2019 potential to democratize quantum programming by lowering the entry threshold and accelerating prototyping for researchers and developers alike.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf133","type":"journal-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T11:52:20Z","timestamp":1761133940000},"page":"597-612","source":"Crossref","is-referenced-by-count":0,"title":["Extending Qutes: a practical high-level language for quantum computing"],"prefix":"10.1093","volume":"69","author":[{"given":"Simone","family":"Faro","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica e Informatica , Universit\u00e0 di Catania, viale A. Doria n.6, 95125, Catania,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco Pio","family":"Marino","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica , Universit\u00e0 di Catania, viale A. Doria n.6, 95125, Catania,","place":["Italy"]},{"name":"Univ Rouen Normandie , INSA Rouen Normandie, Universit\u00e9 Le Havre Normandie, Normandie Univ, LITIS UR 4108, CNRS NormaSTIC FR 3638, IRIB, Rouen F-76000,","place":["France"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Messina","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica , Universit\u00e0 di Catania, viale A. Doria n.6, 95125, Catania,","place":["Italy"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,11,28]]},"reference":[{"key":"2026031900561340000_ref1","doi-asserted-by":"crossref","DOI":"10.1145\/3660318.3660327","article-title":"Practical implementation of a quantum string matching algorithm","volume-title":"Proceedings of the 2024 Workshop on Quantum Search and Information Retrieval","author":"Marino"},{"key":"2026031900561340000_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-73125-9_42","article-title":"Practical quantum combinatorial string matching","volume-title":"Lecture Notes in Networks and Systems","author":"Cantone","year":"2024"},{"key":"2026031900561340000_ref3","volume-title":"Quantum Computing with Qiskit","author":"Javadi-Abhari","year":"2024"},{"key":"2026031900561340000_ref4","volume-title":"Cirq.","author":"Cirq Developers","year":"2024"},{"key":"2026031900561340000_ref5","volume-title":"Open-Source Quantum Software Projects.","author":"Mark Fingerhuth","year":"2018"},{"key":"2026031900561340000_ref6","volume-title":"List of Qc Simulators.","author":"Quantiki","year":"2011"},{"key":"2026031900561340000_ref7","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-981-97-0989-2_13","volume-title":"Towards Higher Abstraction Levels in Quantum Computing,","author":"F\u00fcrntratt","year":"2024"},{"key":"2026031900561340000_ref8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3712002","article-title":"Quantum software engineering: roadmap and challenges ahead","volume":"34","author":"Murillo","year":"2025","journal-title":"ACM Trans Softw Eng Methodol"},{"key":"2026031900561340000_ref9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/237814.237866","article-title":"A fast quantum mechanical algorithm for database search","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","author":"Grover","year":"1996"},{"key":"2026031900561340000_ref10","first-page":"553","article-title":"Rapid solution of problems by quantum computation","volume":"439","author":"Deutsch","year":"1992","journal-title":"Proc R Soc Lond A Math Phys Sci"},{"key":"2026031900561340000_ref11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1098\/rspa.1998.0164","article-title":"Quantum algorithms revisited","volume":"454","author":"Cleve","year":"1998","journal-title":"Proc R Soc Lond Ser A: Math Phys Eng Sci"},{"key":"2026031900561340000_ref12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/2491956.2462177","article-title":"Quipper: a scalable quantum programming language","volume-title":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"Green","year":"2013"},{"key":"2026031900561340000_ref13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev"},{"key":"2026031900561340000_ref14","article-title":"Qmod: expressive high-level quantum modeling","volume-title":"IEEE International Conference on Quantum Software","author":"Vax","year":"2025"},{"key":"2026031900561340000_ref15","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/3385412.3386007","article-title":"Silq: a high-level quantum language with safe uncomputation and intuitive semantics","volume-title":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","author":"Bichsel","year":"2020"},{"key":"2026031900561340000_ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3498691","article-title":"Twist: sound reasoning for purity and entanglement in quantum programs","volume":"6","author":"Yuan","year":"2022","journal-title":"Proc ACM Program Lang"},{"key":"2026031900561340000_ref17","volume-title":"Open Quantum Assembly Language","author":"Cross","year":"2017"},{"key":"2026031900561340000_ref18","doi-asserted-by":"crossref","DOI":"10.1145\/3183895.3183901","article-title":"Q#: Enabling scalable quantum computing and development with a high-level DSL","volume-title":"Proceedings of the Real World Domain Specific Languages Workshop","author":"Svore","year":"2018"},{"key":"2026031900561340000_ref19","article-title":"A practical quantum instruction set architecture","author":"Smith","year":"2016"},{"key":"2026031900561340000_ref20","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213","article-title":"A variational eigenvalue solver on a photonic quantum processor","volume":"5","author":"Peruzzo","year":"2014","journal-title":"Nat Commun"},{"key":"2026031900561340000_ref21","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014"},{"key":"2026031900561340000_ref22","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","article-title":"A single quantum cannot be cloned","volume":"299","author":"Wootters","year":"1982","journal-title":"Nature"},{"key":"2026031900561340000_ref23","first-page":"979","article-title":"An abstraction hierarchy toward productive quantum programming","volume-title":"IEEE Quantum Week 2024 (QCE 2024)","author":"Di Matteo","year":"2024"},{"key":"2026031900561340000_ref24","volume-title":"The Definitive ANTLR 4 Reference","author":"Parr","year":"2013"},{"key":"2026031900561340000_ref25","first-page":"75","article-title":"Towards an efficient text sampling approach for exact and approximate matching","volume-title":"Stringology","author":"Faro","year":"2021"},{"key":"2026031900561340000_ref26","doi-asserted-by":"publisher","first-page":"3390","DOI":"10.1007\/s00453-020-00732-4","article-title":"Efficient online string matching based on characters distance text sampling","volume":"82","author":"Faro","year":"2020","journal-title":"Algorithmica"},{"key":"2026031900561340000_ref27","article-title":"Families of constant-depth quantum circuits for rotations and permutations","volume-title":"Proceedings of the 25nd Italian Conference on Theoretical Computer Science","author":"Faro","year":"2024"},{"key":"2026031900561340000_ref28","doi-asserted-by":"publisher","first-page":"415","DOI":"10.3390\/e25030415","article-title":"Entanglement swapping and swapped entanglement","volume":"25","author":"Zangi","year":"2023","journal-title":"Entropy"},{"key":"2026031900561340000_ref29","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","article-title":"Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels","volume":"70","author":"Bennett","year":"1993","journal-title":"Phys Rev Lett"},{"key":"2026031900561340000_ref30","volume-title":"The Rust Programming Language.","author":"Rust Project Developers","year":"2015"},{"key":"2026031900561340000_ref31","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/s44217-025-00400-1","article-title":"Quantum algorithms for enhanced educational technologies","volume":"4","author":"Hanafi","year":"2025","journal-title":"Discov Educ"},{"key":"2026031900561340000_ref32","doi-asserted-by":"publisher","DOI":"10.3390\/quantum7020024","article-title":"Theory and applications of quantum hashing","volume":"7","author":"Ablayev","year":"2023","journal-title":"Quantum Rep"},{"key":"2026031900561340000_ref33","doi-asserted-by":"publisher","first-page":"94057","DOI":"10.1109\/ACCESS.2025.3573244","article-title":"Quantum machine learning: recent advances, challenges, and perspectives","volume":"13","author":"Lamichhane","year":"2025","journal-title":"IEEE Access"},{"key":"2026031900561340000_ref34","doi-asserted-by":"publisher","DOI":"10.3390\/electronics13214153","article-title":"Hybridization of learning techniques and quantum mechanism for iiot security: applications, challenges, and prospects","volume":"13","author":"Sikiru","year":"2024","journal-title":"Electronics"},{"key":"2026031900561340000_ref35","doi-asserted-by":"publisher","first-page":"112161","DOI":"10.1016\/j.jss.2024.112161","article-title":"Hybrid quantum architecture for smart city security","volume":"217","author":"Barletta","year":"2024","journal-title":"J Syst Softw"},{"key":"2026031900561340000_ref36","doi-asserted-by":"crossref","DOI":"10.1145\/3731545.3744153","article-title":"Qutes: a high-level quantum programming language for simplified quantum computing","volume-title":"Proceedings of the 2025 Workshop on Quantum Algorithms","author":"Faro","year":"2025"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/3\/597\/65613716\/bxaf133.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/3\/597\/65613716\/bxaf133.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:56:25Z","timestamp":1773896185000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/69\/3\/597\/8351051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,28]]},"references-count":36,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,11,28]]},"published-print":{"date-parts":[[2026,3,16]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf133","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,3]]},"published":{"date-parts":[[2025,11,28]]}}}