Quantum Hidden Subgroup Algorithm
The Quantum Hidden Subgroup Algorithm is a quantum algorithm that belongs to the class of algorithms designed to solve hidden subgroup problems by leveraging quantum superposition and entanglement to efficiently determine a hidden subgroup of a given group through Fourier sampling, distinguishing it from classical approaches by achieving exponential or polynomial speedup in specific instances.
63
Publications
3.4K
Citations
66
Authors
47
Institutions
Publications per year
2017–2026
1
Variants
Hidden Subgroup Algorithm
Parents
63
Quantum Computation and Lattice Problems
Oded Regev · SIAM Journal on Computing · 2004 · 197 citations
Hidden translation and orbit coset in quantum computing
Katalin Friedl, Gábor Ivanyos, Frédéric Magniez et al. · 2003 · 145 citations
1–5 of 63
66
University of North Carolina at Chapel Hill, United States
7 publications · 354 citations
7
h-index
7
h-index
7
h-index
6
h-index
6
h-index
1–5 of 66
47
California Institute of Technology
Pasadena, United States
9 h-index
9 publications
612 citations

Hungarian Academy of Sciences
Budapest, Hungary
7 h-index
9 publications
489 citations
University of California, Berkeley
Berkeley, United States
6 h-index
7 publications
526 citations

University of Waterloo
Waterloo, Canada
6 h-index
8 publications
464 citations
University of California, Davis
Davis, United States
4 h-index
4 publications
512 citations
University of California, Santa Barbara
Santa Barbara, United States
4 h-index
4 publications
376 citations
Université Paris-Sud
Orsay, France
4 h-index
10 publications
709 citations

Tata Institute of Fundamental Research
Mumbai, India
3 h-index
4 publications
187 citations
1–8 of 47
QIC · 7 publications · 108 citations
7
h-index
Repository · 6 publications · 143 citations
6
h-index
Repository · 5 publications · 167 citations
5
h-index
5 publications · 807 citations
5
h-index
Repository · 2 publications · 104 citations
2
h-index
1–5