28 citations · 30 across the 8 of their papers we have counts for
8 papers
Cospectral graphs obtained by edge deletion
Chris Godsil, Wanting Sun, Xiaohong Zhang
Let denote the Schur product of two matrices and . A graph with adjacency matrix is walk regular if is a constant times for each ,…
State Transfer in Complex Quantum Walks
Antonio Acuaviva, Ada Chan, Summer Eldridge +5
Given a graph with Hermitian adjacency matrix , perfect state transfer occurs from vertex to vertex if the -entry of the unitary matrix has unit magn…
Fractional revival on non-cospectral vertices
Chris Godsil, 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 att…
Hadamard diagonalizable graphs of order at most 36
Jane Breen, Steve Butler, Melissa Fuentes +7
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries , then the matrix formed by taking the columns as the eigenvectors is a Hadamard mat…
Switching and partially switching the hypercube while maintaining perfect state transfer
Steve Kirkland, Sarah Plosker, Xiaohong Zhang
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to P…
Perfect quantum state transfer in weighted paths with potentials (loops) using orthogonal polynomials
Steve Kirkland, Darian McLaren, Rajesh Pereira +2
A simple method for transmitting quantum states within a quantum computer is via a quantum spin chain---that is, a path on vertices. Unweighted paths are of limited use, and so…
Perfect quantum state transfer using Hadamard diagonalizable graphs
Nathaniel Johnston, Steve Kirkland, Sarah Plosker +2
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 the c…
Bounds on probability of state transfer with respect to readout time and edge weight
Whitney Gordon, Steve Kirkland, Chi-Kwong Li +2
We analyse the sensitivity of a spin chain modelled by an undirected weighted connected graph exhibiting perfect state transfer to small perturbations in readout time and edge weig…