Strong quantum state transfer on graphs via loop edges

2024/04/01 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 Information and Cryptography #Quantum Physics (quant-ph) #Quantum and electron transport phenomena

paper · pdf · doi:10.48550/arxiv.2404.01173

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

Abstract

We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for any graph where this protocol is feasible. By considering local spectral symmetry, we show that the required weight size depends only on the maximum degree of the graph and, in some less favorable cases, the distance between vertices. Additionally, we explore the duration for which transfer strength remains above a specified threshold.

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

• Quantifying State Transfer Strength on Graphs with Involution
• State transfer in strongly regular graphs with an edge perturbation
• Pretty good state transfer among large sets of vertices
• Pretty Good State Transfer and Minimal Polynomials
• State Transfer on Paths with Weighted Loops