Skip to search formSkip to main contentSkip to account menu

Hidden subgroup problem

Known as: HSP, Hidden subgroup 
The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. The framework captures problems like… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
With quantum computers and clever quantum algorithms, an enormous step forward can be taken in computing; Processes can be… 
2010
2010
  • Julia T. Upton
  • 2010
  • Corpus ID: 12912192
The hidden subgroup problem is a pivotal problem in quantum computation since it reflects the structure of tasks for which… 
2008
2008
We prove that the following properties of a locally compact Abelian group X are equivalent: (i) for any compact Corwin subgroup K… 
2007
2007
Groups, in which every subgroup containing some fixed primary cyclic subgroup has a complement, are investigated. 
2007
2007
The optimization of measurements for the state distinction problem has recently been applied to the theory of quantum algorithms… 
2006
2006
The central issue of the hidden subgroup problem (HSP) is to b ound the number of identical copies of coset states necessary to… 
2006
2006
We show that several problems that figure prominently in quantum computing, including Hidden Coset, Hidden Shift, and Orbit Coset… 
2004
2004
We provide positive and negative results concerning the “standard method” of identifying a hidden subgroup of a nonabelian group… 
2000
2000
The Hidden Subgroup Problem (HSP) provides the fundamental framework for most quantum algorithms. Until very recently, all known… 
1992
1992
The theory of fuzzy sets was inspired by Zadeh [10]. Subsequently, Rosenfeld introduced the concept of a fuzzy subgroup of a…