Related papers: Integrability in 1D Quantum Chaos
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist…
We introduce quantum association schemes. This allows to define distance regular and strongly regular quantum graphs. We bring examples thereof. In addition, we formulate the duality for translation quantum association schemes corresponding…
We introduce a family of models for quantum mechanical, one-dimensional random walks, called quantum multibaker maps (QMB). These are Weyl quantizations of the classical multibaker models previously considered by Gaspard, Tasaki and others.…
In this work we explain the necessity for consistently labeled rotation maps for efficiently computing coined discrete time quantum walks on regular graphs.
This article concerns arbitrary finite heteroclinic networks in any phase space dimension whose vertices can be a random mixture of equilibria and periodic orbits. In addition, tangencies in the intersection of un/stable manifolds are…
Periodic orbits for the classical $\phi^4$ theory on the one dimensional lattice are systematically constructed by extending the normal modes of the harmonic theory, for periodic, fixed and free boundary conditions. Through the process, we…
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenverctor with no zero elements. The problem of determining the orders $n$ for which $d$-regular nut graphs exist was recently posed by Gauci, Pisanski and…
Several aspects of classical and quantum mechanics applied to a class of strongly chaotic systems are studied. These consist of single particles moving without external forces on surfaces of constant negative Gaussian curvature whose…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
In this short note, we propose to extend differentiability (with respect to a multidimensional parameter) of a normalized eigenfunction associated to the simple, dominating eigenvalue of the weighted transfer operator for a uniformly…
We suggest the notion of perfect integrability for quantum spin chains and conjecture that quantum spin chains are perfectly integrable. We show the perfect integrability for Gaudin models associated to simple Lie algebras of all finite…
Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…
Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…
As the name indicates, a periodic orbit is a solution for a dynamical system that repeats itself in time. In the regular regime, periodic orbits are stable, while in the chaotic regime, they become unstable. The presence of unstable…
We prove that almost every non-regular real quadratic map is Collet-Eckmann and has polynomial recurrence of the critical orbit (proving a conjecture by Sinai). It follows that typical quadratic maps have excellent ergodic properties, as…