Linear Logic and Quantum Error Correcting Codes
Daniel Murfet, William Troiani
TL;DR
This paper explores the connection between linear logic proof nets and quantum error-correcting codes, showing how cut-elimination in proof nets corresponds to error correction in quantum codes.
Contribution
It introduces a novel perspective linking proof net reduction to quantum error correction, providing a new framework for understanding quantum computational processes.
Findings
Proof nets can be associated with quantum error-correcting codes.
Cut-elimination corresponds to quantum error correction.
Provides a new conceptual bridge between logic and quantum computing.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography