Core Concepts
Zero-error unitary capacity provides new upper bounds for computing graph capacity.
Abstract
Abstract: The article introduces the concept of zero-error unitary capacity in graph capacity analysis, providing new upper bounds through quantum mechanics and finite automata.
Introduction: Defines Shannon capacity of a graph and its relation to independent sets, highlighting challenges in controlling the behavior.
Graph Capacity and Regular Languages: Discusses the equivalence between graph capacity and regular languages, emphasizing the growth rate of distinguishable strings.
Simplifying a DFA: Explores properties and growth rates of DFAs, focusing on connectedness and simplification without losing capacity.
Operators: Introduces the transition to operators for DFAs, discussing growth rates based on eigenvalues of transition matrices.
Reversibility: Examines reversible DFAs and their relationship to graph capacities, presenting bounds on reversible capacity.
Unitary Capacity: Introduces unitary capacity as a bridge between reversible and Shannon capacities, discussing its completeness and soundness in tensor value constraints.
Quantizing: Explores the quantization of transitions in quantum finite automata for accurate measurement of capacities.
Stats
新しい量子力学と有限オートマトンによるグラフ容量の上限を提供します。
ゼロエラー容量は、新しい上限を提供します。
新しい上限を通じて、グラフ容量の計算が可能です。