Bounding the Graph Capacity with Quantum Mechanics and Finite Automata
Bounding the Graph Capacity with Quantum Mechanics and Finite Automata
The zero-error capacity of a channel (or Shannon capacity of a graph) quantifies how much information can be transmitted with no risk of error. In contrast to the Shannon capacity of a channel, the zero-error capacity has not even been shown to be computable: we have no convergent upper bounds. …