Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups

Hari Krovi, Martin Rötteler

Published Jan 1, 2008• 12 citations
Publisher
DOI
10.1007/978-3-540-89994-5_7

Related papers

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups

Gábor Ivanyos, Luc Sanselme, Miklós Sántha

arXiv:quant-ph/0701235•Lecture notes in computer science•Jan 1, 2007•24 citations

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups

Gábor Ivanyos, Luc Sanselme, Miklós Sántha

Algorithmica•Nov 5, 2010•16 citations

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups

Gábor Ivanyos, Luc Sanselme, Miklós Sántha

Lecture notes in computer science•Jan 1, 2008•37 citations

Quantum Algorithms for the Hidden Subgroup Problem over Semidirect Product Groups of Cyclic Groups

Yoshifumi Inui, Le Francois

IEICE Technical Report; IEICE Tech. Rep.•Apr 11, 2005•0 citations

Quantum mechanical algorithms for the nonabelian hidden subgroup problem

Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani +1 more

We provide positive and negative results concerning the “standard method” of identifying a hidden subgroup of a nonabelian group using a quantum computer.

ACM Symposium on Theory of Computing (STOC)•Jul 6, 2001•124 citations

An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups

Hari Krovi, Martin Roetteler

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.

arXiv:0810.3695•Oct 20, 2008•1 citation
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.