QUANTUM WALKS ON SIMPLEXES AND MULTIPLE PERFECT STATE TRANSFER3
graph, if one fixes the initial state on u, then one can only achieve per-
fect state transfer between two vertices uand v, but not a third vertex.
Recently Chaves et al. [6] discussed ‘Why and how to add direction to
a quantum walk’. They also studied the phenomenon of zero transfer.
The ambitious universal state transfer was constructed by Cameron et
al. [5] in oriented graphs, which is impossible for unoriented graphs.
Graphs that carry universal perfect state transfer and universal pretty
good state transfer are partially constructed and characterized in [5;8].
However, these graphs are dense in the sense that almost every pair
of vertices are adjacent. Multiple state transfer, as a relaxation of
universal state transfer, was proposed by Godsil and Lato in [14].
In this paper, we focus on multiple perfect state transfer (MPST).
Since very few examples are known and the distance of transfer in
known examples is small, we aim to add new models that will give
multiple perfect state transfer with arbitrary length. In order to achieve
that end, we employ the techniques of commutative association schemes.
More specifically, from the small graph where MPST can be observed,
we will show that we can obtain the model that provide MPST by con-
sidering the symmetric tensor product of the underlying association
schemes. Furthermore, the multivariate Krawtchouk polynomials play
an important in explicit calculations. For example, in [13] Godsil and
Lato showed that the directed 3-gons carry multiple perfect state trans-
fer. Since the directed 3-gon is an adjacency graph of a commutative
association scheme, we obtain multiple perfect state transfer on trian-
gle simplex of arbitrary length by taking symmetric tensor product of
the association scheme.
The paper is organized as follows.
In Section 2, we introduce the definition and basic properties of asso-
ciation schemes. The extension of association schemes is emphasized.
In Section 3, we analyze quantum walks on extension of association
schemes. In Section 4, we apply the analysis in Section 3to several
base association schemes, which gives various examples of state trans-
fer, such as perfect state transfer among extreme points of a simplex,
multiple perfect state transfer among extreme points of a simplex, and
fractional revival on subsimplexes of a simplex.
2. Association scheme
In this section, we recall the definition and basic properties of com-
mutative association scheme. We will emphasize the extension of asso-
ciation scheme, which will be used in later construction of state trans-
fers.