相关论文: The Hidden Subgroup Problem in Affine Groups: Basi…

Let $\mathscr{F}$ be a formation and $G$ a finite group. The weak norm of a subgroup $H$ in $G$ with respect to $\mathscr{F}$ is defined by $N_{\mathscr{F}}(G,H)=\underset{T\leq H}{\bigcap}N_G(T^{\mathscr{F}})$. In particular,…

We design a quantum method for classical information compression that exploits the hidden subgroup quantum algorithm. We consider sequence data in a database with a priori unknown symmetries of the hidden subgroup type. We prove that data…

Let G be a connected reductive group defined over an algebraically closed field k of characteristic p > 0. The purpose of this paper is two-fold. First, when p is a good prime, we give a new proof of the ``order formula'' of D. Testerman…

High-dimensional feature selection is routinely required to balance statistical power with strict control of multiple-error metrics such as the k-Family-Wise Error Rate (k-FWER) and the False Discovery Proportion (FDP), yet some existing…

The main goal is to interpret the Askey-Wilson function and the corresponding transform pair on the quantum SU(1,1) group. A weight on the C^*-algebra of continuous functions vanishing at infinity on the quantum SU(1,1) group is studied,…

Group testing tackles the problem of identifying a population of $K$ defective items from a set of $n$ items by pooling groups of items efficiently in order to cut down the number of tests needed. The result of a test for a group of items…

Difference sets are basic combinatorial structures that have applications in signal processing, coding theory, and cryptography. We consider the problem of identifying a shifted version of the characteristic function of a (known) difference…

We study norm convergence and summability of Fourier series in the setting of reduced twisted group $C^*$-algebras of discrete groups. For amenable groups, F{\o}lner nets give the key to Fej\'er summation. We show that Abel-Poisson…

A quantum processor (QuP) can be used to exploit quantum mechanics to find the prime factors of composite numbers[1]. Compiled versions of Shor's algorithm have been demonstrated on ensemble quantum systems[2] and photonic systems[3-5],…

We investigate a generalization of Hopf algebra $\mathfrak{sl}_{q}(2)$ by weakening the invertibility of the generator $K$, i.e. exchanging its invertibility $KK^{-1}=1$ to the regularity $K\overline{K}K=K$. This leads to a weak Hopf…

We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a…

For $p>0$ a small parameter, let $\mathcal A \subseteq \mathbb{Z}_{>0}$ be a random subset where each positive integer is included independently with probability $p$. We show that, with high probability (as $p \to 0$), the numerical…

A key issue of current quantum advantage experiments is that their verification requires a full classical simulation of the ideal computation. This limits the regime in which the experiments can be verified to precisely the regime in which…

To address the issue of excessive quantum resource requirements in Kuperberg's algorithm for the dihedral hidden subgroup problem, this paper proposes a distributed algorithm based on the function decomposition. By splitting the original…

The properties of Hopf star operations and twisted Hopf stars operations on quantum groups are discussed in relation with the theory of representations (star representations). Invariant Hermitian sesquilinear forms (scalar products) on…

The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in $n^{\log n+O(1)}$ time, but only recently were polynomial-time algorithms designed for several interesting group classes. Inspired by recent…

The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…

We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…

This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models. - In the classical generic group model (GGM), we find simple alternative proofs for the…

Let G be a connected and reductive algebraic group over an algebraically closed field of characteristic p > 0. An interesting class of representations of G consists of those G-modules having a good filtration -- i.e. a filtration whose…