Scheme Pearl: Quantum Continuations
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909317882445824 |
|---|---|
| author | Choudhury, Vikraman Agapiev, Borislav Sabry, Amr |
| author_facet | Choudhury, Vikraman Agapiev, Borislav Sabry, Amr |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_11106 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Scheme Pearl: Quantum Continuations Choudhury, Vikraman Agapiev, Borislav Sabry, Amr Programming Languages 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. |
| title | Scheme Pearl: Quantum Continuations |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2409.11106 |