Scheme Pearl: Quantum Continuations. Choudhury, V., Sabry, A., & Agapiev, B. September, 2022. 2022 Workshop on Scheme and Functional Programming
Paper abstract bibtex We advance the thesis that the simulation of quantum circuits is fundamentally about the efficient management of a large (potentially exponential) number of delimited continuations. The family of Scheme languages, with its efficient implementations of first-class continuations and with its imperative constructs, provides an elegant host for modeling and simulating quantum circuits.
@misc{Choudhury2022a,
title = {Scheme Pearl: Quantum Continuations},
author = {Choudhury, Vikraman and Sabry, Amr and Agapiev, Borislav},
year = {2022},
month = sep,
url = {https://andykeep.com/SchemeWorkshop2022/scheme2022-final37.pdf},
abstract = {We advance the thesis that the simulation of quantum circuits is fundamentally about the efficient management of a large (potentially exponential) number of delimited continuations. The family of Scheme languages, with its efficient implementations of first-class continuations and with its imperative constructs, provides an elegant host for modeling and simulating quantum circuits.},
note = {2022 Workshop on Scheme and Functional Programming},
webnote = {2022 Workshop on Scheme and Functional Programming},
bibsource = qplbib
}
Downloads: 0
{"_id":"v5cHSCRoTNBuHDpdD","bibbaseid":"choudhury-sabry-agapiev-schemepearlquantumcontinuations-2022","author_short":["Choudhury, V.","Sabry, A.","Agapiev, B."],"bibdata":{"bibtype":"misc","type":"misc","title":"Scheme Pearl: Quantum Continuations","author":[{"propositions":[],"lastnames":["Choudhury"],"firstnames":["Vikraman"],"suffixes":[]},{"propositions":[],"lastnames":["Sabry"],"firstnames":["Amr"],"suffixes":[]},{"propositions":[],"lastnames":["Agapiev"],"firstnames":["Borislav"],"suffixes":[]}],"year":"2022","month":"September","url":"https://andykeep.com/SchemeWorkshop2022/scheme2022-final37.pdf","abstract":"We advance the thesis that the simulation of quantum circuits is fundamentally about the efficient management of a large (potentially exponential) number of delimited continuations. The family of Scheme languages, with its efficient implementations of first-class continuations and with its imperative constructs, provides an elegant host for modeling and simulating quantum circuits.","note":"2022 Workshop on Scheme and Functional Programming","webnote":"2022 Workshop on Scheme and Functional Programming","bibsource":"Quantum Programming Languages & Verification Bibliography, https://git.io/qpl-bib","bibtex":"@misc{Choudhury2022a,\n title = {Scheme Pearl: Quantum Continuations},\n author = {Choudhury, Vikraman and Sabry, Amr and Agapiev, Borislav},\n year = {2022},\n month = sep,\n url = {https://andykeep.com/SchemeWorkshop2022/scheme2022-final37.pdf},\n abstract = {We advance the thesis that the simulation of quantum circuits is fundamentally about the efficient management of a large (potentially exponential) number of delimited continuations. The family of Scheme languages, with its efficient implementations of first-class continuations and with its imperative constructs, provides an elegant host for modeling and simulating quantum circuits.},\n note = {2022 Workshop on Scheme and Functional Programming},\n webnote = {2022 Workshop on Scheme and Functional Programming},\n bibsource = qplbib\n}\n\n","author_short":["Choudhury, V.","Sabry, A.","Agapiev, B."],"key":"Choudhury2022a","id":"Choudhury2022a","bibbaseid":"choudhury-sabry-agapiev-schemepearlquantumcontinuations-2022","role":"author","urls":{"Paper":"https://andykeep.com/SchemeWorkshop2022/scheme2022-final37.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"misc","biburl":"https://raw.githubusercontent.com/QuantumPL/bib/main/bbt.bib","dataSources":["JG9W34HAXfSxsC6ML"],"keywords":[],"search_terms":["scheme","pearl","quantum","continuations","choudhury","sabry","agapiev"],"title":"Scheme Pearl: Quantum Continuations","year":2022}