Abstract
This paper studies quantum perfect state transfer on weighted graphs. We prove that the join of a weighted two-vertex graph with any regular graph has perfect state transfer. This generalizes a result of Casaccino et al. 1 where the regular graph is a complete graph with or without a missing edge. In contrast, we prove that the half-join of a weighted two-vertex graph with any weighted regular graph has no perfect state transfer. As a corollary, unlike for complete graphs, adding weights in complete bipartite graphs does not produce perfect state transfer. We also observe that any Hamming graph has perfect state transfer between each pair of its vertices. The result is a corollary of a closure property on weighted Cartesian products of perfect state transfer graphs. Moreover, on a hypercube, we show that perfect state transfer occurs between uniform superpositions on pairs of arbitrary subcubes, thus generalizing results of Bernasconi et al.2 and Moore and Russell.3
Original language | English (US) |
---|---|
Pages (from-to) | 1429-1445 |
Number of pages | 17 |
Journal | International Journal of Quantum Information |
Volume | 7 |
Issue number | 8 |
DOIs | |
State | Published - Dec 2009 |
Funding
This research was supported by the National Science Foundation grant DMS-0646847 and the National Security Agency grant H98230-09-1-0098.
Keywords
- Join
- Perfect state transfer
- Quantum networks
- Weighted graphs
ASJC Scopus subject areas
- Physics and Astronomy (miscellaneous)