Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1709.03591 · The Electronic Journal of Combinatorics

A New Perspective on the Average Mixing Matrix

Gabriel Coutinho, Chris D. Godsil, Krystal Guo, Hanmeng Zhan

Published Oct 19, 2018• 8 citations
arXivHTMLPDF

Abstract

We consider the continuous-time quantum walk defined on the adjacency matrix of a graph. At each instant, the walk defines a mixing matrix which is doubly-stochastic. The average of the mixing matrices contains relevant information about the quantum walk and about the graph. We show that it is the matrix of transformation of the orthogonal projection onto the commutant algebra of the adjacency matrix, restricted to diagonal matrices. Using this formulation of the average mixing matrix, we find connections between its rank and automorphisms of the graph.

DOI
10.37236/7867

Related papers

Diagonal entries of the average mixing matrix

Chris D. Godsil, Krystal Guo, Mariia Sobchuk

We study the diagonal entries of the average mixing matrix of continuous quantum walks. The average mixing matrix is a graph invariant; it is the sum of the Schur squares of spectral idempotents of the Hamiltonian. It is non-negative, doubly stochastic and positive semi-definite. We investigate the diagonal entries of this matrix. We study the graphs for which the trace of the average mixing matrix is maximum or minimum and we classify those which are maximum. We give two constructions of graphs whose average mixing matrices have constant diagonal.

arXiv:1910.02039•Oct 4, 2019•2 citations

Irrational Quantum Walks

Gabriel Coutinho, Pedro Ferreira Baptista, Chris D. Godsil +2 more

Abstract. The adjacency matrix of a graph [Formula: see text] is the Hamiltonian for a continuous-time quantum walk on the vertices of [Formula: see text]. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the behavior of the walk is typically not periodic. In this paper, we develop a theory to exactly study any quantum walk generated by an integral Hamiltonian, and we put emphasis on those with irrational eigenvalues—what we call irrational quantum walks. As a result, we provide exact methods to compute the average of the mixing matrices, and to decide whether pretty good (or almost perfect) state transfer occurs in a given graph. We also use our methods to study geometric properties of beautiful curves arising from entries of the quantum walk matrix and discuss possible applications of these results. Throughout the paper, we emphasize the interplay between different fields of mathematics applied to the study of quantum walks.

arXiv:2208.08971•SIAM Journal on Applied Algebra and Geometry•Jul 25, 2023•6 citations

Uniform Mixing of Quantum Walks and Association Schemes

Natalie Mullin

In recent years quantum algorithms have become a popular area of mathematical research. Farhi and Gutmann introduced the concept of a quantum walk in 1998. In this thesis we investigate mixing properties of continuous-time quantum walks from a mathematical perspective. We focus on the connections between mixing properties and association schemes. \n \nThere are three main goals of this thesis. Our primary goal is to develop the algebraic groundwork necessary to systematically study mixing properties of continuous-time quantum walks on regular graphs. Using these tools we achieve two additional goals: we construct new families of graphs that admit uniform mixing, and we prove that other families of graphs never admit uniform mixing. \n \nWe begin by introducing association schemes and continuous-time quantum walks. Within this framework we develop specific algebraic machinery to tackle the uniform mixing problem. Our main algebraic result shows that if a graph has an irrational eigenvalue, then its transition matrix has at least one transcendental coordinate at all nonzero times. \n \nNext we study algebraic varieties related to uniform mixing to determine information about the coordinates of the corresponding transition matrices. Combining this with our main algebraic result we prove that uniform mixing does not occur on even cycles or prime cycles. However, we show that the probability distribution of a quantum walk on a prime cycle gets arbitrarily close to uniform. \n \nFinally we consider uniform mixing on Cayley graphs of elementary abelian groups. We utilize graph quotients to connect the mixing properties of these graphs to Hamming graphs. This enables us to find new results about uniform mixing on Cayley graphs of certain elementary abelian groups.

•Sep 26, 2013•3 citations

Complex Hadamard matrices, instantaneous uniform mixing and cubes

Ada Chan

We study the continuous-time quantum walks on graphs in the adjacency algebra of the n -cube and its related distance regular graphs. For k ≥ 2 , we find graphs in the adjacency algebra of ( 2 k + 2 - 8 ) -cube that admit instantaneous uniform mixing at time π / 2 k and graphs that have perfect state transfer at time π / 2 k . We characterize the folded n -cubes, the halved n -cubes and the folded halved n -cubes whose adjacency algebra contains a complex Hadamard matrix. We obtain the same conditions for the characterization of these graphs admitting instantaneous uniform mixing.

arXiv:1305.5811•Algebraic Combinatorics•Jun 2, 2020•29 citations

Universal Mixing of Quantum Walk on Graphs

William Carlson, Allison For, Elizabeth Marie Harris +3 more

We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph $G$ is {\em universal mixing} if the instantaneous or average probability distribution of the quantum walk on $G$ ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is {\em uniform} mixing if it visits the uniform distribution. Our results include the following: 1) All weighted complete multipartite graphs are instantaneous universal mixing. This is in contrast to the fact that no {\em unweighted} complete multipartite graphs are uniform mixing (except for the four-cycle $K_{2,2}$). 2) For all $n \ge 1$, the weighted claw $K_{1,n}$ is a minimally connected instantaneous universal mixing graph. In fact, as a corollary, the unweighted $K_{1,n}$ is instantaneous uniform mixing. This adds a new family of uniform mixing graphs to a list that so far contains only the hypercubes. 3) Any weighted graph is average almost-uniform mixing unless its spectral type is sublinear in the size of the graph. This provides a nearly tight characterization for average uniform mixing on circulant graphs. 4) No weighted graphs are average universal mixing. This shows that weights do not help to achieve average universal mixing, unlike the instantaneous case. Our proofs exploit the spectra of the underlying weighted graphs and path collapsing arguments.

arXiv:quant-ph/0608044•Quantum Information and Computation•Nov 1, 2007•21 citations

The continuous-time quantum walk on some graphs based on the view of quantum probability

Qi Han, Yaxin Kou, Ning Bai +1 more

In this paper, continuous-time quantum walk is discussed based on the view of quantum probability, i.e. the quantum decomposition of the adjacency matrix A of graph. Regard adjacency matrix A as Hamiltonian which is a real symmetric matrix with elements 0 or 1, so we regard [Formula: see text] as an unbiased evolution operator, which is related to the calculation of probability amplitude. Combining the quantum decomposition and spectral distribution [Formula: see text] of adjacency matrix A, we calculate the probability amplitude reaching each stratum in continuous-time quantum walk on complete bipartite graphs, finite two-dimensional lattices, binary tree, [Formula: see text]-ary tree and [Formula: see text]-fold star power [Formula: see text]. Of course, this method is also suitable for studying some other graphs, such as growing graphs, hypercube graphs and so on, in addition, the applicability of this method is also explained.

International Journal of Quantum Information•Apr 29, 2022•6 citations
We consider the continuous-time quantum walk defined on the adjacency matrix of a graph. At each instant, the walk defines a mixing matrix which is doubly-stochastic. The average of the mixing matrices contains relevant information about the quantum walk and about the graph. We show that it is the matrix of transformation of the orthogonal projection onto the commutant algebra of the adjacency matrix, restricted to diagonal matrices. Using this formulation of the average mixing matrix, we find connections between its rank and automorphisms of the graph.
We study the diagonal entries of the average mixing matrix of continuous quantum walks. The average mixing matrix is a graph invariant; it is the sum of the Schur squares of spectral idempotents of the Hamiltonian. It is non-negative, doubly stochastic and positive semi-definite. We investigate the diagonal entries of this matrix. We study the graphs for which the trace of the average mixing matrix is maximum or minimum and we classify those which are maximum. We give two constructions of graphs whose average mixing matrices have constant diagonal.
Abstract. The adjacency matrix of a graph [Formula: see text] is the Hamiltonian for a continuous-time quantum walk on the vertices of [Formula: see text]. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the behavior of the walk is typically not periodic. In this paper, we develop a theory to exactly study any quantum walk generated by an integral Hamiltonian, and we put emphasis on those with irrational eigenvalues—what we call irrational quantum walks. As a result, we provide exact methods to compute the average of the mixing matrices, and to decide whether pretty good (or almost perfect) state transfer occurs in a given graph. We also use our methods to study geometric properties of beautiful curves arising from entries of the quantum walk matrix and discuss possible applications of these results. Throughout the paper, we emphasize the interplay between different fields of mathematics applied to the study of quantum walks.
In recent years quantum algorithms have become a popular area of mathematical research. Farhi and Gutmann introduced the concept of a quantum walk in 1998. In this thesis we investigate mixing properties of continuous-time quantum walks from a mathematical perspective. We focus on the connections between mixing properties and association schemes. \n \nThere are three main goals of this thesis. Our primary goal is to develop the algebraic groundwork necessary to systematically study mixing properties of continuous-time quantum walks on regular graphs. Using these tools we achieve two additional goals: we construct new families of graphs that admit uniform mixing, and we prove that other families of graphs never admit uniform mixing. \n \nWe begin by introducing association schemes and continuous-time quantum walks. Within this framework we develop specific algebraic machinery to tackle the uniform mixing problem. Our main algebraic result shows that if a graph has an irrational eigenvalue, then its transition matrix has at least one transcendental coordinate at all nonzero times. \n \nNext we study algebraic varieties related to uniform mixing to determine information about the coordinates of the corresponding transition matrices. Combining this with our main algebraic result we prove that uniform mixing does not occur on even cycles or prime cycles. However, we show that the probability distribution of a quantum walk on a prime cycle gets arbitrarily close to uniform. \n \nFinally we consider uniform mixing on Cayley graphs of elementary abelian groups. We utilize graph quotients to connect the mixing properties of these graphs to Hamming graphs. This enables us to find new results about uniform mixing on Cayley graphs of certain elementary abelian groups.
We study the continuous-time quantum walks on graphs in the adjacency algebra of the n -cube and its related distance regular graphs. For k ≥ 2 , we find graphs in the adjacency algebra of ( 2 k + 2 - 8 ) -cube that admit instantaneous uniform mixing at time π / 2 k and graphs that have perfect state transfer at time π / 2 k . We characterize the folded n -cubes, the halved n -cubes and the folded halved n -cubes whose adjacency algebra contains a complex Hadamard matrix. We obtain the same conditions for the characterization of these graphs admitting instantaneous uniform mixing.
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph GGG is {\em universal mixing} if the instantaneous or average probability distribution of the quantum walk on GGG ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is {\em uniform} mixing if it visits the uniform distribution. Our results include the following: 1) All weighted complete multipartite graphs are instantaneous universal mixing. This is in contrast to the fact that no {\em unweighted} complete multipartite graphs are uniform mixing (except for the four-cycle K2,2K_{2,2}K2,2​). 2) For all n≥1n \ge 1n≥1, the weighted claw K1,nK_{1,n}K1,n​ is a minimally connected instantaneous universal mixing graph. In fact, as a corollary, the unweighted K1,nK_{1,n}K1,n​ is instantaneous uniform mixing. This adds a new family of uniform mixing graphs to a list that so far contains only the hypercubes. 3) Any weighted graph is average almost-uniform mixing unless its spectral type is sublinear in the size of the graph. This provides a nearly tight characterization for average uniform mixing on circulant graphs. 4) No weighted graphs are average universal mixing. This shows that weights do not help to achieve average universal mixing, unlike the instantaneous case. Our proofs exploit the spectra of the underlying weighted graphs and path collapsing arguments.
In this paper, continuous-time quantum walk is discussed based on the view of quantum probability, i.e. the quantum decomposition of the adjacency matrix A of graph. Regard adjacency matrix A as Hamiltonian which is a real symmetric matrix with elements 0 or 1, so we regard [Formula: see text] as an unbiased evolution operator, which is related to the calculation of probability amplitude. Combining the quantum decomposition and spectral distribution [Formula: see text] of adjacency matrix A, we calculate the probability amplitude reaching each stratum in continuous-time quantum walk on complete bipartite graphs, finite two-dimensional lattices, binary tree, [Formula: see text]-ary tree and [Formula: see text]-fold star power [Formula: see text]. Of course, this method is also suitable for studying some other graphs, such as growing graphs, hypercube graphs and so on, in addition, the applicability of this method is also explained.