Search arXivSearch

arXiv · 2108.07590

Quantum state transfer on Q-graphs

Abstract

We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and joining two new vertices which lie on adjacent edges of $G$ by an edge. We show that, if all eigenvalues of a regular graph $G$ are integers, then its $\mathcal{Q}$-graph $\mathcal{Q}(G)$ has no perfect state transfer. In contrast, we also prove that the $\mathcal{Q}$-graph of a regular graph has pretty good state transfer under some mild conditions. Finally, applying the obtained results, we also exhibit many new families of $\mathcal{Q}$-graphs having no perfect state transfer, but admitting pretty good state transfer.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiao-Qin Zhang, Shu-Yu Cui, Gui-Xian Tian. 2021-08-17. Quantum state transfer on Q-graphs. https://arxiv.org/abs/2108.07590

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO