Abstract
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in the case of the Grover walk on lattices. Moreover, our numerical simulation suggests that localization of our quantum walks reflects not only topological but also geometric structures. On the other hand, our proposing quantum walk contains an intrinsic problem concerning exhibition of non-trivial behavior, which is not seen in typical quantum walks such as Grover walks on graphs.
Similar content being viewed by others
Notes
We restrict ourselves to orthogonal projections for the measurement for simplicity.
References
Gudder, S.P.: Quantum Probability. Probability and Mathematical Statistics. Academic, Boston (1988)
Feynman, R.P., Hibbs, A.R.: Quantum Mechanics and Path Integrals. Dover Publications, Inc., Mineola (2010). Emended edition, Emended and with a preface by Daniel F. Styer
Konno, N.: Quantum random walks in one dimension. Quantum Inf. Process. 1(5), 345–354 (2002). 2003
Ambainis, A.: Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 1(04), 507–518 (2003)
Konno, N.: Quantum walks. In: Quantum Potential Theory, Vol. 1954 of Lecture Notes in Math., pp. 309–452. Springer, Berlin (2008)
Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210–239 (2007). (electronic)
Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1099–1108 (electronic). ACM, New York (2005)
Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67(5), 052307 (2003)
Abal, G., Donangelo, R., Forets, M., Portugal, R.: Spatial quantum search in a triangular network. Math. Struct. Comput. Sci. 22(03), 521–531 (2012)
Chandrashekar, C.M., Banerjee, S., Srikanth, R.: Relationship between quantum walks and relativistic quantum mechanics. Phys. Rev. A 81(6), 062340 (2010)
Strauch, F.W.: Relativistic effects and rigorous limits for discrete- and continuous-time quantum walks. J. Math. Phys. 48(8), 082102 (2007). 27
Karski, M., Förster, L., Choi, J.-M., Steffen, A., Alt, W., Meschede, D., Widera, A.: Quantum walk in position space with single optically trapped atoms. Science 325(5937), 174–177 (2009)
Matsuoka, L., Yokoyama, K.: Physical implementation of quantum cellular automaton in a diatomic molecule. J. Comput. Theor. Nanosci. 10(7), 1617–1620 (2013)
Zähringer, F., Kirchmair, G., Gerritsma, R., Solano, E., Blatt, R., Roos, C.F.: Realization of a quantum walk with one and two trapped ions. Phys. Rev. Lett. 104(10), 100503 (2010)
Wang, J., Manouchehri, K.: Physical Implementation of Quantum Walks. Springer, Berlin (2013)
Berry, S.D., Bourke, P., Wang, J.B.: qwviz: visualisation of quantum walks on graphs. Comput. Phys. Commun. 182(10), 2295–2302 (2011)
Watrous, J.: Quantum simulations of classical random walks and undirected graph connectivity. In: Proceedings of Fourteenth Annual IEEE Conference on Computational Complexity, 1999, pp. 180–187 (1999)
Higuchi, Yu., Konno, N., Sato, I., Segawa, E.: Quantum graph walks I: mapping to quantum walks. Yokohama Math. J. 59, 33–55 (2013)
Szegedy, M.: Quantum speed-up of markov chain based algorithms. In: Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, pp. 32–41 (2004)
Paparo, G.D., Martin-Delgado, M.A.: Google in a quantum network. Sci. Rep. 2, 444 (2012)
Paparo, G.D., Müller, M., Comellas, F., Martin-Delgado, M.A.: Quantum google in a complex network. Sci. Rep. 3, 2773 (2013)
Higuchi, Yu., Konno, N., Sato, I., Segawa, E.: Spectral and asymptotic properties of Grover walks on crystal lattices. J. Funct. Anal. 267(11), 4197–4235 (2014)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)
Meyer, D.A.: From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85(5–6), 551–574 (1996)
Tregenna, B., Flanagan, W., Maile, R., Kendon, V.: Controlling discrete quantum walks: coins and initial states. New J. Phys. 5(1), 83 (2003)
Milnor, J.W., Stasheff, J.D.: Characteristic Classes. Princeton University Press, Princeton, N. J.; University of Tokyo Press, Tokyo, 1974. Ann. Math. Stud. No. 76
Matsue, K., Ogurisu, O., Segawa, E.: Quantum walks on cubical sets : construction and asymptotic behavior on \({\mathbb{R}}^2\) (in preparation)
Kaczynski, T., Mischaikow, K., Mrozek, M.: Computational homology. Applied Mathematical Sciences, vol. 157. Springer-Verlag, New York (2004)
Acknowledgments
KM was partially supported by Coop with Math Program, a commissioned project by MEXT, Japan. OO was partially supported by JSPS KAKENHI Grant Number 24540208. ES was partially supported by JSPS Grant-in-Aid for Young Scientists (B) (No. 25800088). Finally, we would like to thank the referees for their careful reading of this paper and for helpful suggestions about construction and discussion of this paper.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Simplicial complexes
We state a quick review of homology of simplicial complexes for readers who are not familiar with it. See, e.g., [28] for details.
Definition 4.1
Let \({\mathbb {R}}^N\) be a Euclidean space and \(O_N\) be the origin of \({\mathbb {R}}^N\). Let \(a_0,a_1,\ldots , a_n \in {\mathbb {R}}^N\) be points so that n vectors \(\{\overrightarrow{a_0a_i}\}_{i=1}^n\) are linearly independent. An n -simplex is a set \(|\sigma | \subset {\mathbb {R}}^N\) given by
We also write \(|\sigma |\) as \(|a_0a_1 \ldots a_n|\) if we write the dependence of points \(\{a_i\}_{i=0}^n\) explicitly. A k-face of an n-simplex \(|\sigma | = |a_0a_1\ldots a_n|\) is a k-simplex \(|\tau |\) generated by k points in \(\{a_0\}_{i=0}^n\). In such a case, \(|\sigma |\) is called a coface of \(|\tau |\). An \((n-1)\)-face of an n-simplex \(\sigma \) is often called a primary face of \(\sigma \).
For example, for a given simplex \(|\sigma | = |abc|\), edges |ab|, |bc|, and |ca| are primary faces of \(\sigma \). Also, vertices |a|, |b|, and |c| are 0-faces of \(|\sigma |\). Finally, \(|\sigma |\) is a coface of |a|, |b|, |c|, |ab|, |bc|, and |ca|.
Definition 4.2
A simplicial complex \({\mathcal {K}}\) is the collection of simplices satisfying
-
If \(|\sigma | \in {\mathcal {K}}\), then all faces of \(|\sigma |\) are also elements in \({\mathcal {K}}\).
-
If \(|\sigma _1|, |\sigma _2| \in {\mathcal {K}}\) and if \(|\sigma _1|\cap |\sigma _2| \not = \emptyset \), then \(|\sigma _1|\cap |\sigma _2|\) is a face of both \(|\sigma _1|\) and \(|\sigma _2|\).
For a given simplicial complex \({\mathcal {K}}\), the union of all simplices of \({\mathcal {K}}\) is the polytope of \({\mathcal {K}}\) and is denoted by \({\mathcal {K}}\). A set P is a polyhedron if it is the polytope \({\mathcal {K}}\) of a simplicial complex \({\mathcal {K}}\).
Let \({\mathcal {K}} = \{K_k\}_{k\ge 0}\) be a simplicial complex, where \(K_k = \{|\sigma | \in {\mathcal {K}} \mid |\sigma | \text { is a}~ k\text {-simplex}\}\). If \(n = \max \{k \mid K_k \not = \emptyset \} < \infty \), then we call \({\mathcal {K}}\) an n -dimensional simplicial complex. For a simplicial complex \({\mathcal {K}}\) with \(\dim {\mathcal {K}}= n\), its m -skeleton is defined by \({\mathcal {K}}^{(m)} := \{K_k\}_{k\ge 0}^m\) for \(m\le n\). For each \(|\sigma | \in K_k\), we call the number k the dimension of \(|\sigma |\). Simplicial complexes admit several classes to be considered.
Definition 4.3
For a simplicial complex \({\mathcal {K}}\), a facet in \({\mathcal {K}}\) is a simplex \(\sigma \in {\mathcal {K}}\) which is maximal with respect to the inclusion relation of sets. A simplicial complex \({\mathcal {K}}\) is pure if all facets in \({\mathcal {K}}\) have an identical dimension. An n-dimensional pure simplicial complex \({\mathcal {K}}\) is strongly connected if, for each \(|\sigma |, |\tau | \in K_n\), there is a sequence of n-simplices \(\{|\sigma _j|\}_{j=0}^k\) with \(|\sigma _0| = |\sigma |\) and \(|\sigma _k| = |\tau |\) such that \(|\sigma _{j-1}| \cap |\sigma _j|\) is a primary face of \(|\sigma _{j-1}|\) and \(|\sigma _j|\) for \(j=1,\ldots , n\).
Remark 4.4
We often call an \((n-1)\)-face of an n-simplex \(|\sigma |\) a facet of \(|\sigma |\). It is completely different from facets in simplicial complexes.
The core of homology is to translate geometric objects to algebraic ones in terms of chains.
Definition 4.5
Let \({\mathcal {K}}\) be a simplicial complex. For each \(|\sigma | = |a_0 a_1 \ldots a_k|\in K_k\), the associated k -chain is the function \(\widehat{|\sigma |} : K_k \rightarrow \{0,1\}\) given by
with the following rule: for a permutation \(\pi \in S_{k+1}\), identify \(\widehat{|\sigma |}(\pi |\sigma |)\) with \((\det \pi )\widehat{|\sigma |}(|\sigma |)\).
Define
This is called k -th chain group of \({\mathcal {K}}\), which is a \({\mathbb {Z}}\)-module.
Definition 4.6
For \(|\sigma | = |a_0 a_1 \ldots a_k|\in K_k\), define the boundary \(\partial \widehat{|\sigma |}\) of the chain \(\widehat{|\sigma |}\) by
which is an element in \(C_{k-1}\). Extending linearly this definition, we obtain a linear map \(\partial _k : C_k({\mathcal {K}})\rightarrow C_{k-1}({\mathcal {K}})\). This map is called (k -th) boundary map of \({\mathcal {K}}\).
The important property of boundary maps is the following.
Proposition 4.7
\(\partial _k \circ \partial _{k+1} = 0: C_{k+1}({\mathcal {K}})\rightarrow C_{k-1}({\mathcal {K}})\).
A pair \(\{C_k({\mathcal {K}}), \partial _k\}_{k\in {\mathbb {Z}}}\) consisting of sequences of chain groups and boundary maps is called a chain complex of \({\mathcal {K}}\). Then, we are ready to define homology groups.
Definition 4.8
For a simplicial complex \({\mathcal {K}}\), we define
Both are submodules of \(C_k({\mathcal {K}})\). An element in \(Z_k({\mathcal {K}})\) is called a k -cycle, and an element in \(B_k({\mathcal {K}})\) is called a k -boundary. Thanks to Proposition 4.7, \(B_k({\mathcal {K}})\) is a submodule of \(Z_k({\mathcal {K}})\). Thus, the quotient module
can be considered. This quotient group is called the k -th homology group of \({\mathcal {K}}\). Roughly speaking, the k-th homology group describes the information of k-dimensional holes in \({\mathcal {K}}\).
The simple example of homology is shown in Fig. 15.
Appendix 2: Concrete implementations of time evolution of S-quantum walks
In this section, we describe concrete implementations of time evolutions of S-quantum walks.
1.1 Fundamental evolution rule
The basic implementations in our calculations are given in the case of S-quantum walks on \({\mathcal {K}}_0\). Following notations in Remark 3.1, evolution rules on lower triangles and upper triangles are defined as follows:
-
Case 1: the lower triangle (Fig. 4a)
By following the definition of U, the evolution of a state on a lower triangle is given by
The first term of the right-hand side represents the “reflection” of waves and the second represents the “transmission” of waves to the adjacent upper triangle.
-
Case 2: the upper triangle (Fig. 4b)
Similarly, the evolution of the state on an upper triangle is given by
As in the case of lower triangles, the first term of the right-hand side represents the “reflection” of waves and the second represents the “transmission” of waves to the adjacent lower triangle.
1.2 Evolution rule on \({\mathcal {K}}_2\): around the tetrahedron
Here, we describe the evolution rule of S-quantum walks on \({\mathcal {K}}_2\). In particular, the evolution rule near the tetrahedron is derived. Evolution rules on the region far from the tetrahedron follow from those on \({\mathcal {K}}_0\) discussed in the previous subsection. All labeling of simplices and bases on them are drawn in Figs. 16 and 17, respectively. Readers should refer to descriptions in these figures to study time evolutions stated below.
For the notation rule stated in Remark 3.1, we use bold-letter labelings shown in Fig. 16 instead of integer indices. By following the definition of U, the evolution of base elements on the 2-simplex \(\mathbf{x}\in \{ \mathbf{a},\mathbf{b},\mathbf{c}, \mathbf{A},\mathbf{B},\mathbf{C},\mathbf{D} \}\) is given in Sects. 4.2 and 4.2.2.
1.2.1 2-simplices around tetrahedron
-
Case 1: 2-simplex labeled a (Figs. 16 and 17)
$$\begin{aligned} \begin{pmatrix} \delta _{\mathbf{a},0}\\ \delta _{\mathbf{a},1}\\ \delta _{\mathbf{a},2}\\ \delta _{\mathbf{a},3}\\ \delta _{\mathbf{a},4}\\ \delta _{\mathbf{a},5} \end{pmatrix}&\mapsto \begin{pmatrix} (2|w_{\mathbf{a},0}|^2-1)\cdot \delta _{\mathbf{a},1} \\ (2|w_{\mathbf{a},1}|^2-1)\cdot \delta _{\mathbf{a},2} \\ (2|w_{\mathbf{a},2}|^2-1)\cdot \delta _{\mathbf{a},0} \\ (2|w_{\mathbf{a},3}|^2-1)\cdot \delta _{\mathbf{a},4} \\ (2|w_{\mathbf{a},4}|^2-1)\cdot \delta _{\mathbf{a},5} \\ (2|w_{\mathbf{a},5}|^2-1)\cdot \delta _{\mathbf{a},3} \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{a},0}}w_{\mathbf{A},4} \cdot \delta _{\mathbf{A},5}\\ 2\overline{w_{\mathbf{a},1}}w_{\mathbf{a}',3} \cdot \delta _{\mathbf{a}',4}\\ 2\overline{w_{\mathbf{a},2}}w_{\mathbf{a}'',5} \cdot \delta _{\mathbf{a}'',3}\\ 2\overline{w_{\mathbf{a},3}}w_{\mathbf{A},2} \cdot \delta _{\mathbf{A},0}\\ 2\overline{w_{\mathbf{a},4}}w_{\mathbf{a}'',1} \cdot \delta _{\mathbf{a}'',2}\\ 2\overline{w_{\mathbf{a},5}}w_{\mathbf{a}',0} \cdot \delta _{\mathbf{a}',1} \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{a},0}}w_{\mathbf{B},4} \cdot \delta _{\mathbf{B},5}\\ 0\\ 0\\ 2\overline{w_{\mathbf{a},3}}w_{\mathbf{B},2} \cdot \delta _{\mathbf{B},0}\\ 0\\ 0 \end{pmatrix}. \end{aligned}$$ -
Case 2: 2-simplex labeled b (Figs. 16 and 17)
$$\begin{aligned} \begin{pmatrix} \delta _{\mathbf{b},0}\\ \delta _{\mathbf{b},1}\\ \delta _{\mathbf{b},2}\\ \delta _{\mathbf{b},3}\\ \delta _{\mathbf{b},4}\\ \delta _{\mathbf{b},5} \end{pmatrix} \mapsto \begin{pmatrix} (2|w_{\mathbf{b},0}|^2-1)\cdot \delta _{\mathbf{b},1} \\ (2|w_{\mathbf{b},1}|^2-1)\cdot \delta _{\mathbf{b},2} \\ (2|w_{\mathbf{b},2}|^2-1)\cdot \delta _{\mathbf{b},0} \\ (2|w_{\mathbf{b},3}|^2-1)\cdot \delta _{\mathbf{b},4} \\ (2|w_{\mathbf{b},4}|^2-1)\cdot \delta _{\mathbf{b},5} \\ (2|w_{\mathbf{b},5}|^2-1)\cdot \delta _{\mathbf{b},3} \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{b},0}}w_{\mathbf{b}'',4} \cdot \delta _{\mathbf{b}'',5}\\ 2\overline{w_{\mathbf{b},1}}w_{\mathbf{A},3} \cdot \delta _{\mathbf{A},4}\\ 2\overline{w_{\mathbf{b},2}}w_{\mathbf{b}',5} \cdot \delta _{\mathbf{b}',3}\\ 2\overline{w_{\mathbf{b},3}}w_{\mathbf{b}'',2} \cdot \delta _{\mathbf{b}'',0}\\ 2\overline{w_{\mathbf{b},4}}w_{\mathbf{b}',1} \cdot \delta _{\mathbf{b}',2}\\ 2\overline{w_{\mathbf{b},5}}w_{\mathbf{A},0} \cdot \delta _{\mathbf{A},1} \end{pmatrix} + \begin{pmatrix} 0\\ 2\overline{w_{\mathbf{b},1}}w_{\mathbf{C},4} \cdot \delta _{\mathbf{C},5}\\ 0\\ 0\\ 0\\ 2\overline{w_{\mathbf{b},5}}w_{\mathbf{C},2} \cdot \delta _{\mathbf{C},0} \end{pmatrix}. \end{aligned}$$ -
Case 3: 2-simplex labeled c (Figs. 16 and 17)
$$\begin{aligned} \begin{pmatrix} \delta _{\mathbf{c},0}\\ \delta _{\mathbf{c},1}\\ \delta _{\mathbf{c},2}\\ \delta _{\mathbf{c},3}\\ \delta _{\mathbf{c},4}\\ \delta _{\mathbf{c},5} \end{pmatrix}&\mapsto \begin{pmatrix} (2|w_{\mathbf{c},0}|^2-1)\cdot \delta _{\mathbf{c},1} \\ (2|w_{\mathbf{c},1}|^2-1)\cdot \delta _{\mathbf{c},2} \\ (2|w_{\mathbf{c},2}|^2-1)\cdot \delta _{\mathbf{c},0} \\ (2|w_{\mathbf{c},3}|^2-1)\cdot \delta _{\mathbf{c},4} \\ (2|w_{\mathbf{c},4}|^2-1)\cdot \delta _{\mathbf{c},5} \\ (2|w_{\mathbf{c},5}|^2-1)\cdot \delta _{\mathbf{c},3} \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{c},0}}w_{\mathbf{c}',4} \cdot \delta _{\mathbf{c}',5}\\ 2\overline{w_{\mathbf{c},1}}w_{\mathbf{c}'',3} \cdot \delta _{\mathbf{c}'',4}\\ 2\overline{w_{\mathbf{c},2}}w_{\mathbf{A},5} \cdot \delta _{\mathbf{A},3}\\ 2\overline{w_{\mathbf{c},3}}w_{\mathbf{c}',2} \cdot \delta _{\mathbf{c}',0}\\ 2\overline{w_{\mathbf{c},4}}w_{\mathbf{A},1} \cdot \delta _{\mathbf{A},2}\\ 2\overline{w_{\mathbf{c},5}}w_{\mathbf{c}'',0} \cdot \delta _{\mathbf{c}'',1} \end{pmatrix} + \begin{pmatrix} 0\\ 0\\ 2\overline{w_{\mathbf{c},2}}w_{\mathbf{D},4} \cdot \delta _{\mathbf{D},5}\\ 0\\ 2\overline{w_{\mathbf{c},4}}w_{\mathbf{D},2} \cdot \delta _{\mathbf{D},0}\\ 0 \end{pmatrix}. \end{aligned}$$
1.2.2 2-simplices on tetrahedron
-
Case 1: 2-simplex labeled A (Figs. 16 and 17)
$$\begin{aligned} \begin{pmatrix} \delta _{\mathbf{A},0}\\ \delta _{\mathbf{A},1}\\ \delta _{\mathbf{A},2}\\ \delta _{\mathbf{A},3}\\ \delta _{\mathbf{A},4}\\ \delta _{\mathbf{A},5} \end{pmatrix}&\mapsto \begin{pmatrix} (2|w_{\mathbf{A},0}|^2-1)\cdot \delta _{\mathbf{A},1} \\ (2|w_{\mathbf{A},1}|^2-1)\cdot \delta _{\mathbf{A},2} \\ (2|w_{\mathbf{A},2}|^2-1)\cdot \delta _{\mathbf{A},0} \\ (2|w_{\mathbf{A},3}|^2-1)\cdot \delta _{\mathbf{A},4} \\ (2|w_{\mathbf{A},4}|^2-1)\cdot \delta _{\mathbf{A},5} \\ (2|w_{\mathbf{A},5}|^2-1)\cdot \delta _{\mathbf{A},3} \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{A},0}}w_{\mathbf{b},5} \cdot \delta _{\mathbf{b},3}\\ 2\overline{w_{\mathbf{A},1}}w_{\mathbf{c},4} \cdot \delta _{\mathbf{c},5}\\ 2\overline{w_{\mathbf{A},2}}w_{\mathbf{a},3} \cdot \delta _{\mathbf{a},4}\\ 2\overline{w_{\mathbf{A},3}}w_{\mathbf{b},1} \cdot \delta _{\mathbf{b},2}\\ 2\overline{w_{\mathbf{A},4}}w_{\mathbf{a},0} \cdot \delta _{\mathbf{a},1}\\ 2\overline{w_{\mathbf{A},5}}w_{\mathbf{c},2} \cdot \delta _{\mathbf{c},0} \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{A},0}}w_{\mathbf{C},2} \cdot \delta _{\mathbf{C},0}\\ 2\overline{w_{\mathbf{A},1}}w_{\mathbf{D},2} \cdot \delta _{\mathbf{D},0}\\ 2\overline{w_{\mathbf{A},2}}w_{\mathbf{B},2} \cdot \delta _{\mathbf{B},0}\\ 2\overline{w_{\mathbf{A},3}}w_{\mathbf{C},4} \cdot \delta _{\mathbf{C},5}\\ 2\overline{w_{\mathbf{A},4}}w_{\mathbf{B},4} \cdot \delta _{\mathbf{B},5}\\ 2\overline{w_{\mathbf{A},5}}w_{\mathbf{D},4} \cdot \delta _{\mathbf{D},5} \end{pmatrix}. \end{aligned}$$ -
Case 2: 2-simplex labeled B (Figs. 16 and 17)
$$\begin{aligned} \begin{pmatrix} \delta _{\mathbf{B},0}\\ \delta _{\mathbf{B},1}\\ \delta _{\mathbf{B},2}\\ \delta _{\mathbf{B},3}\\ \delta _{\mathbf{B},4}\\ \delta _{\mathbf{B},5} \end{pmatrix}&\mapsto \begin{pmatrix} (2|w_{\mathbf{B},0}|^2-1)\cdot \delta _{\mathbf{B},1} \\ (2|w_{\mathbf{B},1}|^2-1)\cdot \delta _{\mathbf{B},2} \\ (2|w_{\mathbf{B},2}|^2-1)\cdot \delta _{\mathbf{B},0} \\ (2|w_{\mathbf{B},3}|^2-1)\cdot \delta _{\mathbf{B},4} \\ (2|w_{\mathbf{B},4}|^2-1)\cdot \delta _{\mathbf{B},5} \\ (2|w_{\mathbf{B},5}|^2-1)\cdot \delta _{\mathbf{B},3} \end{pmatrix} + \begin{pmatrix} 0\\ 0\\ 2\overline{w_{\mathbf{B},2}}w_{\mathbf{a},6} \cdot \delta _{\mathbf{a},4} \\ 0\\ 2\overline{w_{\mathbf{B},4}}w_{\mathbf{a},0} \cdot \delta _{\mathbf{a},1} \\ 0 \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{B},0}}w_{\mathbf{C},5} \cdot \delta _{\mathbf{C},3}\\ 2\overline{w_{\mathbf{B},1}}w_{\mathbf{D},3} \cdot \delta _{\mathbf{D},4}\\ 2\overline{w_{\mathbf{B},2}}w_{\mathbf{A},2} \cdot \delta _{\mathbf{A},0}\\ 2\overline{w_{\mathbf{B},3}}w_{\mathbf{C},1} \cdot \delta _{\mathbf{C},2}\\ 2\overline{w_{\mathbf{B},4}}w_{\mathbf{A},4} \cdot \delta _{\mathbf{A},5}\\ 2\overline{w_{\mathbf{B},5}}w_{\mathbf{D},0} \cdot \delta _{\mathbf{D},1} \end{pmatrix}. \end{aligned}$$ -
Case 3: 2-simplex labeled C (Figs. 16 and 17)
$$\begin{aligned} \begin{pmatrix} \delta _{\mathbf{C},0}\\ \delta _{\mathbf{C},1}\\ \delta _{\mathbf{C},2}\\ \delta _{\mathbf{C},3}\\ \delta _{\mathbf{C},4}\\ \delta _{\mathbf{C},5} \end{pmatrix}&\mapsto \begin{pmatrix} (2|w_{\mathbf{C},0}|^2-1)\cdot \delta _{\mathbf{C},1} \\ (2|w_{\mathbf{C},1}|^2-1)\cdot \delta _{\mathbf{C},2} \\ (2|w_{\mathbf{C},2}|^2-1)\cdot \delta _{\mathbf{C},0} \\ (2|w_{\mathbf{C},3}|^2-1)\cdot \delta _{\mathbf{C},4} \\ (2|w_{\mathbf{C},4}|^2-1)\cdot \delta _{\mathbf{C},5} \\ (2|w_{\mathbf{C},5}|^2-1)\cdot \delta _{\mathbf{C},3} \end{pmatrix} + \begin{pmatrix} 0\\ 0\\ 2\overline{w_{\mathbf{C},2}}w_{\mathbf{b},5} \cdot \delta _{\mathbf{b},3} \\ 0\\ 2\overline{w_{\mathbf{C},4}}w_{\mathbf{b},1} \cdot \delta _{\mathbf{b},2} \\ 0 \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{C},0}}w_{\mathbf{D},5} \cdot \delta _{\mathbf{D},3}\\ 2\overline{w_{\mathbf{C},1}}w_{\mathbf{B},3} \cdot \delta _{\mathbf{B},4}\\ 2\overline{w_{\mathbf{C},2}}w_{\mathbf{A},0} \cdot \delta _{\mathbf{A},1}\\ 2\overline{w_{\mathbf{C},3}}w_{\mathbf{D},1} \cdot \delta _{\mathbf{D},2}\\ 2\overline{w_{\mathbf{C},4}}w_{\mathbf{A},3} \cdot \delta _{\mathbf{A},4}\\ 2\overline{w_{\mathbf{C},5}}w_{\mathbf{B},0} \cdot \delta _{\mathbf{B},1} \end{pmatrix}. \end{aligned}$$ -
Case 4: 2-simplex labeled D (Figs. 16 and 17)
$$\begin{aligned} \begin{pmatrix} \delta _{\mathbf{D},0}\\ \delta _{\mathbf{D},1}\\ \delta _{\mathbf{D},2}\\ \delta _{\mathbf{D},3}\\ \delta _{\mathbf{D},4}\\ \delta _{\mathbf{D},5} \end{pmatrix}&\mapsto \begin{pmatrix} (2|w_{\mathbf{D},0}|^2-1)\cdot \delta _{\mathbf{D},1} \\ (2|w_{\mathbf{D},1}|^2-1)\cdot \delta _{\mathbf{D},2} \\ (2|w_{\mathbf{D},2}|^2-1)\cdot \delta _{\mathbf{D},0} \\ (2|w_{\mathbf{D},3}|^2-1)\cdot \delta _{\mathbf{D},4} \\ (2|w_{\mathbf{D},4}|^2-1)\cdot \delta _{\mathbf{D},5} \\ (2|w_{\mathbf{D},5}|^2-1)\cdot \delta _{\mathbf{D},3} \end{pmatrix} + \begin{pmatrix} 0\\ 0\\ 2\overline{w_{\mathbf{D},2}}w_{\mathbf{c},4} \cdot \delta _{\mathbf{c},5} \\ 0\\ 2\overline{w_{\mathbf{D},2}}w_{\mathbf{c},2} \cdot \delta _{\mathbf{c},0} \\ 0 \end{pmatrix} + \begin{pmatrix} 2\overline{w_{\mathbf{D},0}}w_{\mathbf{B},5} \cdot \delta _{\mathbf{B},3}\\ 2\overline{w_{\mathbf{D},1}}w_{\mathbf{C},3} \cdot \delta _{\mathbf{C},4}\\ 2\overline{w_{\mathbf{D},2}}w_{\mathbf{A},1} \cdot \delta _{\mathbf{A},2}\\ 2\overline{w_{\mathbf{D},3}}w_{\mathbf{B},1} \cdot \delta _{\mathbf{B},2}\\ 2\overline{w_{\mathbf{D},2}}w_{\mathbf{A},5} \cdot \delta _{\mathbf{A},3}\\ 2\overline{w_{\mathbf{D},5}}w_{\mathbf{C},0} \cdot \delta _{\mathbf{C},1} \end{pmatrix}. \end{aligned}$$
Rights and permissions
About this article
Cite this article
Matsue, K., Ogurisu, O. & Segawa, E. Quantum walks on simplicial complexes. Quantum Inf Process 15, 1865–1896 (2016). https://doi.org/10.1007/s11128-016-1247-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-016-1247-6