Related papers: Quantum Fractional Revival on Graphs
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (i, j), if i is connected to j then there is a path from j to i. We show that reversibility is a necessary and…
Advection properties of passive particles in flows generated by point vortices are considered. Transport properties are anomalous with characteristic transport exponent $\mu \sim 1.5$. This behavior is linked back to the presence of…
In this paper, we study quantum walks on the extension of association schemes. Various state transfers can be achieved on these graphs, such as multiple state transfer among extreme points of a simplex, fractional revival on subsimplexes.…
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
Recently it has been shown that interparticle interactions\emph ongenerically\emph default destroy dynamical localization in periodically driven systems, resulting in diffusive transport and heating. In this work we rigorously construct a…
In this paper, we investigate the existence of fractional revival on semi-Cayley graphs over finite abelian groups. We give some necessary and sufficient conditions for semi-Cayley graphs over finite abelian groups admitting fractional…
We investigate the time evolution of Gaussian wave packet (GWP) in the tight-binding chain with uniform nearest neighbor (NN) hopping integral. Analytical analysis and numerical simulations show that the fractional revival of the quantum…
Transformers are increasingly employed for graph data, demonstrating competitive performance in diverse tasks. To incorporate graph information into these models, it is essential to enhance node and edge features with positional encodings.…
We study the problem of graph structure identification, i.e., of recovering the graph of dependencies among time series. We model these time series data as components of the state of linear stochastic networked dynamical systems. We assume…
Let $\Gamma$ be a graph with the adjacency matrix $A$. The transition matrix of $\Gamma$, denoted $H(t)$, is defined as $H(t) := \exp(-\textbf{i}tA)$, where $\textbf{i} := \sqrt{-1}$ and $t$ is a real variable. The graph $\Gamma$ is said to…
This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…
We report fractional revival phenomena in an ultracold matter wave inside a ring waveguide. The specific fractional revival times are precisely identified and corresponding spatial density patterns are depicted. Thorough analyses of the…
Fractionalization is a phenomenon where an elementary excitation partitions into several pieces. This picture explains non-trivial transport through a junction of one-dimensional edge channels defined by topologically distinct quantum Hall…
In this work, we propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. These encodings leverage the long-range correlations inherent in quantum systems that arise from mapping the…
The recognition that large classes of quantum many-body systems have limited entanglement in the ground and low-lying excited states led to dramatic advances in their numerical simulation via so-called tensor networks. However, global…
We develop the theory of pretty good fractional revival in quantum walks on graphs using their Laplacian matrices as the Hamiltonian. We classify the paths and the double stars that have Laplacian pretty good fractional revival.
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…