相关论文: Explicit, analytical solution of scaling quantum g…

This article tackles a fundamental long-standing problem in quantum chaos, namely, whether quantum chaotic systems can exhibit sensitivity to initial conditions, in a form that directly generalizes the notion of classical chaos in phase…

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…

The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…

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…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

In the broad range of studies related to quantum graphs, quantum graph spectra appear as a topic of special interest. They are important in the context of diffusion type problems posed on metric graphs. Theoretical findings suggest that…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

We systematise and develop a graphical approach to the investigations of quantum integrable vertex statistical models and the corresponding quantum spin chains. The graphical forms of the unitarity and various crossing relations are…

Even as we understand for long that the world is quantal and buried in it is classical dynamics which is chaotic, finding eigenfunctions analytically from the the Schroedinger equation has turned out to be a near-impossibility. Here, we…

We analyze the nonlinear optics of quasi one-dimensional quantum graphs and manipulate their topology and geometry to generate for the first time nonlinearities in a simple system approaching the fundamental limits of the first and second…

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…

Explicit, exact periodic orbit expansions for individual eigenvalues exist for a subclass of quantum networks called regular quantum graphs. We prove that all linear chain graphs have a regular regime.

Within the frame of a novel treatment we make a complete mathematical analysis of exactly solvable one-dimensional quantum systems with non-constant mass, involving their ordering ambiguities. This work extends the results recently reported…

Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…

The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…

We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…

Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…

The quantum hidden subgroup approach is an actively studied approach to solve combinatorial problems in quantum complexity theory. With the success of the Shor's algorithm, it was hoped that similar approach may be useful to solve the other…

We investigate the spectral properties of chaotic quantum graphs. We demonstrate that the `energy'--average over the spectrum of individual graphs can be traded for the functional average over a supersymmetric non--linear $\sigma$--model…