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

Authors

66

  1. PK
    Pranab Kumar Sen

    University of North Carolina at Chapel Hill, United States

    7 publications · 354 citations

    7

    h-index

  2. SH
    Sean Hallgren

    Pennsylvania State University, United States

    7 publications · 527 citations

    7

    h-index

  3. AM
    Andrew M. Childs

    University of Waterloo, Canada

    7 publications · 358 citations

    7

    h-index

  4. WV
    Wim van Dam

    University of California, Santa Barbara, United States

    6 publications · 457 citations

    6

    h-index

  5. AR
    Alexander Russell

    University of Connecticut, United States

    6 publications · 312 citations

    6

    h-index

1–5 of 66

Venues

  1. Quantum Information and Computation

    QIC · 7 publications · 108 citations

    7

    h-index

  2. arXiv (Cornell University)

    Repository · 6 publications · 143 citations

    6

    h-index

  3. ArXiv.org

    Repository · 5 publications · 167 citations

    5

    h-index

  4. SIAM Journal on Computing

    5 publications · 807 citations

    5

    h-index

  5. CaltechAUTHORS (California Institute of Technology)

    Repository · 2 publications · 104 citations

    2

    h-index

1–5