相关论文: Control-target inversion property on Abelian group…

The notion of Fourier transform is among the more important tools in analysis, which has been generalized in abstract harmonic analysis to the level of abelian locally compact groups. The aim of this paper is to further generalize the…

A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…

In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…

In the context of finite Abelian groups two problems are presented and solved using quantum computing techniques. The first is the well--known Hidden Subgroup Problem, originally solved by Simon in a landmark work. The second is the Fully…

We consider a perturbation of an ``integrable'' Hamiltonian and give an expression for the canonical or unitary transformation which ``simplifies'' this perturbed system. The problem is to invert a functional defined on the Lie- algebra of…

By the Fourier transformations, any group-invariant functions over finite Abelian groups are transformed into group-invariant functions over the character groups. In this paper, we calculate matrix elements of this transformations under…

Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…

Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…

Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodicity. The fact that Fourier transforms can also be used to…

The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…

Classical and recent results on uncertainty principles for functions on finite Abelian groups relate the cardinality of the support of a function to the cardinality of the support of its Fourier transforms. We use these results and their…

Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we focus on the quantum Fourier transform and the structures in quantum theory that enable it. We elucidate a general…

Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…

Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…

The hidden shift problem is a natural place to look for new separations between classical and quantum models of computation. One advantage of this problem is its flexibility, since it can be defined for a whole range of functions and a…

In this work we define operator-valued Fourier transforms for suitable integrable elements with respect to the Plancherel weight of a (not necessarily Abelian) locally compact group. Our main result is a generalized version of the Fourier…

Attempts to separate the power of classical and quantum models of computation have a long history. The ultimate goal is to find exponential separations for computational problems. However, such separations do not come a dime a dozen: while…

In this paper we consider a generalization of quantum hash functions for arbitrary groups. We show that quantum hash function exists for arbitrary abelian group. We construct a set of "good" automorphisms --- a key component of quantum hash…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

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…