The signless Laplacian state transfer in Q-graph

Xiaoqin Zhang, Shu‐Yu Cui, Gui‐Xian TianarXiv 2021 · DOI · arXiv

Abstract

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 adding a new edge between two new vertices which lie on adjacent edges of $G$. In this paper, we consider to study the existence of the signless Laplacian perfect state transfer and signless Laplacian pretty good state transfer in $\mathcal{Q}$-graphs of graphs. We show that, if all the signless Laplacian eigenvalues of a regular graph $G$ are integers, then the $\mathcal{Q}$-graph of $G$ has no signless Laplacian perfect state transfer. We also give a sufficient condition that the $\mathcal{Q}$-graph of a regular graph has signless Laplacian pretty good state transfer when $G$ has signless Laplacian perfect state transfer between two specific vertices.

Introduction

In the field of quantum information processing, the efficient transfer of quantum states across a network is a fundamental requirement. These networks are often modeled as graphs, where vertices represent quantum states and edges represent the interactions between them. A "quantum walk" describes the evolution of a state over time, governed by the graph's Hamiltonian.

Two primary phenomena are of interest: Perfect State Transfer (PST), where a state moves from vertex $u$ to vertex $v$ with 100% fidelity at a specific time $t$, and Pretty Good State Transfer (PGST), where the fidelity can be made arbitrarily close to 1. While PST is the ideal, it is mathematically rare and highly sensitive to the graph's structure. This paper investigates these properties within the context of the signless Laplacian matrix ($Q = A + D$) and a specific graph transformation known as the $\mathcal{Q}$-graph.

The $\mathcal{Q}$-Graph Transformation

The $\mathcal{Q}$-graph, $\mathcal{Q}(G)$, is a structural transformation of an original graph $G$. It is constructed by:

  1. Inserting a new vertex into every edge of $G$.
  2. Adding a new edge between any two of these new vertices if the original edges they were placed on shared a common vertex in $G$.

This transformation significantly alters the spectral properties of the network. The authors focus on how the signless Laplacian spectrum of the original regular graph $G$ relates to the spectrum of its $\mathcal{Q}$-graph, and how this relationship dictates the possibility of quantum state transfer.

The "Integer Curse" and PST Impossibility

A significant portion of the research focuses on the limitations imposed by the $\mathcal{Q}$-graph transformation. The authors establish a "PST Impossibility" theorem (Theorem 4.2).

They prove that if $G$ is a regular graph and all its signless Laplacian eigenvalues are integers, then $\mathcal{Q}(G)$ cannot support signless Laplacian PST. The mathematical reasoning lies in the spectral decomposition: the transformation introduces square root terms into the eigenvalues of $\mathcal{Q}(G)$. These irrational values prevent the perfect synchronization of phases required for the transition matrix $H(t) = \exp(-itQ)$ to achieve PST.

This finding has broad implications, as many common network topologies, such as the $d$-dimensional hypercube ($Q_d$), consist entirely of integer eigenvalues and are thus excluded from supporting PST under this transformation.

Bridging to Pretty Good State Transfer

While PST may be impossible for many $\mathcal{Q}$-graphs, the authors provide a mathematical bridge to PGST. Using Kronecker’s Theorem regarding the linear independence of square roots over rational numbers, they identify conditions under which the phases of the quantum walk can align "well enough" to achieve near-perfect transfer.

Theorem 5.1 provides a sufficient condition: if the original regular graph $G$ already admits PST between two vertices, and the degree of the graph $r$ satisfies specific divisibility conditions related to the greatest common divisor of its eigenvalue differences, then $\mathcal{Q}(G)$ is guaranteed to admit PGST.

Key Examples:

  • Hypercubes ($Q_d$): While the $\mathcal{Q}$-graph of a hypercube never has PST, it admits PGST if the dimension $d$ is even.
  • Cocktail Party Graphs: These graphs are shown to admit PGST between antipodal vertices in their $\mathcal{Q}$-graph form.

Conclusion

This research highlights the extreme sensitivity of quantum state transfer to graph topology. The $\mathcal{Q}$-graph transformation serves as a case study in how systematic structural changes can destroy perfect synchronization while still allowing for high-fidelity "pretty good" transfer. Future work remains in determining whether these conditions are necessary as well as sufficient, and extending these proofs to non-regular graph structures where the spectral analysis is significantly more complex.

Summary updated

Abstract

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 adding a new edge between two new vertices which lie on adjacent edges of $G$. In this paper, we consider to study the existence of the signless Laplacian perfect state transfer and signless Laplacian pretty good state transfer in $\mathcal{Q}$-graphs of graphs. We show that, if all the signless Laplacian eigenvalues of a regular graph $G$ are integers, then the $\mathcal{Q}$-graph of $G$ has no signless Laplacian perfect state transfer. We also give a sufficient condition that the $\mathcal{Q}$-graph of a regular graph has signless Laplacian pretty good state transfer when $G$ has signless Laplacian perfect state transfer between two specific vertices.
BibTeX
@misc{zhang2021signless,
  author = {Xiaoqin Zhang and Shu‐Yu Cui and Gui‐Xian Tian},
  title = {{The signless Laplacian state transfer in Q-graph}},
  year = {2021},
  eprint = {2108.01325},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2108.01325},
}
Figure