Related papers: Quantum hashing. Group approach
In this expository article we present an overview of the current state-of-the-art in post-quantum group-based cryptography. We describe several families of groups that have been proposed as platforms, with special emphasis in polycyclic…
In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including…
Let G be a group and let A be the algebra of complex functions on G with finite support. The product in G gives rise to a coproduct on A making it a multiplier Hopf algebra. In fact, because there exist integrals, we get an algebraic…
We quantize spherically symmetric electrovacuum gravity. The algebra of Hamiltonian constraints can be made Abelian via a rescaling and linear combination with the diffeomorphism constraint. As a result the constraint algebra is a true Lie…
Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…
The method of group quantization described in the preceeding paper I is extended so that it becomes applicable to some parametrized systems that do not admit a global transversal surface. A simple completely solvable toy system is studied…
One-way functions are fundamental to classical cryptography and their existence remains a longstanding problem in computational complexity theory. Recently, a provable quantum one-way function has been identified, which maintains its…
In this paper we provide a method for constructing joint distributions for an arbitrary set of observables on finite dimensional Hilbert spaces irrespective of whether the observables commute or not. These distributions have a number of…
The final version of a new approach to quantum theory is formulated in this paper. The basis is taken to be theoretical variables, variables that may be accessible or inaccessible, i.e., it may be possible or impossible for an observer to…
We give an accessible and modern description of the automorphisms of a finite abelian group $G$. Included is an explicit formula for the cardinality of $Aut(G)$.
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
We isolate a large class of self-adjoint operators H whose essential spectrum is determined by their behavior at large x and we give a canonical representation of their essential spectrum in terms of spectra of limits at infinity of…
Quantum Hamilton-Jacobi quantization scheme uses the singularity structure of the potential of a quantum mechanical system to generate its eigenspectrum and eigenfunctions, and its efficacy has been demonstrated for several well known…
We present the view of quantum algorithms as a search-theoretic problem. We show that the Fourier transform, used to solve the Abelian hidden subgroup problem, is an example of an efficient elimination observable which eliminates a constant…
We consider Knapp-Vogan Hecke algebras in the quantum group setting. This allows us to produce a quantum analogue of the Bernstein functor as a first step towards the cohomological induction for quantum groups.
Consider the following generalized hidden shift problem: given a function f on {0,...,M-1} x Z_N satisfying f(b,x)=f(b+1,x+s) for b=0,1,...,M-2, find the unknown shift s in Z_N. For M=N, this problem is an instance of the abelian hidden…
Encoding classical data into quantum states is considered a quantum feature map to map classical data into a quantum Hilbert space. This feature map provides opportunities to incorporate quantum advantages into machine learning algorithms…
The space of quantum Hamiltonians has a natural partition in classes of operators that can be adiabatically deformed into each other. We consider parametric families of Hamiltonians acting on a bi-partite quantum state-space. When the…