Quantum Search Algorithms

Quantum Search Algorithms is a class of quantum algorithms designed to efficiently locate specific items within unstructured or semi-structured databases by leveraging quantum superposition and interference, thereby achieving provable speedups over classical search methods.

720

Publications

53.3K

Citations

1.5K

Authors

671

Institutions

Publications per year

2017–2026

237

Authors

1.5K

  1. LK
    Lov K. Grover

    Nokia (United States), United States

    22 publications · 15K citations

    19

    h-index

  2. YC
    Yao–Hsin Chou

    National Chi Nan University, Taiwan

    14 publications · 491 citations

    14

    h-index

  3. SK
    Shu–Yu Kuo

    National Chi Nan University, Taiwan

    12 publications · 432 citations

    12

    h-index

  4. AA
    Andris Ambainis

    University of Latvia, Latvia

    14 publications · 984 citations

    12

    h-index

  5. TG
    Thomas G. Wong

    University of Latvia, Latvia

    13 publications · 499 citations

    12

    h-index

1–5 of 1.5K

Venues

  1. Physical Review A

    PRA · 94 publications · 7.2K citations

    40

    h-index

  2. Physical Review Letters

    PRL · 34 publications · 9.5K citations

    30

    h-index

  3. Physical review. A/Physical review, A

    PRA · 40 publications · 1.4K citations

    22

    h-index

  4. Quantum Information Processing

    25 publications · 919 citations

    18

    h-index

  5. arXiv (Cornell University)

    Repository · 25 publications · 789 citations

    16

    h-index

1–5