Switching and partially switching the hypercube while maintaining perfect state transfer
Loading...
Date
2019
Authors
Kirkland, S.
Plosker, S.
Zhang, X.
Journal Title
Journal ISSN
Volume Title
Publisher
Quantum Information and Computation 19, 0541-0554.
Abstract
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 PST in a quantum information-theoretic context, namely with respect to inter-qubit
interactions of a quantum system. We perform various perturbations to the hypercube
graph - a graph that is known to exhibit PST - to create graphs that maintain many of
the same properties of the hypercube, including PST as well as the distance for which
PST occurs. We show that the sensitivity with respect to readout time errors remains
unaffected for the vertices involved in PST. We give motivation for when these perturbations may be physically desirable or even necessary.
Description
Keywords
quantum State transfer. Perfect state transfer. Adjacency matrices. Hypercubes. Godsil-McKay switching.