相关论文: Integrability in 1D Quantum Chaos

A sequential network of quantum operations is efficiently described by its quantum comb, a non-negative operator with suitable normalization constraints. Here we analyze the case of networks enjoying symmetry with respect to the action of a…

Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schr\"odinger Hamiltonians on metric graphs, with a focus on results related to…

We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…

We carry out a numerical study of fluctuations in the spectrum of regular graphs. Our experiments indicate that the level spacing distribution of a generic k-regular graph approaches that of the Gaussian Orthogonal Ensemble of random matrix…

Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…

Regular ring lattices (RRLs) are defined as peculiar undirected circulant graphs constructed from a cycle graph, wherein each node is connected to pairs of neighbors that are spaced progressively in terms of vertex degree. This kind of…

We establish several properties of the integrated density of states for random quantum graphs: Under appropriate ergodicity and amenability assumptions, the integrated density of states can be defined using an exhaustion procedure by…

In this article we classify normal forms and unfoldings of linear maps in eigenspaces of (anti)-automorphisms of order two. Our main motivation is provided by applications to linear systems of ordinary differential equations, general and…

We consider a non-compact Riemannian periodic manifold such that the corresponding Laplacian has a spectral gap. By continuously perturbing the periodic metric locally we can prove the existence of eigenvalues in a gap. A lower bound on the…

We investigate dynamical properties of a quantum generalization of classical reversible Boolean networks. The state of each node is encoded as a single qubit, and classical Boolean logic operations are supplemented by controlled bit-flip…

We consider the uniform random $d$-regular graph on $N$ vertices, with $d \in [N^\alpha, N^{2/3-\alpha}]$ for arbitrary $\alpha > 0$. We prove that in the bulk of the spectrum the local eigenvalue correlation functions and the distribution…

The unitary evolution maps in closed chaotic quantum graphs are known to have universal spectral correlations, as predicted by random matrix theory. In chaotic graphs with absorption the quantum maps become non-unitary. We show that their…

Recent work has connected the type of fidelity decay in perturbed quantum models to the presence of chaos in the associated classical models. We demonstrate that a system's rate of fidelity decay under repeated perturbations may be measured…

The eigenmode spectrum is a fundamental starting point for the analysis of plasma stability and the onset of turbulence, but the characterization of the spectrum even for the simplest plasma model, ideal magnetohydrodynamics (MHD), is not…

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…

Quantum network is a set of nodes connected with channels, through which the nodes communicate photons and classical information. Classical structural complexity of a quantum network may be defined through its physical structure, i.e.…

We prove that principal gradient schemes have regular reduced subschemes. We also obtain a regularity criterion for reduced quotient rings.

We study the transport efficiency of excitations on complex quantum networks with loops. For this we consider sequentially growing networks with different topologies of the sequential subgraphs. This can lead either to a universal complete…

We give a unified proof of the existence of turbulence for some classes of continuous interval maps which include, among other things, maps with periodic points of odd periods > 1, some maps with dense chain recurrent points and densely…

A recent result of one of the authors says that every connected subcubic bipartite graph that is not isomorphic to the Heawood graph has at least one, and in fact a positive proportion of its eigenvalues in the interval [-1,1]. We construct…