Related papers: One-dimensional quantum chaos: Explicitly solvable…
We derive a set of spectral statistics whose power spectrum is characterized, in the case of chaotic quantum systems, by colored noise $1/f^{\gamma}$, where the integer parameter $\gamma$ critically depends on the specific energy-level…
It has been long recognized that the task of semiclassical evaluation of quantum spectra for the classically nonintegrable systems is fundamentally more complex than for the classically integrable ones. Below it is argued that the quantum…
Quantum groups have a long and fruitful history of applications in integrable systems. Can quantum group symmetries exist in the absence of integrability? We provide an explicit example of a system with quantum group global symmetry which…
Recently, a novel GHZ/W graphical calculus has been established to study and reason more intuitively about interacting quantum systems. The compositional structure of this calculus was shown to be well-equipped to sufficiently express…
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,…
Owing to their interesting spectral properties, the synthetic crystals over lattices other than regular Euclidean lattices, such as hyperbolic and fractal ones, have attracted renewed attention, especially from materials and meta-materials…
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.…
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
Quantum chaos refers to signatures of classical chaos found in the quantum domain. Recently, it has become common to equate the exponential behavior of out-of-time order correlators (OTOCs) with quantum chaos. The quantum-classical…
The explicit solution to the spectral problem of quantum graphs is used to obtain the exact distributions of several spectral statistics, such as the oscillations of the quantum momentum eigenvalues around the average, $\delta…
In quantum chaos, the spectral statistics generally follows the predictions of Random Matrix Theory (RMT). A notable exception is given by scar states, that enhance probability density around unstable periodic orbits of the classical…
We consider the distribution of the (properly normalized) numbers of nodal domains of wave functions in 2-$d$ quantum billiards. We show that these distributions distinguish clearly between systems with integrable (separable) or chaotic…
We shortly review the progress in the domain of deterministic chaos for quantum dynamical systems. With the appropriately extended definition of quantum Lyapunov exponent we analyze various quantum dynamical maps. It is argued that, within…
Motivated by a recent application of quantum graphs to model the anomalous Hall effect we discuss quantum graphs the vertices of which exhibit a preferred orientation. We describe an example of such a vertex coupling and analyze the…
Numerical calculation and analysis of extremely high-lying energy spectra, containing thousands of levels with sequential quantum number up to 62,000 per symmetry class, of a generic chaotic 3D quantum billiard is reported. The shape of the…
We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
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…
For chaotic scattering on quantum graphs, the semiclassical approximation is exact. We use this fact and employ supersymmetry, the colour-flavour transformation, and the saddle-point approximation to calculate the exact expression for the…