Recent publications have introduced the concept of quantum-like (QL) bits, along with their associated QL states and QL gate operations, which emerge from the dynamics of complex, synchronized networks. The present work extends these ideas to multi-level QL resources, referred to as QL dits, as higher-dimensional analogs of QL bits. We employ systems of k-regular graphs to construct QL-dits for arbitrary dimensions, where the emergent eigenspectrum of their adjacency matrices defines the QL-state space. The tensor product structure of multi-QL dit systems is realized through the Cartesian product of graphs. Furthermore, we examine the potential computational advantages of employing d-nary QL systems over two-level QL bit systems, particularly in terms of classical resource efficiency. Overall, this study generalizes the paradigm of using synchronized network dynamics for QL information processing to include higher-dimensional QL resources.
Saha et al. (Tue,) studied this question.