Laplacian pair state transfer in Q-graph

In 2018, Chen and Godsil proposed the concept of Laplacian perfect pair state transfer which is a brilliant generalization of Laplacian perfect state transfer. Studying Laplacian pair state transfer will provide a theoretical foundation for constructing quantum communication networks capable of quantum state transfer. In this paper, we study the existence of Laplacian perfect pair state transfer in the Q-graph of an r -regular graph for r ≥ 2 . By combining the spectral decomposition of the graph with the Laplacian eigenvalue support of pair state, we prove that the Q-graph of an r -regular graph does not have Laplacian perfect pair state transfer when r + 1 is prime or a power of 2. By contrast, we also give sufficient conditions for Q-graph to have Laplacian pretty good pair state transfer. The approach used in this paper can effectively verify the existence of Laplacian perfect (or pretty good) pair state transfer in other families of graphs.

Authors

Institutions

Publication Details

Journal
Discrete Applied Mathematics
Published
2025-06-17
DOI
https://doi.org/10.1016/j.dam.2025.05.046
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Laplacian pair state transfer in Q-graph

Xiaogang Liu, Jing Wang, Ming Jiang
1 citations
Discrete Applied Mathematics
Quantum Computing Algorithms and Architecture
2.48
article

Laplacian pair state transfer in Q-graph

Xiaogang Liu, Jing Wang, Ming Jiang
article en
1 citations

Abstract

In 2018, Chen and Godsil proposed the concept of Laplacian perfect pair state transfer which is a brilliant generalization of Laplacian perfect state transfer. Studying Laplacian pair state transfer will provide a theoretical foundation for constructing quantum communication networks capable of quantum state transfer. In this paper, we study the existence of Laplacian perfect pair state transfer in the Q-graph of an r -regular graph for r ≥ 2 . By combining the spectral decomposition of the graph with the Laplacian eigenvalue support of pair state, we prove that the Q-graph of an r -regular graph does not have Laplacian perfect pair state transfer when r + 1 is prime or a power of 2. By contrast, we also give sufficient conditions for Q-graph to have Laplacian pretty good pair state transfer. The approach used in this paper can effectively verify the existence of Laplacian perfect (or pretty good) pair state transfer in other families of graphs.

Discrete Applied MathematicsVol. 375
Northwestern Polytechnical University (CN)
National Natural Science Foundation of China, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 10%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.