Related papers: Quantum Query Complexity of the Hyperoctahedral Gr…
We describe a method to upper bound the quantum query complexity of Boolean formula evaluation problems, using fundamental theorems about the general adversary bound. This nonconstructive method can give an upper bound on query complexity…
In this paper, we give a combinatorial rule to calculate the decomposition of the tensor product (Kronecker product) of two irreducible complex representations of the symmetric group ${\mathfrak S}_n$, when one of the representations…
We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…
We study the intermediate liberation problem for the real and complex unitary and reflection groups, namely $O_N,U_N,H_N,K_N$. For any of these groups $G_N$, the problem is that of understanding the structure of the intermediate quantum…
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. We consider three query models. In the first model ("OR queries"), the oracle returns whether a given subset of the vertices contains any…
Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that…
We give an exposition of the hidden subgroup problem for dihedral groups from the point of view of the standard hidden subgroup quantum algorithm for finite groups. In particular, we recall the obstructions for strong Fourier sampling to…
We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…
The hyperoctahedral group $H_N$ is known to have two natural liberations: the "good" one $H_N^+$, which is the quantum symmetry group of $N$ segments, and the "bad" one $\bar{O}_N$, which is the quantum symmetry group of the $N$-hypercube.…
This paper examines the representations of hyperbolic integral homology spheres into the binary icosahedral group $2I$. We specifically give a geometric meaning to $2I$ representations by relating them to Larsen's notion of quotient…
As a sequel to [14], in this article we first introduce a so-called duplex Hecke algebras of type B which is a Q(q)-algebra associated with the Weyl group W (B) of type B, and symmetric groups S_l for l = 0, 1, . . . ,m, satisfying some…
Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…
The classification of the unitary irreducible representations of symmetry groups is a cornerstone of modern quantum physics, as it provides the fundamental building blocks for constructing the Hilbert spaces of theories admitting these…
We show that quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the…
One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve the problem. In this paper, we present general bounds for…
We study irreducible spherical unitary representations of the Drinfeld double of a $q$-deformation of a connected simply connected compact Lie group, which can be considered as a quantum analogue of the complexification of the Lie group. In…
We show that any quantum algorithm deciding whether an input function $f$ from $[n]$ to $[n]$ is 2-to-1 or almost 2-to-1 requires $\Theta(n)$ queries to $f$. The same lower bound holds for determining whether or not a function $f$ from…
An ordered biclique partition of the complete graph $K_n$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_n$ is covered by at least one and at most two bicliques in the…
The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…
We introduce a structured quantum search algorithm that leverages entanglement maps and a fixed-point method to minimize oracle query complexity in unsorted datasets. By partitioning qubits into rows based on their entanglement order, the…