相关论文: Integrability in 1D Quantum Chaos

The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…

We study a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices. These Scattering Quantum Walks model the discrete dynamics of a system on the edges of the graph, with a scattering process at…

In a fully 3-D system such as a stellarator, the toroidal mode number $n$ ceases to be a good quantum number--all $n$s within a given mode family being coupled. It is found that the discrete spectrum of unstable ideal MHD…

The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced…

In this paper, we study the possible bifurcations of periodic orbits by reducing them to graphs. The aforementioned allows to study the genericity of routes to chaos, as well as to analyze their possible complexity. In particular, our…

Implicit regularization (IR) has been shown as an useful momentum space tool for perturbative calculations in dimension specific theories, such as chiral gauge, topological and supersymmetric quantum field theoretical models at one loop…

Existing quantum routing implicitly mimics classical routing principles, with finding the ``best'' path (aka pathfinding), according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However,…

Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for…

We analyze a model quantum dynamical system subjected to periodic interaction with an environment, which can describe quantum measurements. Under the condition of strong classical chaos and strong decoherence due to large coupling with the…

The quantum baker's map is the quantization of a simple classically chaotic system, and has many generic features that have been studied over the last few years. While there exists a semiclassical theory of this map, a more rigorous study…

It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…

We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of…

We consider the Dirac equation on periodic networks (quantum graphs). The self-adjoint quasi periodic boundary conditions are derived. The secular equation allowing us to find the energy spectrum of the Dirac particles on periodic quantum…

We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…

We propose a version of the Quantum Ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of "most" eigenfunctions. We consider expander graphs with few short cycles (for instance random large…

We derive combinatorial necessary conditions for discrete-time quantum walks defined by regular mixed graphs to be periodic. If the quantum walk is periodic, all the eigenvalues of the time evolution matrices must be algebraic integers.…

We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…

We calculate the S-matrix correlation function for chaotic scattering on quantum graphs and show that it agrees with that of random--matrix theory (RMT). We also calculate all higher S-matrix correlation functions in the Ericson regime.…

We investigate the universality of correlation functions of chaotic and disordered quantum systems as an external parameter is varied. A new, general scaling procedure is introduced which makes the theory invariant under reparametrizations.…

We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…