Quantum Walk Algorithms

Quantum Walk Algorithms is a quantum computational method that generalizes classical random walks by leveraging quantum superposition and interference to explore state spaces more efficiently than its classical counterparts.

370

Publications

24K

Citations

678

Authors

348

Institutions

Publications per year

2017–2026

153

Authors

678

  1. AM
    Andrew M. Childs

    University of Waterloo, Canada

    17 publications · 3K citations

    17

    h-index

  2. JW
    Jingbo Wang

    The University of Western Australia, Australia

    14 publications · 680 citations

    14

    h-index

  3. TG
    Thomas G. Wong

    University of Latvia, Latvia

    17 publications · 624 citations

    14

    h-index

  4. AA
    Andris Ambainis

    University of Latvia, Latvia

    15 publications · 2.6K citations

    13

    h-index

  5. VK
    Viv Kendon

    University of Leeds, United Kingdom

    12 publications · 1.4K citations

    12

    h-index

1–5 of 678

Venues

  1. Physical Review A

    PRA · 49 publications · 5.2K citations

    31

    h-index

  2. Quantum Information Processing

    44 publications · 1.6K citations

    24

    h-index

  3. Physical review. A/Physical review, A

    PRA · 35 publications · 857 citations

    19

    h-index

  4. Physical Review Letters

    PRL · 17 publications · 2.1K citations

    17

    h-index

  5. arXiv (Cornell University)

    Repository · 16 publications · 455 citations

    13

    h-index

1–5