Related papers: Strong Fourier Sampling Fails over $G^n$

The optimization of measurements for the state distinction problem has recently been applied to the theory of quantum algorithms with considerable successes, including efficient new quantum algorithms for the non-abelian hidden subgroup…

We show that (with one possible exception) there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski dense.…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

Boson Sampling has emerged as a tool to explore the advantages of quantum over classical computers as it does not require a universal control over the quantum system, which favours current photonic experimental platforms.Here, we introduce…

In this paper we discuss the existence of certain classes of cuspidal automorphic representations having non-zero Fourier coefficients for general semisimple algebraic group $G$ defined over a number field $k$ such that its Archimedean…

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

We show that a K-approximate subgroup A of a residually nilpotent group G is contained in boundedly many cosets of a finite-by-nilpotent subgroup, the nilpotent factor of which is of bounded step. Combined with an earlier result of the…

We study the distribution of the Galois group of a random $q$-additive polynomial over a rational function field: For $q$ a power of a prime $p$, let $f=X^{q^n}+a_{n-1}X^{q^{n-1}}+\ldots+a_1X^q+a_0X$ be a random polynomial chosen uniformly…

In analogy with epsilon-biased sets over Z_2^n, we construct explicit epsilon-biased sets over nonabelian finite groups G. That is, we find sets S subset G such that | Exp_{x in S} rho(x)| <= epsilon for any nontrivial irreducible…

A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that…

In this paper we describe some properties of groups $G$ that contain a solvable subgroup of finite prime-power index (Theorem 1 and Corollaries 2--3). We prove that if $G$ is a non-solvable group that contains a solvable subgroup of index…

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

We begin an investigation of supersymmetric theories based on exceptional groups. The flat directions are most easily parameterized using their correspondence with gauge invariant polynomials. Symmetries and holomorphy tightly constrain the…

Identifying the symmetry properties of quantum states is a central theme in quantum information theory and quantum many-body physics. In this work, we investigate quantum learning problems in which the goal is to identify a hidden symmetry…

Non-parametric tests based on permutation, rotation or sign-flipping are examples of group-invariance tests. These tests test invariance of the null distribution under a set of transformations that has a group structure, in the algebraic…

The hidden subgroup problem ($\mathsf{HSP}$) has been attracting much attention in quantum computing, since several well-known quantum algorithms including Shor algorithm can be described in a uniform framework as quantum methods to address…

We show that within any strong orbit equivalent class, there exist minimal subshifts with arbitrarily low superlinear complexity. This is done by proving that for any simple dimension group with unit $(G,G^+,u)$ and any sequence of positive…

Let $v$ be a product of at most three not necessarily distinct primes. We prove that there exists no strong external difference family with more than two subsets in abelian group $G$ of order $v$, except possibly when $G=C_p^3$ and $p$ is a…

We give an affirmative answer to the Grunwald problem for new families of non-solvable finite groups G, away from the set of primes dividing |G|. Furthermore, we show that such G verify the condition (BM), that is, the Brauer-Manin…

The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…