Mixed graphs, which generalize both undirected and directed graphs, provide a natural framework for investigating a broader class of quantum transport phenomena, including perfect state transfer ($\mathrm{PST}$) and multiple state transfer ($\mathrm{MST}$). The Hermitian adjacency matrix, incorporating both symmetric and asymmetric edge structures, establishes a unified spectral framework that reveals quantum phenomena absent in undirected graphs. In this paper, we study $\mathrm{PST}$ and $\mathrm{MST}$ on mixed graphs using the Hermitian adjacency matrix, extending results from undirected graphs and focusing on phenomena such as periodicity, one-way $\mathrm{PST}$, two-way $\mathrm{PST}$, and $\mathrm{MST}$. Additionally, we present novel results that contribute to a deeper understanding of quantum state transfer in mixed graphs.
Let $U_X(t)$ be the transition matrix of a quantum walk on a graph $X$ relative to its adjacency matrix $A$ or the Laplacian matrix $L$. This paper investigates the behavior of quantum walks under Cartesian products, joins, and graph complements. We have two main goals. First, we characterize the conditions such that p...
Joy Cooper, Homer De Vera, Hermie Monterde et al.· 0 citations
We study a generalization of undirected $st$-connectivity to graphs whose edges carry quantum operations. Let $G=(V,E)$ be an undirected graph on $n$ vertices in which each edge $\{u,v\}$ is labeled by a unitary $U_{uv}\in\mathbb{C}^{k\times k}$, with $U_{vu}=U_{uv}^\dagger$. We assume the labels form a \emph{flat} con...
Stacey Jeffery, T. Osborne, Galina Pass· 1 citation
Much work has been done in the last two decades on the topic of quantum state transfer in a quantum spin network. One can model such a system of interacting qubits using an undirected graph, and studying vertex-to-vertex dynamics. This setup has recently been relaxed to allow for dynamics between linear combinations of...
Stephen J. Kirkland, Hermie Monterde, Sarah Plosker· 0 citations
Consider $N$ identical quantum systems at the vertices of a graph, interacting via pairwise edge couplings. We designate $K$ vertices as a system of interest $\mathrm S$ and the remaining $N-K$ as a reservoir $\mathrm R$. Under generic connectivity assumptions between $\mathrm S$ and $\mathrm R$, we show that for $N\to...
Graph theory is a powerful tool in quantum computing, with applications ranging from quantum circuit synthesis and optimization to entanglement mapping. Recent work has shown how one can use edge-colored graphs to model photonic experiments that generate GHZ and W states. However, the latter work also proved that verif...
The complementary prism $G\overline{G}$ of a graph $G$ is obtained from the disjoint union of $G$ and its complement $\overline{G}$ by adding an edge between each vertex $a$ in $G$ and its copy $a'$ in $\overline{G}.$ This paper explores a general framework for studying fractional revival with respect to real symmetric...
Sarojini Mohapatra, Hiranmoy Pal· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.