Related papers: Perfect transmission and parallel composition for …
We study the continuous-time quantum walks on graphs in the adjacency algebra of the $n$-cube and its related distance regular graphs. For $k\geq 2$, we find graphs in the adjacency algebra of $(2^{k+2}-8)$-cube that admit instantaneous…
This work deals with quantum graphs, focusing on the transmission properties they engender. We first select two simple diamond graphs, and two hexagonal graphs in which the vertices are all of degree 3, and investigate their transmission…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…
Within the quantum sine-Gordon model a transmission matrix describing the scattering of a soliton with a fused pair of integrable defects is proposed. The result is consistent with the classical picture of scattering and highlights the…
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…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
The statistics of quantum transport through chaotic cavities with two leads is encoded in transport moments $M_m={\rm Tr}[(t^\dag t)^m]$, where $t$ is the transmission matrix, which have a known universal expression for systems without…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
Interaction of waves with point and line defects are usually described by $\delta$-function potentials supported on points or lines. In two dimensions, the scattering problem for a finite collection of point defects or parallel line defects…
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…
Quantum walks are roughly analogous to classical random walks, and like classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs it is useful to find the…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
We study perfect state transfer in Kendon's model of discrete quantum walks. In particular, we give a characterization of perfect state transfer purely in terms of the graph spectra, and construct an infinite family of $4$-regular circulant…
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
Let $L$ denote the Laplacian matrix of a graph $G$. We study continuous quantum walks on $G$ defined by the transition matrix $U(t)=\exp\left(itL\right)$. The initial state is of the pair state form, $e_a-e_b$ with $a,b$ being any two…