Scheme Pearl: Quantum Continuations

workshop
Authors
Affiliations

Vikraman Choudhury

University of Glasgow, UK

Borislav Agapiev

Amr Sabry

Indiana University, USA

Published

September 16, 2022

Doi

10.48550/arXiv.2409.11106

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.

Back to top

Citation

BibTeX citation:
@inproceedings{choudhury2024,
  author = {Choudhury, Vikraman and Agapiev, Borislav and Sabry, Amr},
  title = {Scheme {Pearl:} {Quantum} {Continuations}},
  booktitle = {Scheme and Functional Programming Workshop},
  date = {2024},
  url = {https://doi.org/10.48550/arXiv.2409.11106},
  doi = {10.48550/arXiv.2409.11106},
  langid = {en},
  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.}
}
For attribution, please cite this work as:
Choudhury, Vikraman, Borislav Agapiev, and Amr Sabry. 2024. “Scheme Pearl: Quantum Continuations.” Scheme and Functional Programming Workshop, accepted. https://doi.org/10.48550/arXiv.2409.11106.