Related papers: The Hidden Subgroup Problem in Affine Groups: Basi…

We describe a novel type of weak cryptographic private key that can exist in any discrete logarithm based public-key cryptosystem set in a group of prime order $p$ where $p-1$ has small divisors. Unlike the weak private keys based on…

We experimentally demonstrate quantum data compression exploiting hidden subgroup symmetries using a photonic quantum processor. Classical databases containing generalized periodicities-symmetries that are in the worst cases inefficient for…

Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a…

For any finite group $G$, any transitive $G$-set $X$ and any field ${\Bbb F}$, we consider the vector space ${\Bbb F}^X$ of all functions from $X$ to ${\Bbb F}$, which is a $G$-space isomorphic to the permutation ${\Bbb F} G$-module ${\Bbb…

This paper introduces a completely new approach to encryption based on group theoretic quantum framework. Quantum cryptography has essentially focused only on key distribution and proceeded with classical encryption algorithm with the…

The search for elliptic quantum groups leads to a modified quantum Yang-Baxter relation and to a special class of quasi-triangular quasi Hopf algebras. This paper calculates deformations of standard quantum groups (with or without spectral…

Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor polynomial time algorithm for numerical field problems like…

For a finite-index $\mathrm{II}_1$ subfactor $N \subset M$, we prove the existence of a universal Hopf $\ast$-algebra (or, a discrete quantum group in the analytic language) acting on $M$ in a trace-preserving fashion and fixing $N$…

Gibbs sampling from continuous real-valued functions is a challenging problem of interest in machine learning. Here we leverage quantum Fourier transforms to build a quantum algorithm for this task when the function is periodic. We use the…

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…

How can we take inspiration from a typical quantum algorithm to design heuristics for machine learning? A common blueprint, used from Deutsch-Josza to Shor's algorithm, is to place labeled information in superposition via an oracle,…

We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…

We study the problem of subgroup discovery for survival analysis, where the goal is to find an interpretable subset of the data on which a Cox model is highly accurate. Our work is the first to study this particular subgroup problem, for…

This paper is concerned with the subduction problem of type A quantum Iwahori-Hecke algebras $\mathbb{C} \mathbf{H}(\mathfrak{S}_f,q^2)$ with a real deformation parameter $q$, i.e. the problem of decomposing irreducible representations of…

Let $P$ be a generalized laplacian on $R^{2n+1}$. It is known that $P$ is the generating functional of semigroups of measures $\mu_{t}$ on the Heisenberg group $H^{n}$ and $\nu_{t}$ on the Abelian group $R^{2n+1}$. Under some smoothness and…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

The framework of this thesis is fault-tolerant quantum algorithms. Grover's algorithm and quantum walks are described in Chapter 2. We start by highlighting the central role that rotations play in quantum algorithms, explaining Grover's,…

In arXiv:1210.3178 it was shown that subgroup depth may be computed from the permutation module of the left or right cosets: this holds more generally for a Hopf subalgebra, from which we note in this paper that finite depth of a Hopf…

We consider semigroup algorithmic problems in the Special Affine group $\mathsf{SA}(2, \mathbb{Z}) = \mathbb{Z}^2 \rtimes \mathsf{SL}(2, \mathbb{Z})$, which is the group of affine transformations of the lattice $\mathbb{Z}^2$ that preserve…

The problem of computing the optimum of a function on a finite set is an important problem in mathematics and computer science. Many combinatorial problems such as MAX-SAT and MAXCUT can be recognized as optimization problems on the…