Scheme Pearl: Quantum Continuations
<|reference_start|>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.<|reference_end|>
@article{choudhury2024scheme,
    title={Scheme Pearl: Quantum Continuations},
    author={Vikraman Choudhury, Borislav Agapiev, Amr Sabry},
    journal={arXiv preprint arXiv:2409.11106},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.11106},
    primaryClass={cs.PL}
}