Related papers: A graph-theoretic approach to chaos and complexity…
We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…
The growth of simple operators is essential for the emergence of chaotic dynamics and quantum thermalization. Recent studies have proposed different measures, including the out-of-time-order correlator and Krylov complexity. It is…
The out-of-time-ordered correlation (OTOC) and entanglement are two physically motivated and widely used probes of the "scrambling" of quantum information, a phenomenon that has drawn great interest recently in quantum gravity and many-body…
Recurrence in the phase space of complex systems is a well-studied phenomenon, which has provided deep insights into the nonlinear dynamics of such systems. For dissipative systems, characteristics based on recurrence plots have recently…
A system of quantum computing structures is introduced and proven capable of making emerge, on average, the orbits of classical bounded nonlinear maps on \mathbb{C} through the iterative action of path-dependent quantum gates. The effects…
The incompatibility of measurements is the key feature of quantum theory that distinguishes it from the classical description of nature. Here, we consider groups of d-outcome quantum observables with prime d represented by non-Hermitian…
A drawback of the classic approach for complexity analysis of distributed graph problems is that it mostly informs about the complexity of notorious classes of ``worst case'' graphs. Algorithms that are used to prove a tight (existential)…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
The realization of a paradigm chaotic system, namely the harmonically driven oscillator, in the quantum domain using cold trapped ions driven by lasers is theoretically investigated. The simplest characteristics of regular and chaotic…
We investigate the detailed dynamics of multidimensional Hamiltonian systems by studying the evolution of volume elements formed by unit deviation vectors about their orbits. The behavior of these volumes is strongly influenced by the…
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…
Let $R$ be a commutative ring. In \cite{KK_2025(1)}, the authors introduced $R$-weighted graphs as a tool for studying commutators in groups and Lie algebras. These graphs are equivalent to a system of balance equations, and their…
The main purpose of thispaper is to show that composite quantum-like (QL) systems can closely mimic the separable states of quantum systems, and that suitable physical systems exhibiting these states exist. It is shown that QL graphs can…
We propose an algebraic framework for generalized graph Laplacians which unifies the study of resistor networks, the critical group, and the eigenvalues of the Laplacian and adjacency matrices. Given a graph with boundary $G$ together with…
Out-of-Time-Ordered Commutators (OTOCs), representing a key diagnostic for scrambling as a facet of short-time quantum chaos, have attracted wide-ranging interest, from many-body physics to quantum gravity. By means of a suitable form of…
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…
We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to…
Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly…
Advances in quantum computing over the last two decades have required sophisticated mathematical frameworks to deepen the understanding of quantum algorithms. In this review, we introduce the theory of Lie groups and their algebras to…
Understanding quantum chaos is of profound theoretical interest and carries significant implications for various applications, from condensed matter physics to quantum error correction. Recently, out-of-time ordered correlators (OTOCs) have…