Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing

Renaud Vilmart. Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing. Logical Methods in Computer Science, 20(1), 2024. [doi]

Abstract

Abstract is missing.