Quantum-Logic Tsetlin Machines: Interpretable Quantum Machine Learning with Commuting Projector Clauses
Read the original on arXiv Machine Learning →The paper introduces the Quantum-Logic Tsetlin Machine (QL‑TM), a variant of Tsetlin Machines that replaces Boolean literals with quantum propositions represented by projectors while keeping the classical include/exclude automata. Clauses are limited to commuting measurement contexts and are activated through the Born probability of their joint projector, allowing an exact reduction to ordinary Boolean TM clauses in diagonal computational‑basis contexts. Experiments on Bell states, phase‑flip syndromes, stabilizer tasks, and noise‑robust settings demonstrate that correct non‑diagonal contexts recover physically meaningful clauses, whereas diagonal or wrong contexts lose phase or syndrome information, and the context‑budget results align with the predicted separability ladder.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.