{"title":"Scheme Pearl: Quantum Continuations","authors":"Vikraman Choudhury, Borislav Agapiev, Amr Sabry","doi":"arxiv-2409.11106","DOIUrl":null,"url":null,"abstract":"We advance the thesis that the simulation of quantum circuits is\nfundamentally about the efficient management of a large (potentially\nexponential) number of delimited continuations. The family of Scheme languages,\nwith its efficient implementations of first-class continuations and with its\nimperative constructs, provides an elegant host for modeling and simulating\nquantum circuits.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"40 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
