Investigation of Continuous-Time Quantum Walk Via Modules of Bose-Mesner and Terwilliger Algebras
arXiv:quant-ph/0603139 · doi:10.1088/0305-4470/39/42/007
Abstract
The continuous-time quantum walk on the underlying graphs of association schemes have been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose-Mesner and (reference state dependent) Terwilliger algebras. By choosing the (walk) starting site as a reference state, the Terwilliger algebra connected with this choice turns the graph into the metric space, hence stratifies the graph into a (d+1) disjoint union of strata, where the amplitudes of observing the continuous-time quantum walk on all sites belonging to a given stratum are the same. In graphs of association schemes with known spectrum, the transition amplitudes and average probabilities are given in terms of dual eigenvalues of association schemes. As most of association schemes arise from finite groups, hence the continuous-time walk on generic group association schemes have been studied in great details, where the transition amplitudes are given in terms of characters of groups. Further investigated examples are the walk on graphs of association schemes of symmetric , Dihedral and cyclic groups. Also, following Ref.\cite{js}, the spectral distributions connected to the highest irreducible representations of Terwilliger algebras of some rather important graphs, namely distance regular graphs, have been presented. Then using spectral distribution, the amplitudes of continuous-time quantum walk on graphs such as cycle graph , Johnson and normal subgroup graphs have been evaluated. {\bf Keywords: Continuous-time quantum walk, Association scheme, Bose-Mesner algebra, Terwilliger algebra, Spectral distribution, Distance regular graph.} {\bf PACs Index: 03.65.Ud}
44 pages, 4 figures
References in corpus (7)
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- From quantum cellular automata to quantum lattice gases
- An example of the difference between quantum and classical random walks
- Quantum Walks driven by many coins
- Quantum random walks with decoherent coins
- Analysis of Absorbing Times of Quantum Walks
Cited by in corpus (16)
- Distance-regular graphs
- Perfect state transfer over distance-regular spin networks
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
- Continuous-time quantum walks on star graphs
- Evaluation of effective resistances in pseudo-distance-regular resistor networks
- Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory
- Investigation of continuous-time quantum walk on root lattice and honeycomb lattice
- Continuous-Time Classical and Quantum Random Walk on Direct Product of Cayley Graphs
- Mixing and Decoherence in Continuous-time quantum walks on long-range interacting cycles
- A general algorithm for manipulating non-linear and linear entanglement witnesses by using exact convex optimization
- Pseudo-Hermitian continuous-time quantum walks
- The effect of large-decoherence on mixing-time in Continuous-time quantum walks on long-range interacting cycles
- Generating GHZ state in 2m-qubit spin network
- Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
- Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
- Generating maximally entangled distant pair in invariant stratification spin networks