Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing

DOI10.46298/lmcs-20(1:20)2024zbMATH Open1544.81041MaRDI QIDQ6563043

Renaud Vilmart

Publication date: 27 June 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

verificationcompletenessquantum computationsum-over-pathsToffoli-Hadamardrewrite strategy

Mathematics Subject Classification ID

Quantum computation (81P68) Grammars and rewriting systems (68Q42) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean Gröbner bases
• The structure of sum-over-paths, its consequences, and completeness for Clifford
• An automated deductive verification framework for circuit-building quantum programs
• A Survey of Graphical Languages for Monoidal Categories
• The Compositional Structure of Multipartite Quantum Entanglement
• A Diagrammatic Axiomatisation for Qubit Entanglement
• Interacting quantum observables: categorical algebra and diagrammatics
• A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
• "NON-IDENTITY-CHECK" IS QMA-COMPLETE
• Completeness of the ZH-calculus
• Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes
• Addition and differentiation of ZX-diagrams
• Completeness of sum-over-paths for Toffoli-Hadamard and the dyadic fragments of quantum computation
• Hypergraph simplification: linking the path-sum approach to the ZH-calculus

This page was built for publication: Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing