Metraipolis › archive › dc_042be9bf528f

Quantum-Logic Tsetlin Machines: Interpretable Quantum Machine Learning with Commuting Projector Clauses — arXiv:2608.18659

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.18659
License (as archived)
CC0-1.0
Archived
2026-10-18T13:53:49.654Z
SHA-256 of the archived text
9d4e66d4a56a0931ddb59a63b587858447fca9f5b6aed53c0440466375f229c5
Stable URL of this page
https://metraipolis.com/documento/dc_042be9bf528f

How to cite

Quantum-Logic Tsetlin Machines: Interpretable Quantum Machine Learning with Commuting Projector Clauses — arXiv:2608.18659 — arXiv (en), https://arxiv.org/abs/2608.18659 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_042be9bf528f (Metraipolis archive dc_042be9bf528f, sha256 9d4e66d4a56a0931ddb59a63b587858447fca9f5b6aed53c0440466375f229c5)
BibTeX
@misc{dc042be9bf528f,
  title = {Quantum-Logic Tsetlin Machines: Interpretable Quantum Machine Learning with Commuting Projector Clauses — arXiv:2608.18659},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.18659},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_042be9bf528f; sha256 9d4e66d4a56a0931ddb59a63b587858447fca9f5b6aed53c0440466375f229c5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18659. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Tsetlin Machines (TMs) learn interpretable Boolean clauses using finite-state automata. We introduce the Quantum-Logic Tsetlin Machine (QL-TM), which replaces Boolean literals with quantum propositions represented by projectors while retaining classical include/exclude automata. Clauses are restricted to commuting measurement contexts and activate through the Born probability of their joint projector. We prove an exact reduction to ordinary Boolean TM clauses in diagonal computational-basis contexts and connect Pauli-projector clauses to stabilizer and syndrome semantics. Controlled experiments on Bell states, phase-flip syndromes, randomized 16-class stabilizer tasks, mixed literal pools, context-budget ablations, and finite-shot noise show that correct non-diagonal contexts recover physically meaningful clauses, while diagonal or wrong contexts lose the relevant phase/syndrome information. The context-budget results closely follow the predicted separability ladder 2^(b-k) as true stabilizer generators are removed. The contribution is a controlled bridge between Tsetlin clause learning and quantum logic, not a claim of quantum advantage.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-20 in cs.LG).
Categorie arXiv: Quantum Physics (quant-ph) ; Machine Learning (cs.LG); Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.18659 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T13:50:58.998Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).