A Rewriting Theory for Quantum Lambda-Calculus
Logic in Computer Science
2025-01-29 v2
Abstract
Quantum lambda calculus has been studied mainly as an idealized programming language -- the evaluation essentially corresponds to a deterministic abstract machine. Very little work has been done to develop a rewriting theory for quantum lambda calculus. Recent advances in the theory of probabilistic rewriting give us a way to tackle this task with tools unavailable a decade ago. Our primary focus is standardization and normalization results.
Cite
@article{arxiv.2411.14856,
title = {A Rewriting Theory for Quantum Lambda-Calculus},
author = {Claudia Faggian and Gaetan Lopez and Benoît Valiron},
journal= {arXiv preprint arXiv:2411.14856},
year = {2025}
}
Comments
CSL2025: 33rd EACSL Annual Conference on Computer Science Logic 2025