Quantifying State Transfer Strength on Graphs with Involution

2023/10/12 by Gábor Lippner, Yujia Shi, Lippner, Gabor +1 · 3 citations
Computer Science · Physics and Astronomy · #05C50 #81P45 #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum and electron transport phenomena #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.2310.08690

openalex publication_date 2023/10/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper discusses continuous-time quantum walks and asymptotic state transfer in graphs with an involution. By providing quantitative bounds on the eigenvectors of the Hamiltonian, it provides an approach to achieving high-fidelity state transfer by strategically selecting energy potentials based on the maximum degrees of the graphs. The study also involves an analysis of the time necessary for quantum transfer to occur.

Cited by

• The strength of weak coupling
• Continuous-Time Quantum State Transfer with a Generalized Laplacian
• Optimising Perfect Quantum State Transfer for Timing Insensitivity

Related

• Pretty good state transfer in graphs with an involution
• Pretty good state transfer among large sets of vertices
• Continuous-Time Quantum State Transfer with a Generalized Laplacian
• Strong quantum state transfer on graphs via loop edges
• Peak state transfer in continuous quantum walks