Tree-Line graphs and their quantum walks

2025/04/17 by Kang Musung, Musung, Kang
Computer Science · #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.2504.13000

openalex publication_date 2025/04/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For a simple graph Γ, a (bipartite)tree-line graph and a tree-graph of Γ can be defined. With a (bipartite)tree-line graph constructed by the function (b)ℓ, we study the continuous quantum walk on (b)ℓ ⁿ Γ. An equitable partition of a bipartite tree-line graph is obtained by its corresponding derived tree graph. This paper also examines quantum walks on derived graphs, whose vertices represent their basis state.

Related

• Reduction of branching graphs supporting continuous time return quantum walks
• Investigation of Continuous-Time Quantum Walk Via Spectral Distribution Associated with Adjacency Matrix
• Hamiltonians of Bipartite Walks
• Indistinguishable quantum walks on graphs relative to a bipartite\n quantum walker
• The spectral geometry of biregular graphs: a quantum graph approach