Physics – Quantum Physics
Scientific paper
2008-10-20
Physics
Quantum Physics
20 pages, 1 figure
Scientific paper
Many exponential speedups that have been achieved in quantum computing are obtained via hidden subgroup problems (HSPs). We show that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer. These groups are well-known in physics and play an important role in the theory of quantum error-correcting codes. Our algorithm is based on non-commutative Fourier analysis of coset states which are quantum states that arise from a given black-box function. We use Clebsch-Gordan decompositions to combine and reduce tensor products of irreducible representations. Furthermore, we use a new technique of changing labels of irreducible representations to obtain low-dimensional irreducible representations in the decomposition process. A feature of the presented algorithm is that in each iteration of the algorithm the quantum computer operates on two coset states simultaneously. This is an improvement over the previously best known quantum algorithm for these groups which required four coset states.
Krovi Hari
Roetteler Martin
No associations
LandOfFree
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-572290