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
Parents
52
Optimal Routing for Quantum Networks
Marcello Caleffi · IEEE Access · 2017 · 233 citations · Full text
Computing, Computer Science, Physics +17
Concurrent Entanglement Routing for Quantum Networks
Shouqian Shi, Chen Qian · 2020 · 174 citations · Full text
Formulating and Solving Routing Problems on Quantum Computers
Stuart M. Harwood, Claudio Gambella, Dimitar Trenev et al. · IEEE Transactions on Quantum Engineering · 2021 · 145 citations · Full text
1–5 of 52
163
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 163
80
University of Southampton
Southampton, United Kingdom
7 h-index
24 publications
664 citations

Hungarian Academy of Sciences
Budapest, Hungary
3 h-index
3 publications
139 citations
University of California, Santa Cruz
Santa Cruz, United States
3 h-index
7 publications
603 citations

Budapest University of Technology and Economics
Budapest, Hungary
3 h-index
6 publications
278 citations
University of Science and Technology of China
Hefei, China
2 h-index
10 publications
758 citations

Indian Institute of Science Education and Research Kolkata
Kolkata, India
2 h-index
6 publications
476 citations
University of Technology Sydney
Sydney, Australia
1 h-index
2 publications
62 citations
Devi Ahilya Vishwavidyalaya
Indore, India
1 h-index
1 publications
21 citations
1–8 of 80
6 publications · 407 citations
6
h-index
5 publications · 140 citations
5
h-index
2 publications · 125 citations
2
h-index
Repository · 2 publications · 115 citations
2
h-index
TON · 2 publications · 79 citations
2
h-index
1–5