Uniform mixing and association schemes

zbMATH Open1369.05218arXiv1301.5889MaRDI QIDQ2401403FDOQ2401403

Authors: Natalie Mullin, Aidan Roy, Chris Godsil 

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1301.5889

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On mixing in continuous-time quantum walks on some circulant graphs
• Uniform mixing on Cayley graphs
• Complex Hadamard matrices, instantaneous uniform mixing and cubes
• MIXING OF QUANTUM WALKS ON GENERALIZED HYPERCUBES
• Universal mixing of quantum walk on graphs

zbMATH Keywords

quantum walksassociation schemesuniform mixing

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Exponential algorithmic speedup by a quantum walk
• State transfer on graphs
• Lie groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Continuous-time quantum walks on the symmetric group
• On mixing in continuous-time quantum walks on some circulant graphs
• Title not available (Why is that?)
• Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
• NON-UNIFORM MIXING OF QUANTUM WALK ON CYCLES
• Universal mixing of quantum walk on graphs
• MIXING OF QUANTUM WALKS ON GENERALIZED HYPERCUBES
• A New Family of Partially Balanced Incomplete Block Designs with Some Latin Square Design Properties
• Complex Hadamard matrices, instantaneous uniform mixing and cubes

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
• Apportionable matrices and gracefully labelled graphs
• Continuous-time quantum walks on Cayley graphs of extraspecial groups
• 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)