Related papers: State transfer on integral mixed circulant graphs
We study transfer of a quantum state through XX spin chains with static imperfections. We combine the two standard approaches for state transfer based on (i) modulated couplings between neighboring spins throughout the spin chain and (ii)…
In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off…
The quadratic unitary Cayley graph $\mathcal{G}_{\mathbb{Z}_n}$ has vertex set $\mathbb{Z}_n: =\{0,1, \ldots ,n-1\}$, where two vertices $u$ and $v$ are adjacent if and only if $u - v$ or $v-u$ is a square of some units in $\mathbb{Z}_n$.…
Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{e\}$. The intersection of two distinct such cycles is the set of edges of $T$ that belong to both cycles. The MSTCI…
State transfer is a well-known routine for various systems of spins-$\frac{1}2$. Still, it is not well studied for chains of spins of larger magnitudes. In this contribution we argue that while perfect state transfer may seem unnatural in…
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…
A mixed graph is said to be integral if all the eigenvalues of its Hermitian adjacency matrix are integer. Let $\Gamma$ be an abelian group. The \textit{mixed Cayley graph} $Cay(\Gamma,S)$ is a mixed graph on the vertex set $\Gamma$ and…
We present an analytical study of state transfer in a spin chain in the presence of an inhomogeneous set of exchange coefficients. We initially consider the homogeneous case and describe a method to obtain the energy spectrum of the system.…
We discuss pretty good state transfer of multiple qubit states and provide a model for considering state transfer of arbitrary states on unmodulated XX-type spin chains. We then provide families of paths and initial states for which we can…
We study the spectrum of the join of several circulant matrices. We apply our results to compute explicitly the spectrum of certain graphs obtained by joining several circulant graphs.
Given a graph $G = (V, E)$, a set $S \subseteq V \cup E$ of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in $S$ happens to be adjacent or incident to a member of $S$. The mixed domination…
Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…
We review the subject of perfect state transfer; how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time.…
For a connected graph $G$, a spanning tree $T$ of $G$ is called a homeomorphically irreducible spanning tree (HIST) if $T$ has no vertices of degree 2. Albertson {\em et al.} proved that it is $NP$-complete to decide whether a graph…
The invertable map of spin state density operator onto quasiprobability distribution of three continuous variables is constructed. The connection with two-mode electromagnetic field oscillators is discussed. The inversion formula for…
In this paper, by providing a class of coherence measures in finite dimensional systems, a sufficient and necessary condition for the existence of coherence transformations that convert one probability distribution of any pure states into…
In 2018, Chen and Godsil proposed the concept of Laplacian perfect pair state transfer which is a brilliant generalization of Laplacian perfect state transfer. In this paper, we study the existence of Laplacian perfect pair state transfer…
The occurrence of parity-time reversal ($\mathcal{PT}$) symmetry breaking is discussed in a non-Hermitian spin chain. The Hermiticity of the model is broken by the presence of an alternating, imaginary, transverse magnetic field. A full…
Graph is a fundamental data structure to model interconnections between entities. Set, on the contrary, stores independent elements. To learn graph representations, current Graph Neural Networks (GNNs) primarily use message passing to…
We study the classification of interacting fermionic and bosonic symmetry protected topological (SPT) states. We define a SPT state as whether or not it is separated from the trivial state through a bulk phase transition, which is a general…