Abstract: We consider continuous-time quantum walks on distance-regular graphs of small diameter. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing. First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform mixing are the Paley graph of order nine and certain graphs corresponding to regular symmetric Hadamard matrices with constant diagonal. Next we prove that if uniform mixing occurs on a bipartite graph X with n vertices, then n is divisible by four. We also prove that if X is bipartite and regular, then n is the sum of two integer squares. Our work on bipartite graphs implies that uniform mixing does not occur on C_{2m} for m >= 3. Using a result of Haagerup, we show that uniform mixing does not occur on C_p for any prime p such that p >= 5. In contrast to this result, we see that epsilon-uniform mixing occurs on C_p for all primes p.
Recommendations
Cites work
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 2019633 (Why is no real title available?)
- scientific article; zbMATH DE number 2107977 (Why is no real title available?)
- scientific article; zbMATH DE number 3342087 (Why is no real title available?)
- A New Family of Partially Balanced Incomplete Block Designs with Some Latin Square Design Properties
- Complex Hadamard matrices, instantaneous uniform mixing and cubes
- Continuous-time quantum walks on the symmetric group
- Exponential algorithmic speedup by a quantum walk
- Lie groups
- MIXING OF QUANTUM WALKS ON GENERALIZED HYPERCUBES
- NON-UNIFORM MIXING OF QUANTUM WALK ON CYCLES
- On mixing in continuous-time quantum walks on some circulant graphs
- State transfer on graphs
- Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
- Universal mixing of quantum walk on graphs
Cited in
(17)- A new perspective on the average mixing matrix
- Mixing of quantum walk on circulant bunkbeds
- Universal mixing of quantum walk on graphs
- Perfect state transfer on quasi-abelian semi-Cayley graphs
- Continuous-time quantum walks on Cayley graphs of extraspecial groups
- Apportionable matrices and gracefully labelled graphs
- Average mixing matrix of trees
- Uniform mixing on Cayley graphs
- NON-UNIFORM MIXING OF QUANTUM WALK ON CYCLES
- Average mixing of continuous quantum walks
- On mixing in continuous-time quantum walks on some circulant graphs
- Discrete-time quantum walks and graph structures
- Complex Hadamard matrices, instantaneous uniform mixing and cubes
- Selected open problems in continuous-time quantum walks
- MIXING OF QUANTUM WALKS ON GENERALIZED HYPERCUBES
- Discretization of continuous-time quantum walks via the staggered model with Hamiltonians
- Mixing of continuous quantum walks on cubelike graphs
This page was built for publication: Uniform mixing and association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401403)
