Related papers: State transfer on integral mixed circulant graphs
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
We consider a spin network resembling an $\alpha$-helix structure and study quantum information transfer over this bio-inspired network. The model we use is the Davydov model in its elementary version without a phononic environment. We…
We consider quantum state transfer on finite graphs which are attached to infinite paths. The finite graph represents an operational quantum system for performing useful quantum information tasks. In contrast, the infinite paths represent…
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.…
We present an algorithm to design networks that feature pretty good state transfer (PGST), which is of interest for high-fidelity transfer of information in quantum computing. Realizations of PGST networks have so far mostly relied either…
This paper focuses on periodicity and perfect state transfer of Grover walks on two well-known families of Cayley graphs, namely, the unitary Cayley graphs and the quadratic unitary Cayley graphs. Let $R$ be a finite commutative ring. The…
We systematically study the parity- and time-reversal (PT) symmetric non-Hermitian version of a quantum network proposed in the paper of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)]. The nature of this model shows that it is a…
It is shown that an undirected graph $G$ is cospectral with the Hermitian adjacency matrix of a mixed graph $D$ obtained from a subgraph $H$ of $G$ by orienting some of its edges if and only if $H=G$ and $D$ is obtained from $G$ by a…
We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they…
Given two graphs $G_{1}$ of order $n_{1}$ and $G_{2}$, the neighborhood corona of $G_{1}$ and $G_{2}$, denoted by $G_{1}\bigstar G_{2}$, is the graph obtained by taking one copy of $G_{1}$ and taking $n_{1}$ copies of $G_{2}$, in the…
We investigate the fidelity of the quantum state transfer (QST) of two qubits by means of an arbitrary spin-1/2 network, on a lattice of any dimensionality. Under the assumptions that the network Hamiltonian preserves the magnetization and…
A signed directed graph is a graph with sign and direction information on the edges. Even though signed directed graphs are more informative than unsigned or undirected graphs, they are more complicated to analyze and have received less…
Photonic structures have an inherent advantage to realize PT-phase transition through modulating the refractive index or gain-loss. However, quantum PT properties of these photonic systems have not been comprehensively studied yet. Here, in…
We consider a coupled-cavity array, where each cavity interacts with an atom under the rotating-wave approximation. For a staggered pattern of inter-cavity couplings, a pair of field normal modes each bi-localized at the two array ends…
Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectra contain the minimum number of two distinct eigenvalues.…
We present a distributed randomized algorithm finding Minimum Spanning Tree (MST) of a given graph in O(1) rounds, with high probability, in the Congested Clique model. The input graph in the Congested Clique model is a graph of n nodes,…
Multiple quantum (MQ) NMR coherence spectra, which can be obtained experimentally in MQ NMR, can be transferred from the sender to the remote receiver without mixing the MQ-coherences of different orders and distortions. The only effect of…
The unitary Cayley graph has vertex set $\{0,1, \hdots ,n-1\}$, where two vertices $u$ and $v$ are adjacent if $\gcd(u - v, n) = 1$. In this paper, we study periodicity and perfect state transfer of Grover walks on the unitary Cayley…
Perfect state transfer (PST) is discussed in the context of passive quantum networks with logical bus topology, where many logical nodes communicate using the same shared media, without any external control. The conditions under which, a…
The natural notion of almost perfect state transfer (APST) is examined. It is applied to the modelling of efficient quantum wires with the help of $XX$ spin chains. It is shown that APST occurs in mirror-symmetric systems, when the…