We develop a point of view on reduction of multiplicative proof nets based on quantum error-correcting codes. To each proof net we associate a code, in such a way that cut-elimination corresponds to error correction.
@article{arxiv.2405.19051,
title = {Linear Logic and Quantum Error Correcting Codes},
author = {Daniel Murfet and William Troiani},
journal= {arXiv preprint arXiv:2405.19051},
year = {2024}
}