Quick Navigation
Topics
Open Quantum Systems Decoherence
Quantum State Preparation Representation
Quantum Simulation
Entanglement Theory Quantum Correlations
When can perfect state transfer occur?
arXiv
Authors: Chris Godsil
Year
2010
Paper ID
10620
Status
Preprint
Abstract Read
~2 min
Abstract Words
148
Citations
N/A
Abstract
Let X be a graph on n vertices with with adjacency matrix A and let H(t) denote the matrix-valued function exp(iAt). If u and v are distinct vertices in X, we say perfect state transfer from u to v occurs if there is a time τ such that |H(τ)u,v| = 1. Our chief problem is to characterize the cases where perfect state transfer occurs. We show that if perfect state transfer does occur in a graph, then the spectral radius is an integer or a quadratic irrational; using this we prove that there are only finitely many graphs with perfect state transfer and with maximum valency at most 4K4. We also show that if perfect state transfer from u to v occurs, then the graphs Xsetminus u and Xsetminus v are cospectral and any automorphism of X that fixes u must fix v (and conversely).
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2010 reference point for readers tracking recent quantum research.
- Let X be a graph on n vertices with with adjacency matrix A and let H(t) denote the matrix-valued function exp(iAt).
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.