Related papers: Approximate quantum fractional revival in paths an…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
Classical and quantum walks on some finite paths are introduced. It is shown that these walks have explicit solutions given in terms of exceptional Krawtchouk polynomials and their properties are explored. In particular, fractional revival…
Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H(t):=\exp{\left(-itA\right)},\;t\in\Rl$. The graph $G$ is said to admit pretty good state transfer between a pair of vertices $u$ and…
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is…
The production of quantum states required for use in quantum protocols & technologies is studied by developing the tools to re-engineer a perfect state transfer spin chain so that a separable input excitation is output over multiple sites.…
We consider the representation of a continuous-time quantum walk in a graph $X$ by the matrix $\exp(itA(X))$. We provide necessary and sufficient criteria for distance-regular graphs and, more generally, for graphs in association schemes to…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
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…
We consider the revival properties of quantum systems with an eigenspectrum E_{n} proportional to n^{2}, and compare them with the simplest member of this class - the infinite square well. In addition to having perfect revivals at integer…
In this paper, we investigate the existence of fractional revival on Cayley graphs over finite abelian groups. We give a necessary and sufficient condition for Cayley graphs over finite abelian groups to have fractional revival. As…
Wave packet revivals and fractional revivals are hallmark quantum interference phenomena that arise in systems with nonlinear energy spectra, and their signatures in expectation values of observables have been studied extensively in earlier…
Quantum walks are known to have nontrivial interactions with absorbing boundaries. In particular it has been shown that an absorbing boundary in the one dimensional quantum walk partially reflects information, as observed by absorption…
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 investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \cite{Anima} for the…
We show that the time frequency analysis of the autocorrelation function is, in many ways, a more appropriate tool to resolve fractional revivals of a wave packet than the usual time domain analysis. This advantage is crucial in…
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…