The structure of sum-over-paths, its consequences, and completeness for Clifford
From MaRDI portal
Publication:2233432
Cites work
- scientific article; zbMATH DE number 2125662 (Why is no real title available?)
- scientific article; zbMATH DE number 7449972 (Why is no real title available?)
- scientific article; zbMATH DE number 7561601 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 7651038 (Why is no real title available?)
- A diagrammatic axiomatisation for qubit entanglement
- A survey of graphical languages for monoidal categories
- An automated deductive verification framework for circuit-building quantum programs
- Dagger compact closed categories and completely positive maps (extended abstract)
- Interacting quantum observables: categorical algebra and diagrammatics
- Pivoting makes the \textsc{zx}-calculus complete for real stabilizers
- The Compositional Structure of Multipartite Quantum Entanglement
- The ZX-calculus is complete for stabilizer quantum mechanics
- Towards large-scale functional verification of universal quantum circuits
- Two complete axiomatisations of pure-state qubit quantum computing
Cited in
(4)- Hypergraph simplification: linking the path-sum approach to the ZH-calculus
- Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes
- The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality
- Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing
This page was built for publication: The structure of sum-over-paths, its consequences, and completeness for Clifford
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233432)
