Approximate quantum fractional revival in paths and cycles
arXiv:2005.00492
Abstract
We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give a complete characterizations of when approximate fractional revival can occur in paths and in cycles.
arXiv comment15 Pages
References in corpus (10)
- Quantum Communication Through an Unmodulated Spin Chain
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Number-Theoretic Nature of Communication in Quantum Spin Systems
- Perfect Quantum Routing in Regular Spin Networks
- Almost perfect state transfer in quantum spin chains
- Quantum spin chains with fractional revival
- Analytic next-to-nearest neighbour XX models with perfect state transfer and fractional revival
- Strongly Cospectral Vertices
- A graph with fractional revival
- Fractional revivals of quantum state in tight-binding chain