Quantum Routing Algorithms

Quant maching Algorithms is a class of quantum algorithms designed to solve routing problems by leveraging quantum superposition and entanglement to optimize pathfinding and information routing in quantum networks more efficiently than classical routing strategies.

52

Publications

2.9K

Citations

163

Authors

80

Institutions

Publications per year

2017–2026

33

Variants

Quantum Routing Algorithm

Authors

163

  1. PB
    Panagiotis Botsinis

    University of Southampton, United Kingdom

    4 publications · 107 citations

    4

    h-index

  2. DA
    Dimitrios Alanis

    University of Southampton, United Kingdom

    4 publications · 107 citations

    4

    h-index

  3. SX
    Soon Xin Ng

    University of Southampton, United Kingdom

    4 publications · 107 citations

    4

    h-index

  4. SS
    Shouqian Shi

    University of California, Santa Cruz, United States

    3 publications · 271 citations

    3

    h-index

  5. ZB
    Zunaira Babar

    University of Southampton, United Kingdom

    3 publications · 61 citations

    3

    h-index

1–5 of 163

Venues

  1. IEEE Access

    6 publications · 407 citations

    6

    h-index

  2. Quantum Information Processing

    5 publications · 140 citations

    5

    h-index

  3. IEEE Transactions on Communications

    2 publications · 125 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 115 citations

    2

    h-index

  5. IEEE/ACM Transactions on Networking

    TON · 2 publications · 79 citations

    2

    h-index

1–5