Pretty Good State Transfer and Minimal Polynomials
arXiv:2010.06779
Abstract
We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples of simple, unweighted graphs exhibiting pretty good state transfer. Finally, we consider modifying paths by adding symmetric weighted edges, and apply these results to this case.
arXiv comment11 pages
References in corpus (12)
- Quantum Communication Through an Unmodulated Spin Chain
- Perfect state transfer in quantum spin networks
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Number-Theoretic Nature of Communication in Quantum Spin Systems
- How to construct spin chains with perfect state transfer
- State transfer in static and dynamic spin chains with disorder
- Almost perfect state transfer in quantum spin chains
- Strongly Cospectral Vertices
- All Possible Coupling Schemes in XY Spin Chains for Perfect State Transfer
- Asymptotically perfect efficient quantum state transfer across uniform chains with two impurities
- Information propagation in a quantum system. Examples of open spin-1/2 chains
- Pretty good state transfer in graphs with an involution