Related papers: Integrability in 1D Quantum Chaos
We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
For an $n \times n$ matrix $A$, let $q(A)$ be the number of distinct eigenvalues of $A$. If $G$ is a connected graph on $n$ vertices, let $\mathcal{S}(G)$ be the set of all real symmetric $n \times n$ matrices $A=[a_{ij}]$ such that for…
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in…
We prove that any completely regular code with minimum eigenvalue in any geometric graph G corresponds to a completely regular code in the clique graph of G. Studying the interrelation of these codes, a complete characterization of the…
We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…
A nut graph is a simple graph whose adjacency matrix is singular with $1$-dimensional kernel such that the corresponding eigenvector has no zero entries. In 2020, Fowler et al. characterised for each $d \in \{3,4,\ldots,11\}$ all values $n$…
Electronic transport through chaotic quantum dots exhibits universal, system independent, properties, consistent with random matrix theory. The quantum transport can also be rooted, via the semiclassical approximation, in sums over the…
Entangled quantum networks provide great flexibilities and scalabilities for quantum information processing or quantum Internet. Most of results are focused on the nonlocalities of quantum networks. Our goal in this work is to explore new…
Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
Let $D$ be a weighted oriented graph with the underlying graph $G$ and $I(D), I(G) $ be the edge ideals corresponding to $D$ and $G$ respectively. We show that the regularity of edge ideal of a certain class of weighted oriented graph…
Regular Lie groups are infinite dimensional Lie groups with the property that smooth curves in the Lie algebra integrate to smooth curves in the group in a smooth way (an `evolution operator' exists). Up to now all known smooth Lie groups…
Scheme independence of exact renormalization group equations, including independence of the choice of cutoff function, is shown to follow from general field redefinitions, which remains an inherent redundancy in quantum field theories.…
Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
We consider a sequence of finite quantum graphs with few loops, so that they converge, in the sense of Benjamini-Schramm, to a random infinite quantum tree. We assume these quantum trees are spectrally delocalized in some interval $I$, in…
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
Recurrence in the phase space of complex systems is a well-studied phenomenon, which has provided deep insights into the nonlinear dynamics of such systems. For dissipative systems, characteristics based on recurrence plots have recently…
There exist certain intrinsic relations between the ultraviolet divergent graphs and the convergent ones at the same loop order in renormalizable quantum field theories. Whereupon we may establish a new method, the intrinsic regularization…