• Quick access
  • Homepage (fr)
  • International
  • François's Blog
  • Frédéric's Blog
  • Maths (fr)
  • Computer Science (fr)
  • Programming (fr)
  • Our games (fr)
  • Video games (fr)
• Special pages
  • Log in (fr)
  • Forum
  • Authors (fr)
  • Site Map (fr)
• Parent directories
  • International
  • The Hidden Subgroup Problem
  • Index
• Current directory
  • Index
  • Report
  • Introduction
  • Prerequisites
  • Efficient Quantum Algorithms and The Hidden Subgroup Problem
  • The Standard Method for The Hidden Subgroup Problem
  • The Dihedral and Symmetric Hidden Subgroup Problems
  • The General Hidden Subgroup Problem
  • Conclusion
  • Appendix A
  • Appendix B
  • Appendix C
  • Appendix D
  • Appendix E
  • Appendix F
  • Appendix G
  • Bibliography

The Hidden Subgroup Problem

• Short Abstract (txt)
• Report (XHTML)
• Report (pdf)
• Slides for the Oral Defense

Some blog entries on this subject that I wrote after the publication of my master thesis:

• Two Open Problems for the Subgroup-Reduction based Dedekindian HSP Algorithm:
  1. Can my algorithm work for the Hamiltonian HSP i.e. over non-abelian dedekindian groups?
  2. Is my algorithm more efficient than the standard Dedekindian HSP?
• Regarding generalization of the subgroup reduction for simple groups, I gave some reflexion on Maximal Subgroup Reduction and HSP over Projective Linear Groups and related it to an existing algorithm by Denney, Moore and Russell.
• I conjectured that the answer to the second question is negative and proved this assertion in the cyclic case: Cyclic HSP based on Subgroup Reduction.

This page is W3C-compliant - Author: Frédéric WANG