12
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A class of gcd-graphs having Perfect State Transfer

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Let \(G\) be a graph with adjacency matrix \(A\). The transition matrix corresponding to \(G\) is defined by \(H(t):=\exp{\left(itA\right)}\), \(t\in\Rl\). The graph \(G\) is said to have perfect state transfer (PST) from a vertex \(u\) to another vertex \(v\), if there exist \(\tau\in\Rl\) such that the \(uv\)-th entry of \(H(\tau)\) has unit modulus. The graph \(G\) is said to be periodic at \(\tau\in\Rl\) if there exist \(\gamma\in\Cl\) with \(|\gamma|=1\) such that \(H(\tau)=\gamma I\), where \(I\) is the identity matrix. A \(\mathit{gcd}\)-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. In this paper, we construct classes of \(\mathit{gcd}\)-graphs having periodicity and perfect state transfer.

          Related collections

          Most cited references5

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          Quantum Networks on Cubelike Graphs

          Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of cubelike graphs. This generalizes results of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and Facer et al. [Phys. Rev. A 92, 187902 (2008)].
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Integral circulant graphs

            Wasin So (2006)
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Perfect state transfer in cubelike graphs

              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.
                Bookmark

                Author and article information

                Journal
                1601.07398

                Combinatorics
                Combinatorics

                Comments

                Comment on this article