2023/05/23 by Ada Chan, Chan, Ada, Peter Sin +1
Computer Science · #05C50 #15A16 #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Neural Networks and Reservoir Computing #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2305.14276
openalex publication_date 2023/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is no bound on the size of a set of vertices that admit pretty good state transfer between any two vertices of the set.