2,967 research outputs found
Fast Quantum Fourier Transforms for a Class of Non-abelian Groups
An algorithm is presented allowing the construction of fast Fourier
transforms for any solvable group on a classical computer. The special
structure of the recursion formula being the core of this algorithm makes it a
good starting point to obtain systematically fast Fourier transforms for
solvable groups on a quantum computer. The inherent structure of the Hilbert
space imposed by the qubit architecture suggests to consider groups of order
2^n first (where n is the number of qubits). As an example, fast quantum
Fourier transforms for all 4 classes of non-abelian 2-groups with cyclic normal
subgroup of index 2 are explicitly constructed in terms of quantum circuits.
The (quantum) complexity of the Fourier transform for these groups of size 2^n
is O(n^2) in all cases.Comment: 16 pages, LaTeX2
Hidden Translation and Translating Coset in Quantum Computing
We give efficient quantum algorithms for the problems of Hidden Translation
and Hidden Subgroup in a large class of non-abelian solvable groups including
solvable groups of constant exponent and of constant length derived series. Our
algorithms are recursive. For the base case, we solve efficiently Hidden
Translation in , whenever is a fixed prime. For the induction
step, we introduce the problem Translating Coset generalizing both Hidden
Translation and Hidden Subgroup, and prove a powerful self-reducibility result:
Translating Coset in a finite solvable group is reducible to instances of
Translating Coset in and , for appropriate normal subgroups of
. Our self-reducibility framework combined with Kuperberg's subexponential
quantum algorithm for solving Hidden Translation in any abelian group, leads to
subexponential quantum algorithms for Hidden Translation and Hidden Subgroup in
any solvable group.Comment: Journal version: change of title and several minor update
Self-adjoint symmetry operators connected with the magnetic Heisenberg ring
We consider symmetry operators a from the group ring C[S_N] which act on the
Hilbert space H of the 1D spin-1/2 Heisenberg magnetic ring with N sites. We
investigate such symmetry operators a which are self-adjoint (in a sence
defined in the paper) and which yield consequently observables of the
Heisenberg model. We prove the following results: (i) One can construct a
self-adjoint idempotent symmetry operator from every irreducible character of
every subgroup of S_N. This leads to a big manifold of observables. In
particular every commutation symmetry yields such an idempotent. (ii) The set
of all generating idempotents of a minimal right ideal R of C[S_N] contains one
and only one idempotent which ist self-adjoint. (iii) Every self-adjoint
idempotent e can be decomposed into primitive idempotents e = f_1 + ... + f_k
which are also self-adjoint and pairwise orthogonal. We give a computer
algorithm for the calculation of such decompositions. Furthermore we present 3
additional algorithms which are helpful for the calculation of self-adjoint
operators by means of discrete Fourier transforms of S_N. In our investigations
we use computer calculations by means of our Mathematica packages PERMS and
HRing.Comment: 13 page
Symmetry-based matrix factorization
AbstractWe present a method for factoring a given matrix M into a short product of sparse matrices, provided that M has a suitable “symmetry”. This sparse factorization represents a fast algorithm for the matrix–vector multiplication with M. The factorization method consists of two essential steps. First, a combinatorial search is used to compute a suitable symmetry of M in the form of a pair of group representations. Second, the group representations are decomposed stepwise, which yields factorized decomposition matrices and determines a sparse factorization of M. The focus of this article is the first step, finding the symmetries. All algorithms described have been implemented in the library AREP. We present examples for automatically generated sparse factorizations—and hence fast algorithms—for a class of matrices corresponding to digital signal processing transforms including the discrete Fourier, cosine, Hartley, and Haar transforms
Geometric Theory of the Recursion Operators for the Generalized Zakharov-Shabat System in Pole Gauge on the Algebra sl(n,C)
We consider the recursion operator approach to the soliton equations related
to the generalized Zakharov-Shabat system on the algebra sl(n,C) in pole gauge
both in the general position and in the presence of reductions. We present the
recursion operators and discuss their geometric meaning as conjugate to
Nijenhuis tensors for a Poisson-Nijenhuis structure defined on the manifold of
potentials
SU(2) and SU(1,1) Approaches to Phase Operators and Temporally Stable Phase States: Applications to Mutually Unbiased Bases and Discrete Fourier Transforms
We propose a group-theoretical approach to the generalized oscillator algebra
Ak recently investigated in J. Phys. A: Math. Theor. 43 (2010) 115303. The case
k > or 0 corresponds to the noncompact group SU(1,1) (as for the harmonic
oscillator and the Poeschl-Teller systems) while the case k < 0 is described by
the compact group SU(2) (as for the Morse system). We construct the phase
operators and the corresponding temporally stable phase eigenstates for Ak in
this group-theoretical context. The SU(2) case is exploited for deriving
families of mutually unbiased bases used in quantum information. Along this
vein, we examine some characteristics of a quadratic discrete Fourier transform
in connection with generalized quadratic Gauss sums and generalized Hadamard
matrices
- …