Pretty Good State Transfer and Minimal Polynomials
Preprint
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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- State transfer in strongly regular graphs with an edge perturbationJournal of Combinatorial Theory, Series A, 2020
- Pretty good quantum state transfer in asymmetric graphs via potentialDiscrete Mathematics, 2019
- Pretty good state transfer in qubit chains—The Heisenberg HamiltonianJournal of Mathematical Physics, 2017
- Information propagation in a quantum system: examples of open spin-1/2 chainsJournal of Physics A: Mathematical and Theoretical, 2012
- How to construct spin chains with perfect state transferPhysical Review A, 2012
- State transfer on graphsDiscrete Mathematics, 2012
- All possible coupling schemes inspin chains for perfect state transferPhysical Review A, 2011
- State transfer in static and dynamic spin chains with disorderPhysical Review A, 2010
- Perfect transfer of arbitrary states in quantum spin networksPhysical Review A, 2005
- Perfect state transfer, effective gates, and entanglement generation in engineered bosonic and fermionic networksPhysical Review A, 2005