Perfect state transfer of quantum walks on cones

(working draft – not for distribution)

Applied graph theory group

July 10, 2010

Abstract
We study perfect state transfer for continuous-time quantum walks on cylindrical cones –
graphs obtained from a path by replacing each internal vertex with some graph and each edge
with a regular bipartite graph. These graphs generalize the layered graphs studied by Christandl
et al. [1] and Feder [2], where each layer is an empty graph, and also the double cones studied
by Cassacino et al. [3] and Angeles-Canul et al. [4, 5]. We describe the following new families
of graphs which possess perfect state transfer:
• For an arbitrary graph G, the double cone K 2 + G has perfect state transfer if the edge
connections are weighted appropriately. This generalizes results on unweighted double
cone on regular graphs studied in [3, 4, 5].
• For a family of n-vertex and k-regular graphs G, there is a regular bipartite connection
between G and H, where G, H ∈ G, so that the graph (K1 +G)∪(K1 +H) has perfect state
transfer. In contrast, there is no perfect state transfer if a complete bipartite connection
is used (even in the presence of weights) [5].
• For a family of n-vertex k-regular graphs G, there is an integer m > 1 so that the graph
K1 + G + K m + H + K1 has perfect state transfer. In contrast, K1 + G + H + K1 as well
as both P4 and P5 are known to have no perfect state transfer as proved in [1].
Keywords: perfect state transfer, quantum walk, quantum spin network.

1 Introduction

2 Preliminaries
For integers n ≥ 1 and 0 ≤ k < n, let Gn,k be the set of all n-vertex k-regular graphs.
For a prime p, let Sp (n) denote the largest integer k for which pk divides n (that is pk |n).
A graph G = (V, E) has perfect state transfer from vertex u to vertex v at time t⋆ if it has unit
⋆
fidelity or |hv|e−it AG |ui| = 1.

3 Irregular double cones

Theorem 1 Let G = (V, E) be any n-vertex connected graph with maximum eigenvalue λ0 . Sup-
pose that
λ /2
p 0 (1)
2n + λ20 /4

1
Figure 1: The Cartesian product construction for perfect state transfer: (a) P2 ⊕ P2 ; (b) P3 ⊕ P3 .
See Christandl et al. [1].

is a rational number p/q ∈ Q, where p, q ∈ Z with (p, q) = 1 and S2 (p) 6= S2 (q). Then, the weighted
double cone graph G = K 2 + G has perfect state transfer.

Proof Let AG be the adjacency matrix of G. Since G is a connected (undirected) graph, AG is

a non-negative symmetric matrix. By the Perron-Frobenius theorem, AG has a simple maximum
eigenvalue λ0 and a corresponding non-negative eigenvector |v0 i. Let the other eigenvalues and
eigenvectors of AG be given by AG |vk i = λk |vk i, for 1 ≤ k < n.
√
We set the weight of an edge adjacent to K 2 to be n|v0 i and 1 otherwise. The adjacency
matrix of G is  √ 
0 0 nhv0 |
√
AG =  0 0 nhv0 | . (2)
√ √
n|v0 i n|v0 i AG
Let λ± = λ̃0 ± ∆, where λ̃0 = λ0 /2 and ∆2 = (λ̃0 )2 + 2n. The eigenvalues of AG̃ are λ± , 0, and λk
(for 1 ≤ k < n) with corresponding eigenvectors:
√     
n/λ± 1 0
1 √ 1
|x± i = n/λ±  , |x0 i = √  −1  , |xk i =  0  , (3)
L± 2 |0 i
|v0 i n |vk i

where L2± = 1 + 2n/λ2± . Note that λ2± L2± = 2∆(∆ ± λ̃0 ).

The quantum walk on G between the two vertices A and B of K 2 is given by
( ) ( )
X n 1 e−itλ̃0 λ̃ 1
0
hB|e−itAG |Ai = 2 2 e−itλ± − = cos(t∆) + i sin(t∆) − . (4)
±
λ± L ± 2 2 ∆ 2

To achieve unit fidelity, it suffices to require cos(t∆)e−itλ̃0 = −1. Equivalently, it is sufficient to

require λ̃0 /∆ = p/q ∈ Q, where p, q ∈ Z with S2 (p) 6= S2 (q).
p
Remark: Given n, we may choose or require λ0 = 8n/3 so that the equivalent sufficient condition
λ0 1
p = (5)
λ20 + 8n 2

is satisfied for perfect state transfer. Moreover, we can find a uniform edge weights for G so that
p
8n/3 is a dominant eigenvalue.

2
Figure 2: Irregular weighted double cones have perfect state transfer: (a) K 2 + P3 ; (b) K 2 + P5 .

4 Regular glued-cones
Theorem 2 Let G ∈ Gn,k and let C be a symmetric Boolean matrix which commutespwith the
adjacency matrix of G. Suppose that C|1n i = γ0 |1n i. Let k± = 21 (k ± γ0 ) and ∆± = k± + n.
Then, the graph G formed by taking two copies of K1 + G and connecting the copies of G using C
has perfect state transfer at time t⋆ provided that
1. ∆+ /∆− = p/q ∈ Q, where p, q ∈ Z and S2 (p) 6= S2 (q).

2. t⋆ γ0 ∈ (2Z)π.

Proof Suppose the eigenvalues and eigenvectors of G are λk and |vk i, respectively, where k = λ0 >
λ1 ≥ . . . ≥ λn−1 . The adjacency matrix of G is given by
 
0 0 h1n | h0n |
 0 0 h0n | h1n |
AG = |1n i |0n i AG
. (6)
C 
|0n i |1n i C AG

Let k± = 21 (k ± γ0 ) and ∆2± = k± 2 + n. Let α = k ± ∆ and β = k ± ∆ . The eigenvalues of

± + + ± − −
AG are given by α± , β± , and ±λk , for k 6= 0, with corresponding eigenvectors:
     
1 1 0
1 
1 1  , |β± i = 1  1 −1
 
 , |λk i = √1  0  ,
  
|α± i = (7)
 α
L± n ± n |1 i M± n ± n
 β |1 i  2  ±|v k i
1
n α± |1n i − n1 β± |1n i ±|vk i

where L2± = n2 (n + α2± ) and M±2 = n2 (n + β±

2 ) are the normalization constants.

Note that
4
L2± = ∆+ (∆+ ± k+ ) (8)
n
α2± 2
= k+ + ∆2+ ± 2k+ ∆+ (9)
α2+ + α2− = 2
2(k+ + ∆2+ ) (10)
16 2
(L+ L− )2 = ∆ . (11)
n +
Similarly, the same equations hold for M± and β± .

3
 The quantum walk between the antipodal vertices of the cones, say A and B, is given by
X e−itα± X e−itβ±
hB|e−itAG |Ai = − (12)
±
L2± ±
M±2

Let Ξ(t) = ± e−itα± /L2± and Υ(t) = ± e−itβ± /M±2 .

P P
Suppose that there is perfect state transfer at time t⋆ . Then,
⋆A
hB|e−it G
|Ai = Ξ(t⋆ ) − Υ(t⋆ ) = 1 (13)
−it⋆ A
hA|e G
|Ai = Ξ(t⋆ ) + Υ(t⋆ ) = 0, (14)

which implies Ξ(t⋆ ) = 1/2 and Υ(t⋆ ) = −1/2. Moreover, we have

e−itk+
 
k+
Ξ(t) = cos(t∆+ ) + i sin(t∆+ ) (15)
2 ∆+
e−itk−
 
k−
Υ(t) = cos(t∆− ) + i sin(t∆− ) . (16)
2 ∆−

To achieve perfect state transfer, it suffices to require

cos(t⋆ ∆+ ) cos(t⋆ ∆− ) = −1 (17)

it⋆ γ0
e = +1. (18)

We now restate these conditions as: (a) ∆+ /∆− = p/q ∈ Q, where p, q ∈ Z and S2 (p) 6= S2 (q);
and (b) t⋆ γ0 ∈ (2Z)π. This proves the claim.

Remark: For a ≥ 2, let n = 15 × 22(a−2) , k = 3 × 2a−1 , and λ0 = 4 × 2a−1 . Consider a circulant CHECK
graph G on n vertices, where (u, v) ∈ E whenever |v − u| ≤ 3 × 2a−2 (mod n). Let C be any
n-vertex k-regular graph. Then, the graph G obtained from connecting two copies of the cone
K1 + G using C has perfect state transfer.

The following lemma provides another construction of a family of unweighted graph with di-
ameter three which has perfect state transfer. This construction uses the weak product of graphs.
An interesting property of this operator is that it creates graphs with perfect state transfer from
ones which lack the property. This is in contrast to the Cartesian product graph operator which
preserves perfect state transfer of its graph arguments (assuming they have the same perfect state
transfer times).

Lemma 3 The weak product K2 × Km has perfect state transfer, whenever m is divisible by 4.

Proof For an n-vertex graph G and a m-vertex graph H whose eigenvalues and eigenvectors are
given by
AG |uk i = λk |uk i, AH |vℓ i = µℓ |vℓ i, (19)
where k ∈ [n] and ℓ ∈ [m], the eigenvalues and eigenvectors of their weak product G × H are

AG×H (|uk i ⊗ |vℓ i) = λk µℓ (|uk i ⊗ |vℓ i). (20)

4
 Figure 3: The weak product graph K2 × Km has perfect state transfer if m is divisible by 4.

The quantum walk on G × H from (g1 , h1 ) to (g2 , h2 ) is given by

X
hg2 , h2 |e−itAG×H |g1 , h1 i = hg2 |uk ihuk |g1 ihh2 |vℓ ihvℓ |h1 ie−itλk µℓ . (21)
k,ℓ

If we let H = Km and take h1 = h2 = 0, we get

1 X n o
hg2 , 0|e−itAG×Km |g1 , 0i = hg2 |uk ihuk |g1 i e−it(m−1)λk + (m − 1)eitλk . (22)
m
k

Now, let G = K2 and let g1 = 0 and g2 = 1. It suffices to have e−itmλk = 1, for all k; or, equivalently,
tmλk = (2Z)π. Since K2 has perfect state transfer at t = π/2 and its eigenvalues are ±1, if we let
m be divisible by 4, then K2 × Km has perfect state transfer.

5 Cylindrical cones
In this section, we consider graphs of the form K1 + G1 + H + G2 + K1 , where G1 , G2 ∈ Gn,k and
H ∈ Gm,ℓ . Our goal is to characterize conditions on the regularities of these graph families for
which end-to-end perfect state transfer exists.

Theorem 4 For integers n ≥ 1, 0 ≤ k < n, and m ≥ 2, let G1 , G2 ∈ Gn,k and suppose that
p p
∆ = k2 /4 + n, Γ = k2 /4 + (2m + 1)n. (23)

Then, the graph K1 + G1 + K m + G2 + K1 has perfect state transfer if

(∆ + Γ) p
= , (24)
(∆ − Γ) q

for odd integers p and q.

Proof We prove the claim for graphs of the form K1 + G1 + H + G2 + K1 where m > 1 and ℓ = 0;
so, H = K m is the empty graph on m vertices.
Let AG be the adjacency matrix of G with eigenvalues λr and eigenvectors |vr i, where k = λ0 >
λ1 ≥ . . . ≥ λn−1 . Let AH be the adjacency matrix of H with eigenvalues ρs and eigenvectors |ws i,

5
where ℓ = ρ0 > ρ1 ≥ . . . ≥ ρn−1 . Thus, the adjacency matrix of G is given by
 
0 0 h1n | h0n | h0n |
 0 0 h0n | h0n | h1n | 
 
AG =  |1
 n i |0n i AG Jn,m On,n . (25)
|0m i |0m i Jm,n AH Jm,n 
|0n i |1n i On,n Jn,m AG
In our case, we have AH = 0m,m is the zero m × m matrix and ℓ = 0.
Let λ± be the roots of quadratic λ2 − kλ − n = 0; thus λ± = k̃ ± ∆, where k̃ = k/2 and
∆2 = k̃2 + n.
Let µ be the roots of the cubic (µ − ℓ)(µ2 − kµ − (2m + 1)n) − 2ℓmn = 0. For ℓ = 0, note
0 is a root of the cubic along with the two roots of the quadratic µ2 − kµ − (2m + 1)n = 0. Let
µ± = k̃ ± Γ, where Γ2 = k̃2 + (2m + 1)n.
Thus, the eigenvalues of AG are given by λ± , µ± , 0, and λr , for r 6= 0, with corresponding
eigenvectors:
       
1 1 1 0
 −1   1   1   0 
1  1
 1  1
 1    
|λ± i = 
n λ ± |1n i  , |µ ± i = 
n µ ± |1n i , |v0 i =  0  , |λ r,s i =  |vr i  , (26)
L±   M±   N   
 0   2  −1/m |ws i
− n1 λ± |1n i 1
n µ± |1n i 0 |vr i
where 1 ≤ r < n and 1 ≤ s < m.
The quantum walk on G between the two antipodal vertices A and B is given by:
X e−itλ± X e−itµ± 1
hB|e−itAG |Ai = − + + . (27)
±
L2± ±
M±2 N2

e−itλ± e−itµ± 1
If perfect state transfer exists at time t⋆ , we
P P
Let Ξ(t) = ± L2±
and Υ(t) = ± M± 2 + N2 .
have
⋆A
hB|e−it G
|Ai = Υ(t⋆ ) − Ξ(t⋆ ) = 0 (28)
−it⋆ A ⋆ ⋆
hA|e G
|Ai = Υ(t ) + Ξ(t ) = 1. (29)
Thus, Ξ(t⋆ ) = Υ(t⋆ ) = 1/2. This implies that
exp(−it⋆ (∆ + Γ)) = exp(−it⋆ (∆ − Γ)) = exp(it⋆ (∆ + Γ)) = exp(it⋆ (∆ − Γ)) = −1. (30)
Using this, we get
t⋆ (∆ + Γ) ∈ (2Z + 1)π (31)
⋆
t (∆ − Γ) ∈ (2Z + 1)π. (32)
Equivalently, we have (∆ + Γ)/(∆ − Γ) = p/q, for odd integers p and q. This proves the claim.

Remark: We may choose n = 3, k = 2, m = 2 and ℓ = 0 to obtain a graph G with perfect state

transfer (see Figure 4(b)). CHECK

In contrast to Theorem 4, we prove the following negative result.

6
Figure 4: Cylindrical cones of diameter five: (a) K1 + K3 + K1 + K3 + K1 has no perfect state
transfer; (b) K1 + K3 + K 2 + K3 + K1 has perfect state transfer.

Claim 5 For any integers n ≥ 1 and 0 ≤ k < n and any graph G ∈ Gn,k , the graph K1 + G + K1 +
G + K1 has no perfect state transfer.

6 Symmetry and perfect state transfer

Claim 6 Let G = (V, E) be any n-vertex k-regular graph. Consider the double cone G = K1 +α
G +β K1 . If there is perfect state transfer between the vertices of the two K1 ’s, then α = β.

Proof The quantum walk from A to B on G is given by: MISSING

DETAILS
X n2 αβ −itλ± αβ
hB|e−itG |Ai = 2
e − 2 (33)
±
(λ± L± ) α + β2
( " # )
αβ k̃
= e−itk̃ cos(t∆) + i sin(t∆) − 1 . (34)
α2 + β 2 ∆

It is easy to see that α = β is a necessary condition to achieve perfect state transfer.

In what follows, we describe an infinite family of symmetrically weighted P4 which has perfect
state transfer.

Claim 7 Let P4 (α) denote a weighted graph with adjacency matrix

 
0 1 0 0
1 0 α 0
A= 0 α 0 1 .
 (35)
0 0 1 0

For any integers k and ℓ, where 2ℓ > 2k + 1, and

s
4(2k + 1)2
α= , (36)
4ℓ − (2k + 1)2
2

the weighted graph P4 (α) has perfect state transfer.

7
 √
Proof Let α̃ = α/2 and ∆ = α̃2 + 1. The eigenvalues of A are

λa,b = (−1)a α̃ + (−1)b ∆, a, b ∈ {0, 1}, (37)

with the following corresponding eigenvectors

(−1)a
 
1  a
(−1) λa,b 

|λa,b i = (38)
La,b  λa,b 
1

where L2a,b = 4(−1)b ∆λa,b . UNFINISHED

7 Open questions
We conclude with the following open problems:

1. Let f (d) be the order of the smallest graph with diameter d which has perfect state transfer.
By results proved by Christandl et al. [1], we know that:

d ≤ f (d) ≤ αd , (39)
√
where α = 3 if d is even and α = 2 if d is odd. Are there better bounds for f (d)?

2. Prove or disprove: if G = (V, E) has perfect state transfer from u to v then there is an
automorphism τ of G̃ so τ (u) = v. Here, G̃ is a weighted projected version of G.

References
[1] M. Christandl, N. Datta, T. Dorlas, A. Ekert, A. Kay, and A. Landahl. Perfect transfer of
arbitrary states in quantum spin networks. Phys. Rev. A, 71:032312, 2005.

[2] D. Feder. Perfect quantum state transfer with spinor bosons on weighted graphs.
Phys. Rev. Lett., 97:180502, 2006.

[3] A. Casaccino, S. Lloyd, S. Mancini, and S. Severini. Quantum state transfer through a qubit
network with energy shifts and fluctuations. Int. J. Quant. Inf., 7(8):1417–1427, 2009.

[4] R.J. Angeles-Canul, R. Norton, M. Opperman, C. Paribello, M. Russell, and C. Tamon. Perfect
state transfer, integral circulants and join of graphs. Quant. Inf. Comp., 10(3&4):325–342,
2010.

[5] R.J. Angeles-Canul, R. Norton, M. Opperman, C. Paribello, M. Russell, and C. Tamon. On

quantum perfect state transfer on weighted join graphs. Int. J. Quant. Inf., 7(8):1429–1445,
2009.