珍珠计划量子延续

arXiv - CS - Programming Languages Pub Date : 2024-09-17 DOI:arxiv-2409.11106

Vikraman Choudhury, Borislav Agapiev, Amr Sabry

{"title":"珍珠计划量子延续","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":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":null,\"pages\":null},\"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}","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

摘要

我们提出的论点是，量子电路的仿真从根本上说是对大量（可能是指数级的）分界连续过程的有效管理。Scheme语言家族高效地实现了一流的连续性，并具有互操作构造，为量子电路的建模和仿真提供了一个优雅的宿主。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Scheme Pearl: Quantum Continuations

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Programming Languages

自引率

0.00%

发文量