Quantum state transfer on ๐ฌ-graphs
Given a graph G, the graph ๐ฌ(G) is obtained by inserting a new vertex into every edge of G, then connecting those inserted vertices on the neighbouring edges in G. We usually refer to ๐ฌ(G) as the ๐ฌ-graph of G. This article mainly focuses on the effects of ๐ฌ-graph operation on quantum state transfer. It is shown that if G is an integral r-regular graph for r โฅ 2, then ๐ฌ(G) always avoids perfect state transfer. In contrast, we also show that, this ๐ฌ-graph exists pretty good state transfer under some special circumstances. Subsequently, by applying the results obtained above, we also display many new classes of ๐ฌ-graphs that avoid perfect state transfer but exist pretty good state transfer.
Publication Details
- Journal
- Springer Link (Chiba Institute of Technology)
- Published
- 2025-05-14
- DOI
- https://doi.org/10.1051/ro/2025046/pdf
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00