相关论文: Edge switching transformations of quantum graphs
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…
Let $G$ be a finite $d$-regular graph with a proper edge coloring. An edge Kempe switch is a new proper edge coloring of $G$ obtained by switching the two colors along some bi-chromatic cycle. We prove that any other edge coloring can be…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
We evaluate the particular performance of different quantum machine learning networks on a graph classification task. Quantum circuits with varying internal symmetry that completely, partially and not at all confer to the symmetry of the…
The paper discusses quantum graphs with a vertex coupling which interpolates between the common one of the $\delta$ type and a coupling introduced recently by two of the authors which exhibits a preferred orientation. Describing the…
Although electrons and photons produce the same interference patterns in the two-slit experiments, the description of these patters is markedly different. This difference was analyzed by Bohm. Later on Sanz and Miret-Artes and others were…
This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…
Kirchoff's matrix tree theorem of 1847 connects the number of spanning trees of a graph to the spectral determinant of the discrete Laplacian [22]. Recently an analogue was obtained for quantum graphs relating the number of spanning trees…
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one…
We consider a modified graphene model under exchange couplings. Various quantum anomalous phases are known to emerge under uniform or staggered exchange couplings. We introduce the twist between the orientations of two sublattice exchange…
In this paper we study spectral properties of Schr\"odinger operators with quasi-periodic potentials related to quasi-periodic action minimizing trajectories for analytic twist maps. We prove that the spectrum contains a component of…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…
Spectral properties of Schr\"odinger operators on compact metric graphs are studied and special emphasis is put on differences in the spectral behavior between different classes of vertex conditions. We survey recent results especially for…
In the model suggested by Smilansky one studies an operator describing the interaction between a quantum graph and a system of K one-dimensional oscillators attached at different points of the graph. This paper is a continuation of our…
In this work, we construct and quantify asymptotically in the limit of large mass a variety of edge-localized stationary states of the focusing nonlinear Schr\"odinger equation on a quantum graph. The method is applicable to general bounded…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
This paper examines a model involving two dynamic Erd\H{o}s-R\'enyi random graphs that evolve in parallel, with edges in each graph alternating between being present and absent according to specified on- and off-time distributions. A key…