Related papers: The Hidden Subgroup Problem in Affine Groups: Basi…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
This paper continues an earlier work on the structure of solutions to two classes of functional equation. Let $Z$ be a compact Abelian group and $U_1$, \ldots, $U_k \leq Z$ be closed subgroups. Given $f:Z\to\mathbb{T}$ and $w \in Z$, one…
We study quantum algorithms for the hidden shift problem of complex scalar- and vector-valued functions on finite abelian groups. Given oracle access to a shifted function and the Fourier transform of the unshifted function, the goal is to…
A subgroup $A$ of a finite group $G$ is said to be a $CAP$-subgroup of $G$, if for any chief factor $H/K$ of $G$, either $A H= AK$ or $A\cap H = A \cap K$. Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion…
Property testing has been a major area of research in computer science in the last three decades. By property testing we refer to an ensemble of problems, results and algorithms which enable to deduce global information about some data by…
We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their decision problem in the quantum and for their testing problem in the classical…
The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…
The state hidden subgroup problem (StateHSP) is a recent generalization of the hidden subgroup problem. We present an algorithm that solves the non-abelian StateHSP over $N$ copies of the dihedral group of order $8$ (the symmetries of a…
We introduce two new classes of fusion categories which are obtained by a certain procedure from finite groups - weakly group-theoretical categories and solvable categories. These are fusion categories that are Morita equivalent to iterated…
Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d. with some known marginal distribution $A_{ij}\sim P_0$, or instead $A$ contains a principal submatrix $A_{{\sf…
For any $m \ge 1$ and odd prime power $\mathtt{q}=\mathtt{p}^m$, for $\mathtt{q}=2$, and for any $n \ge 1$, we show a result of decomposition for Pauli groups $\mathcal{P}_{n,\mathtt{q}}$ in terms of weak central products. This can be used…
As networks continue to increase in size, current methods must be capable of handling large numbers of nodes and edges in order to be practically relevant. Instead of working directly with the entire (large) network, analyzing sub-networks…
The Quantitative Group Testing (QGT) is about learning a (hidden) subset $K$ of some large domain $N$ using a sequence of queries, where a result of a query provides information about the size of the intersection of the query with the…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
Models for topological quantum computation are based on braiding and fusing anyons (quasiparticles of fractional statistics) in (2+1)-D. The anyons that can exist in a physical theory are determined by the symmetry group of the Hamiltonian.…
The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
We investigate refined algebraic quantisation with group averaging in a constrained Hamiltonian system whose gauge group is the connected component of the lower triangular subgroup of SL(2,R). The unreduced phase space is T^*R^{p+q} with…
Quantum Fourier transformations are an essential component of many quantum algorithms, from prime factoring to quantum simulation. While the standard abelian QFT is well-studied, important variants corresponding to \emph{nonabelian} groups…
Simon's problem plays an important role in the history of quantum algorithms, as it inspired Shor to discover the celebrated quantum algorithm solving integer factorization in polynomial time. Besides, the quantum algorithm for Simon's…