Quantum graphs are redefined as left ideals in the extended Haagerup tensor product, enabling representation-independent morphisms and categorical (co)limits.
Zero-Error Communica- tion via Quantum Channels, Noncommutative Graphs, and a Quantum Lov´ asz Number
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.
citing papers explorer
-
Categorical (Co)Limits of Quantum Graphs
Quantum graphs are redefined as left ideals in the extended Haagerup tensor product, enabling representation-independent morphisms and categorical (co)limits.
-
Loop Composition in Quantum Algorithms
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.