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

DOI10.1007/978-3-540-89994-5_7zbMath1178.81038OpenAlexW1558222364MaRDI QIDQ5504566

Hari Krovi, Martin Roetteler

Publication date: 22 January 2009

Published in: Mathematical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89994-5_7

zbMATH Keywords

quantum algorithmshidden subgroup problemcoset states

Mathematics Subject Classification ID

Quantum computation (81P68) Finite-dimensional groups and algebras motivated by physics and their representations (81R05) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ The independence of reduced subgroup-state ⋮ On the construction of discrete orthonormal Gabor bases on finite dimensional spaces ⋮ Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations ⋮ A universal identifier for communication channels ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups

This page was built for publication: An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups