• Corpus ID: 239009855

Fractional revival on non-cospectral vertices

  title={Fractional revival on non-cospectral vertices},
  author={Chris D. Godsil and Xiaohong Zhang},
Perfect state transfer and fractional revival can be used to move information between pairs of vertices in a quantum network. While perfect state transfer has received a lot of attention, fractional revival is newer and less studied. One problem is to determine the differences between perfect state transfer and fractional revival. If perfect state transfer occurs between two vertices in a graph, the vertices must be cospectral. Further if there is perfect state transfer between vertices a and b… 

Figures from this paper


Quantum fractional revival on graphs
This work builds upon the algebraic machinery developed for related quantum transport phenomena such as state transfer and mixing, and it reveals a fundamental connection between them.
Characterization of quantum circulant networks having perfect state transfer
  • Milan Basic
  • Physics, Computer Science
    Quantum Inf. Process.
  • 2013
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.
State transfer on graphs
  • C. Godsil
  • Computer Science, Mathematics
    Discret. Math.
  • 2012
A survey of some of the work on perfect state transfer and related questions is offered, almost entirely on the mathematics, and the interactions between graph theory andperfect state transfer are surveyed.
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 arbitrary
Quantum spin chains with fractional revival
A systematic study of fractional revival at two sites in $XX$ quantum spin chains is presented and analytic models with this phenomenon are exhibited. The generic models have two essential parameters
A graph with fractional revival
Abstract An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where
Basics of perfect communication through quantum networks
  • A. Kay
  • Mathematics, Physics
  • 2011
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer but to design a
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 the
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 graphs
Periodic Graphs
  • C. Godsil
  • Computer Science, Mathematics
    Electron. J. Comb.
  • 2011
It is shown that, for a class of graphs X including all vertex-transitive graphs, if perfect state transfer occurs at time τ , then H(τ) is a scalar multiple of a permutation matrix of order two with no fixed points.