Related papers: Fractional revival on abelian Cayley graphs
Quantum networks are essential to quantum information distributed applications, and communicating over them is a key challenge. Complex networks have rich and intriguing properties, which are as yet unexplored in the quantum setting. Here,…
We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs with $2^k$ $\left(k\in\mathbb{Z}\right)$ vertices exhibit…
Recurrence in the classical random walk is well known and described by the P\'olya number. For quantum walks, recurrence is similarly understood in terms of the probability of a localized quantum walker to return to its origin. Under…
Perfect chiral circulation-the sequential transfer of a quantum state around a closed loop with unit fidelity-has been achieved in specific few-site systems, yet the universal physical conditions underlying this phenomenon remain unclear.…
Despite the large research effort devoted to learning dependencies between time series, the state of the art still faces a major limitation: existing methods learn partial correlations but fail to discriminate across distinct frequency…
This paper studies the nature of fractional linear transformations in a general relativity context as well as in a quantum theoretical framework. Two features are found to deserve special attention: the first is the possibility of…
In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex Hadamard matrices. We give some basic properties and…
We investigate novel transport properties of chiral continuous-time quantum walks (CTQWs) on graphs. By employing a gauge transformation, we demonstrate that CTQWs on chiral chains are equivalent to those on non-chiral chains, but with…
We introduce a class of partial differential equations on metric graphs associated with mixed evolution: on some edges we consider diffusion processes, on other ones transport phenomena. This yields a system of equations with possibly…
A quantum walk, \emph{i.e.}, the quantum evolution of a particle on a graph, is termed \emph{scalar} if the internal space of the moving particle (often called the coin) has a dimension one. Here, we study the existence of scalar quantum…
In a recent letter, J. Cardy, Phys. Rev. Lett. \textbf{112}, 220401 (2014), the author made a very interesting observation that complete revivals of quantum states after quantum quench can happen in a period which is a fraction of the…
We study the transport efficiency of excitations on complex quantum networks with loops. For this we consider sequentially growing networks with different topologies of the sequential subgraphs. This can lead either to a universal complete…
Analytic mass-spring chains with dispersionless pulse transfer and fractional revival are presented. These are obtained using the properties of the para-Racah polynomials. This provides classical analogs of the quantum spin chains that…
This work focuses on the generic identifiability of dynamical networks with partial excitation and measurement: a set of nodes are interconnected by transfer functions according to a known topology, some nodes are excited, some are…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
We construct infinite families of graphs in which pretty good state transfer can be induced by adding a potential to the nodes of the graph (i.e. adding a number to a diagonal entry of the adjacency matrix). Indeed, we show that given any…
Graph connectivity serves as a fundamental metric for evaluating the reliability and fault tolerance of interconnection networks. To more precisely characterize network robustness, the concept of cyclic connectivity has been introduced,…
We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…
A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions…