Perfect state transfer in products and covers of graphs

@article{Coutinho2015PerfectST,
  title={Perfect state transfer in products and covers of graphs},
  author={Gabriel Coutinho and Chris D. Godsil},
  journal={Linear and Multilinear Algebra},
  year={2015},
  volume={64},
  pages={235 - 246}
}
A continuous-time quantum walk on a graph is represented by the complex matrix , where is the adjacency matrix of and is a non-negative time. If the graph models a network of interacting qubits, transfer of state among such qubits throughout time can be formalized as the action of the continuous-time quantum walk operator in the characteristic vectors of the vertices. Here, we are concerned with the problem of determining which graphs admit a perfect transfer of state. More specifically, we… Expand
Discrete Quantum Walks on Graphs and Digraphs
This thesis studies various models of discrete quantum walks on graphs and digraphs via a spectral approach. A discrete quantum walk on a digraph X is determined by a unitary matrix U , which acts onExpand
Perfect quantum state transfer using Hadamard diagonalizable graphs
Abstract Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on theExpand
Quantum state transfer on Q-graphs
  • Xiao-Qin Zhang, Shu-Yu Cui, Gui-Xian Tian
  • Mathematics
  • 2021
We study the existence of quantum state transfer in Q-graphs in this paper. The Qgraph of a graph G, denoted by Q(G), is the graph derived from G by plugging a new vertex to each edge of G andExpand
Perfect state transfer on Cayley graphs over dihedral groups
Recently, there are extensive studies on perfect state transfer on graphs due to their significant applications in quantum information processing and quantum computations. However, most of the graphsExpand
Quantum state transfer on a class of circulant graphs
ABSTRACT We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous-time quantum walks on quantum networks based on certain circulant graphs withExpand
An infinite family of circulant graphs with perfect state transfer in discrete quantum walks
  • H. Zhan
  • Mathematics, Computer Science
  • Quantum Inf. Process.
  • 2019
TLDR
An infinite family of $4$-regular circulant graphs that admit perfect state transfer is constructed, the only known infinite families of examples were variants of cycles and diamond chains. Expand
Combinatorial and algebraic aspects of quantum state transfer
Reliably transferring a quantum state from one location to another, as well as generating entangled states, are important tasks to achieve in quantum spin systems. The fidelity or probability ofExpand
Continuous-time quantum walks on dynamic graphs
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to theExpand
The signless Laplacian state transfer in Q-graph
  • Xiao-Qin Zhang, Shu-Yu Cui, Gui-Xian Tian
  • Mathematics
  • 2021
The Q-graph of a graph G, denoted by Q(G), is the graph derived from G by plugging a new vertex to each edge of G and adding a new edge between two new vertices which lie on adjacent edges of G. InExpand
Perfect state transfer in unitary Cayley graphs and gcd-graphs
Abstract In this work, we consider the problem on the existence of perfect state transfer in unitary Cayley graphs and gcd-graphs over finite commutative rings. We characterize all finite commutativeExpand
...
1
2
...

References

SHOWING 1-10 OF 21 REFERENCES
Quantum State Transfer in Graphs
Let X be a graph, A its adjacency matrix, and t ∈ R≥0. The matrix exp(itA) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantumExpand
Perfect state transfer in quantum spin networks.
TLDR
It is shown that 2log3N is the maximal perfect communication distance for hypercube geometries if one allows fixed but different couplings between the qubits, then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. Expand
Perfect Transfer of Arbitrary States in Quantum Spin Networks
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitraryExpand
Perfect state transfer on quotient graphs
TLDR
It is shown that the Cartesian product of quotient graphs kGK/πk is isomorphic to the quotient graph kGk/π, for some equitable partition π, and provides an algebraic description of a construction due to Feder which is based on many-boson quantum walk. Expand
Characterization of quantum circulant networks having perfect state transfer
  • M. Basic
  • Physics, Computer Science
  • Quantum Inf. Process.
  • 2013
TLDR
This paper answers the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer and calculates perfect quantum communication distance (distance between vertices where PST occurs) and describes the spectra of integralcirculant graphs having PST. Expand
Further results on the perfect state transfer in integral circulant graphs
TLDR
There exists an integral circulant graph with n vertices having a perfect state transfer if and only if 4|n, and the nonexistence of a PST is proved for several other classes of integralcirculant graphs whose order is divisible by 4. Expand
Perfect state transfer, integral circulants, and join of graphs
TLDR
It is shown that the integral circulant ICGn (2, n/2b) has perfect state transfer, where b ∈ {1, 2},n is a multiple of 16 and Q is a subset of the odd divisors of n. Expand
Perfect state transfer on distance-regular graphs and association schemes
Abstract We consider the representation of a continuous-time quantum walk in a graph X by the matrix exp ⁡ ( − i t A ( X ) ) . We provide necessary and sufficient criteria for distance-regular graphsExpand
Perfect state transfer in cubelike graphs
Suppose C is a subset of non-zero vectors from the vector space Z2d. The cubelike graph X(C) has Z2d as its vertex set, and two elements of Z2d are adjacent if their difference is in C. If M is theExpand
Perfect state transfer, graph products and equitable partitions
We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09]Expand
...
1
2
3
...