We present a theoretical study of new families of stochastic complex information modules encoded in the hypergraph states which are defined by the fractional entropic descriptor. The essential connection between the Lyapunov exponents and d
-regular hypergraph fractal set is elucidated. To further resolve the divergence in the complexity of classical and quantum representation of a hypergraph, we have investigated the notion of non-amenability and its relation to combinatorics of dynamical self-organization for the case of fractal system of free group on finite generators. The exact relation between notion of hypergraph non-locality and quantum encoding through system sets of specified non-Abelian fractal geometric structures is presented. Obtained results give important impetus towards designing of approximation algorithms for chip imprinted
circuits in scalable quantum information systems.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited