Related papers: How symmetric is too symmetric for large quantum s…

Permutation equivariant neural networks are typically used to learn from data that lives on a graph. However, for any graph $G$ that has $n$ vertices, using the symmetric group $S_n$ as its group of symmetries does not take into account the…

We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…

For a set of quantum states generated by the action of a group, we consider the graph obtained by considering two group elements adjacent whenever the corresponding states are non-orthogonal. We analyze the structure of the connected…

In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph…

We consider the amenability of groupoids $G$ equipped with a group valued cocycle $c:G\to Q$ with amenable kernel $c^{-1}(e)$. We prove a general result which implies, in particular, that $G$ is amenable whenever $Q$ is amenable and if…

Quantum states can in a sense be thought of as generalizations of classical probability distributions, but are more powerful than probability distributions when used for computation or communication. Quantum speedup therefore requires some…

We show that the hitting time of the discrete quantum walk on a symmetric Cayley graph over $\Z_2^n $ from a vertex to its antipodal is polynomial in degree of the graph. We prove that returning time of quantum walk on a symmetric Cayley…

Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information…

It is known since the work of [AA14] that for any permutation symmetric function $f$, the quantum query complexity is at most polynomially smaller than the classical randomized query complexity, more precisely that $R(f) =…

Let k be an algebraically closed field of characteristic p>0 and C a connected nonsingular projective curve over k with genus g>1. Let (C,G) be a "big action", i.e. a pair (C,G) where G is a p-subgroup of the k-automorphism group of C such…

We disprove a strong form of the Regular Inverse Galois Problem: there exist finite groups $G$ which do not have a realization $F/\Qq(T)$ that induces all Galois extensions $L/\Qq(U)$ of group $G$ by specializing $T$ to $f(U) \in \Qq(U)$.…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

A graph $G$ on $n$ vertices is a \emph{threshold graph} if there exist real numbers $a_1,a_2, \ldots, a_n$ and $b$ such that the zero-one solutions of the linear inequality $\sum \limits_{i=1}^n a_i x_i \leq b$ are the characteristic…

In this paper we give an improvement of the degree of the homogeneous linear recurrence with integer coefficients that exponential sums of symmetric Boolean functions satisfy. This improvement is tight. We also compute the asymptotic…

In this paper, we explore quantum interference in molecular conductance from the point of view of graph theory and walks on lattices. By virtue of the Cayley-Hamilton theorem for characteristic polynomials and the Coulson-Rushbrooke pairing…

Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…

Let Phi : M --> g^* be a proper moment map associated to an action of a compact connected Lie group, G, on a connected symplectic manifold, (M,\omega). A collective function is a pullback via \Phi of a smooth function on g^*. In this paper…

We prove the following conjecture, raised by Aaronson and Ambainis in 2008: Let $f:\{-1,1\}^n \rightarrow [-1,1]$ be a multilinear polynomial of degree $d$. Then there exists a variable $x_i$ whose influence on $f$ is at least…

We prove a number of results to the effect that generic quantum graphs (defined via operator systems as in the work of Duan-Severini-Winter / Weaver) have few symmetries: for a Zariski-dense open set of tuples $(X_1,\cdots,X_d)$ of…

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…