An unsharp logic from quantum computation
G. Cattaneo, M.L. Dalla Chiara, R. Giuntini, R. Leporini
TL;DR
This paper introduces a new unsharp quantum logic called computational quantum logic (CQL), derived from quantum computational gates like Toffoli, NOT, and square root of NOT, providing a logical framework for quantum computation.
Contribution
It develops a semantic characterization of CQL based on quantum gates, bridging quantum computation and logical formalism in a novel way.
Findings
Defines logical connectives for quantum gates
Provides a semantic model for CQL
Links quantum gates to logical structures
Abstract
Logical gates studied in quantum computation suggest a natural logical abstraction that gives rise to a new form of unsharp quantum logic. We study the logical connectives corresponding to the following gates: the Toffoli gate, the NOT and the squareroot of NOT (which admit of natural physical models). This leads to a semantic characterization of a logic that we call computational quantum logic CQL.
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 · Quantum Mechanics and Applications