Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics. Bichsel, B., Baader, M., Gehr, T., & Vechev, M. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, of PLDI '20, pages 286–300, New York, NY, USA, June, 2020. Association for Computing Machinery. ![Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi abstract bibtex Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46% for Q#, -38% for Quipper), while using only half the number of quantum primitives.
@inproceedings{Bichsel2020,
title = {Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics},
shorttitle = {Silq},
author = {Bichsel, Benjamin and Baader, Maximilian and Gehr, Timon and Vechev, Martin},
year = {2020},
month = jun,
booktitle = {Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation},
publisher = acm,
address = {{New York, NY, USA}},
series = {{{PLDI}} '20},
pages = {286--300},
doi = {10.1145/3385412.3386007},
url = {https://files.sri.inf.ethz.ch/website/papers/pldi20-silq.pdf},
abstract = {Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46\% for Q\#, -38\% for Quipper), while using only half the number of quantum primitives.},
keywords = {quantum language, semantics, uncomputation},
bibsource = qplbib
}
Downloads: 0
{"_id":"ccooxv6zYrJgQCv4N","bibbaseid":"bichsel-baader-gehr-vechev-silqahighlevelquantumlanguagewithsafeuncomputationandintuitivesemantics-2020","author_short":["Bichsel, B.","Baader, M.","Gehr, T.","Vechev, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics","shorttitle":"Silq","author":[{"propositions":[],"lastnames":["Bichsel"],"firstnames":["Benjamin"],"suffixes":[]},{"propositions":[],"lastnames":["Baader"],"firstnames":["Maximilian"],"suffixes":[]},{"propositions":[],"lastnames":["Gehr"],"firstnames":["Timon"],"suffixes":[]},{"propositions":[],"lastnames":["Vechev"],"firstnames":["Martin"],"suffixes":[]}],"year":"2020","month":"June","booktitle":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","publisher":"Association for Computing Machinery","address":"New York, NY, USA","series":"PLDI '20","pages":"286–300","doi":"10.1145/3385412.3386007","url":"https://files.sri.inf.ethz.ch/website/papers/pldi20-silq.pdf","abstract":"Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46% for Q#, -38% for Quipper), while using only half the number of quantum primitives.","keywords":"quantum language, semantics, uncomputation","bibsource":"Quantum Programming Languages & Verification Bibliography, https://git.io/qpl-bib","bibtex":"@inproceedings{Bichsel2020,\n title = {Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics},\n shorttitle = {Silq},\n author = {Bichsel, Benjamin and Baader, Maximilian and Gehr, Timon and Vechev, Martin},\n year = {2020},\n month = jun,\n booktitle = {Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation},\n publisher = acm,\n address = {{New York, NY, USA}},\n series = {{{PLDI}} '20},\n pages = {286--300},\n doi = {10.1145/3385412.3386007},\n url = {https://files.sri.inf.ethz.ch/website/papers/pldi20-silq.pdf},\n abstract = {Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46\\% for Q\\#, -38\\% for Quipper), while using only half the number of quantum primitives.},\n keywords = {quantum language, semantics, uncomputation},\n bibsource = qplbib\n}\n\n","author_short":["Bichsel, B.","Baader, M.","Gehr, T.","Vechev, M."],"key":"Bichsel2020","id":"Bichsel2020","bibbaseid":"bichsel-baader-gehr-vechev-silqahighlevelquantumlanguagewithsafeuncomputationandintuitivesemantics-2020","role":"author","urls":{"Paper":"https://files.sri.inf.ethz.ch/website/papers/pldi20-silq.pdf"},"keyword":["quantum language","semantics","uncomputation"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/QuantumPL/bib/main/bbt.bib","dataSources":["JG9W34HAXfSxsC6ML","MbqeeC74KZhwBpe8j"],"keywords":["quantum language","semantics","uncomputation"],"search_terms":["silq","high","level","quantum","language","safe","uncomputation","intuitive","semantics","bichsel","baader","gehr","vechev"],"title":"Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics","year":2020}