Perfect state transfer in cubelike graphs

Abstract

Suppose $C$ is a subset of non-zero vectors from the vector space ${\mathbb{Z}}_2^d$. The cubelike graph $X(C)$ has ${\mathbb{Z}}_2^d$ as its vertex set, and two elements of ${\mathbb{Z}}_2^d$ are adjacent if their difference is in $C$. If $M$ is the $d\times |C|$ matrix with the elements of $C$ as its columns, we call the row space of $M$ the code of $X$. We use this code to study perfect state transfer on cubelike graphs. Bernasconi et al have shown that perfect state transfer occurs on $X(C)$ at time $\pi /2$ if and only if the sum of the elements of $C$ is not zero. Here we consider what happens when this sum is zero. We prove that if perfect state transfer occurs on a cubelike graph, then it must take place at time $\tau =\pi /2D$, where $D$ is the greatest common divisor of the weights of the code words. We show that perfect state transfer occurs at time $\pi /4$ if and only if D=2 and the code is self-orthogonal.

10 pages, minor revisions

References in corpus (4)

• Quantum random walks - an introductory overview
• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• Quantum Networks on Cubelike Graphs
• Quantum switching networks for perfect qubit routing

Cited by in corpus (22)

• Perfect state transfer on distance-regular graphs and association schemes
• Eigenvalues of Cayley graphs
• No Laplacian Perfect State Transfer in Trees
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Perfect state transfer in products and covers of graphs
• Complex Hadamard Matrices, Instantaneous Uniform Mixing and Cubes
• Quantum state transfer between twins in weighted graphs
• On state transfer in Cayley graphs for abelian groups
• Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
• Discretization of continuous-time quantum walks via the staggered model with Hamiltonians
• State Transfer on Graphs
• Perfect State Transfer in Weighted Cubelike Graphs
• Implementation of hitting times of discrete time quantum random walks on Cubelike graphs
• Perfect state transfer using Markovian quantum walk
• Continuous-time Quantum Walks on Cayley Graphs of Extraspecial Groups
• Complex Hadamard Diagonalisable Graphs
• Perfect quantum state transfer in weighted paths with potentials (loops) using orthogonal polynomials
• Uniform mixing on integral abelian Cayley graph
• Perfect edge state transfer on cubelike graphs
• Perfect state transfer in NEPS of complete graphs
• A Note on Eigenvalues of Cayley Graphs
• Quantum simulation of perfect state transfer on weighted cubelike graphs