Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases

DOI10.1016/j.physleta.2006.06.014zbMath1236.81064OpenAlexW2070092389MaRDI QIDQ942549

Soojoon Lee, Jeong San Kim, Dong Pyo Chi

Publication date: 5 September 2008

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physleta.2006.06.014

zbMATH Keywords

quantum algorithmhidden subgroup problemsemi-direct product group

Mathematics Subject Classification ID

Quantum computation (81P68) Structure and classification of infinite or finite groups (20E99)

Related Items (2)

The independence of reduced subgroup-state ⋮ Quantum algorithm design: techniques and applications

Cites Work

• Unnamed Item
• The quantum query complexity of the hidden subgroup problem is polynomial
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• On quantum algorithms for noncommutative hidden subgroups

This page was built for publication: Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases