Related papers: Edge switching transformations of quantum graphs
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
A two-electron system confined in two coupled semiconductor quantum dots is investigated as a candidate for performing quantum logic operations on spin qubits. We study different processes of swapping the electron spins by controlled…
We give an estimate of the quantum variance for $d$-regular graphs quantised with boundary scattering matrices that prohibit back-scattering. For families of graphs that are expanders, with few short cycles, our estimate leads to quantum…
Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
A common choice for the evolution of the knotted graphs in loop quantum gravity is to use the Pachner moves, adapted to graphs from their dual triangulations. Here, we show that the natural way to consistently use these moves is on framed…
We numerically investigate quantum rings in graphene and find that their electronic properties may be strongly influenced by the geometry, the edge symmetries and the structure of the corners. Energy spectra are calculated for different…
We investigate the effect of different edge types on the statistical properties of both the energy spectrum of closed graphene billiards and the conductance of open graphene cavities in the semiclassical limit. To this end, we use the…
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…
We study quantum automorphism group of vertex-transitive graphs using intertwinner spaces of the magic unitary matrix associated to this quantum subgroups of $S_n^+$. We also give some applications to quantum symmetries of circulant graphs…
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…
We perform quantum mechanically exact calculations of resonances in the spectrum of the hydrogen atom in crossed external fields and establish a close connection between the classical transition state in phase space and features in the…
We prove quantum ergodicity for a family of periodic Schr\"odinger operators $H$ on periodic graphs. This means that most eigenfunctions of $H$ on large finite periodic graphs are equidistributed in some sense, hence delocalized. Our…
This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…
We propose a simple method for resolution of co-spectrality of Schr\"odinger operators on metric graphs. Our approach consists of attaching a lead to them and comparing the $S$-functions of the corresponding scattering problems on these…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
Node embeddings act as the information interface for graph neural networks, yet their empirical impact is often reported under mismatched backbones, splits, and training budgets. This paper provides a controlled benchmark of embedding…
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a…
This work concerns elementwise-transformations of spiked matrices: $Y_n = n^{-1/2} f( \sqrt{n} X_n + Z_n)$. Here, $f$ is a function applied elementwise, $X_n$ is a low-rank signal matrix, and $Z_n$ is white noise. We find that principal…
A local perturbation theory for the spectral analysis of the Schr\"odinger operator with two periodic potentials whose periods are commensurable has been constructed. It has been shown that the perturbation of the periodic 1D Hamiltonian by…